ZX-calculus for the working quantum computer scientist

J van de Wetering - arXiv preprint arXiv:2012.13966, 2020 - arxiv.org
The ZX-calculus is a graphical language for reasoning about quantum computation that has
recently seen an increased usage in a variety of areas such as quantum circuit optimisation …

Implementing Grover oracles for quantum key search on AES and LowMC

S Jaques, M Naehrig, M Roetteler, F Virdia - Advances in Cryptology …, 2020 - Springer
Grover's search algorithm gives a quantum attack against block ciphers by searching for a
key that matches a small number of plaintext-ciphertext pairs. This attack uses O (N) O (N) …

Quantum circuit optimization with deep reinforcement learning

T Fösel, MY Niu, F Marquardt, L Li - arXiv preprint arXiv:2103.07585, 2021 - arxiv.org
A central aspect for operating future quantum computers is quantum circuit optimization, ie,
the search for efficient realizations of quantum algorithms given the device capabilities. In …

Reducing the number of non-Clifford gates in quantum circuits

A Kissinger, J van de Wetering - Physical Review A, 2020 - APS
We present a method for reducing the number of non-Clifford quantum gates, in particularly
T-gates, in a circuit, an important task for efficiently implementing fault-tolerant quantum …

[HTML][HTML] Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus

R Duncan, A Kissinger, S Perdrix… - Quantum, 2020 - quantum-journal.org
We present a completely new approach to quantum circuit optimisation, based on the ZX-
calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower …

staq—A full-stack quantum processing toolkit

M Amy, V Gheorghiu - Quantum Science and Technology, 2020 - iopscience.iop.org
We describe staq, a full-stack quantum processing toolkit written in standard C++. staq is a
quantum compiler toolkit, comprising of tools that range from quantum optimizers and …

Fast and effective techniques for T-count reduction via spider nest identities

N de Beaudrap, X Bian, Q Wang - arXiv preprint arXiv:2004.05164, 2020 - arxiv.org
In fault-tolerant quantum computing systems, realising (approximately) universal quantum
computation is usually described in terms of realising Clifford+ T operations, which is to say …

Reducing T-count with the ZX-calculus

A Kissinger, J van de Wetering - arXiv preprint arXiv:1903.10477, 2019 - arxiv.org
Reducing the number of non-Clifford quantum gates present in a circuit is an important task
for efficiently implementing quantum computations, especially in the fault-tolerant regime …

Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects

Y Ge, W Wenjie, C Yuheng, P Kaisen, L Xudong… - arXiv preprint arXiv …, 2024 - arxiv.org
Quantum computing is regarded as a promising paradigm that may overcome the current
computational power bottlenecks in the post-Moore era. The increasing maturity of quantum …

Optimal fault-tolerant quantum comparators for image binarization

F Orts, G Ortega, AC Cucura, E Filatovas… - The Journal of …, 2021 - Springer
Quantum image processing focuses on the use of quantum computing in the field of digital
image processing. In the last few years, this technique has emerged since the properties …