Linear Depth Stabilizer and Quantum Fourier Transformation Circuits with no Auxiliary Qubits in Finite Neighbor Quantum Architectures

Abstract

In this paper, we investigate how quantum architectures affect the efficiency of the execution of the quantum Fourier transform (QFT) and linear transformations, which are essential parts of the stabilizer/Clifford group circuits. In particular, we show that in most common and realistic physical architectures including the linear nearest neighbor, two-dimensional lattice, and bounded degree graph (containing a chain of length n), n-qubit QFT and n-qubit stabilizer circuits can be parallelized to linear depth using no auxiliary qubits. We construct lower bounds that show the efficiency of our approach.

8 pages, 6 figures. Extended discussions, improved presentation

References in corpus (17)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Mixed State Entanglement and Quantum Error Correction
• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• Improved Simulation of Stabilizer Circuits
• Scalable multi-particle entanglement of trapped ions
• A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
• Quantum teleportation between light and matter
• A geometric theory of non-local two-qubit operations
• An approximate Fourier transform useful in quantum factoring
• Benchmarking quantum control methods on a 12-qubit system
• Hydrogenic Spin Quantum Computing in Silicon: A Digital Approach
• Ultra-long distance interaction between spin qubits
• Fast parallel circuits for the quantum Fourier transform
• Quantum Error Correction on Linear Nearest Neighbor Qubit Arrays
• Quantum computing with trapped ions, atoms and light
• Efficient Synthesis of Linear Reversible Circuits
• Parallel Quantum Computation and Quantum Codes

Cited by in corpus (29)

• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Synthesis and Optimization of Reversible Circuits - A Survey
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
• Parallel Entangling Operations on a Universal Ion Trap Quantum Computer
• Quantum Circuit Placement
• Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• Approximate Quantum Fourier Transform with $O(n\log (n))$ T gates
• Quantum Fourier Transform Has Small Entanglement
• Unifying gate-synthesis and magic state distillation
• Circuit Transformations for Quantum Architectures
• Approximating many-body quantum states with quantum circuits and measurements
• Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost
• Reducing the Depth of Linear Reversible Quantum Circuits
• An $\Theta (\sqrt{n})$-depth Quantum Adder on a 2D NTC Quantum Computer Architecture
• Optimization of Clifford Circuits
• Phase polynomials synthesis algorithms for NISQ architectures and beyond
• Optimal local unitary encoding circuits for the surface code
• On the Effect of Quantum Interaction Distance on Quantum Addition Circuits
• Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits
• Nonlocal quantum information in bipartite quantum error correction
• Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes
• Hardware-Tailored Diagonalization Circuits
• SWAP-less Implementation of Quantum Algorithms
• On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
• Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions
• Benchmarking Digital-Analog Quantum Computation
• A Quantum Physical Design Flow Using ILP and Graph Drawing