Everything You Always Wanted to Know About Quantum Circuits
arXiv:2208.11725 · doi:10.1002/047134608X.W8440
Abstract
In this work, we provide an overview of circuits for quantum computing. We introduce gates used in quantum computation and then present resource cost measurements used to evaluate circuits made from these gates. We then illustrate how the gates shown are then combined into quantum circuits for basic arithmetic functions. Architectures for addition, subtraction, multiplication, and division are shown. We demonstrate how to calculate the resource costs of quantum circuits. We conclude this overview with by illustrating an application of the elementary quantum circuits for the image rotation operation.
arXiv commentThe version posted is the submitted version accepted for publication and the final published article is online available: https://onlinelibrary.wiley.com/doi/abs/10.1002/047134608X.W8440
References in corpus (32)
- Topological Insulators
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Surface codes: Towards practical large-scale quantum computation
- Probing many-body dynamics on a 51-atom quantum simulator
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Validating quantum computers using randomized model circuits
- High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- High threshold universal quantum computation on the surface code
- Methodology for quantum logic gate constructions
- Universal quantum logic in hot silicon qubits
- Active stabilisation, quantum computation and quantum state synthesis
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Quantum circuits of T-depth one
- Quantum arithmetic with the Quantum Fourier Transform
- Fast quantum algorithm for numerical gradient estimation
- Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
- Requirements for fault-tolerant factoring on an atom-optics quantum computer
- Design of Efficient Reversible Logic Based Binary and BCD Adder Circuits
- Clifford Gates by Code Deformation
- Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
- Quantum Fourier Transform in Computational Basis
- Scalability of Shor's algorithm with a limited set of rotation gates
- Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
- Quantum algorithm for visual tracking
- Arithmetic Circuits for Multilevel Qudits Based on Quantum Fourier Transform
- Quantum algorithms for testing properties of distributions
- On the security and degradability of Gaussian channels
- Quantum Online Memory Checking
- Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
- Quantum-enhanced least-square support vector machine: simplified quantum algorithm and sparse solutions
- Quantum Algorithm for Triangle Finding in Sparse Graphs