Constant Depth Code Deformations in the Parity Architecture
arXiv:2303.08602 · doi:10.1109/QCE57702.2023.00022
Abstract
We present a protocol to encode and decode arbitrary quantum states in the parity architecture with constant circuit depth using measurements, local nearest-neighbor and single-qubit operations only. While this procedure typically requires a quadratic overhead of simultaneous qubit measurements, it allows for a simple and low-depth implementation of logical multi-qubit gates in the parity encoding via code deformation. We discuss how such encoding and decoding schemes can be used to flexibly change the size and shape of the underlying code to enable a more efficient implementation of quantum gates or algorithms. We apply the new findings to the QAOA which leads to a constant depth implementation using local gates at the same optimization performance as the standard, potentially non-local, QAOA approach without the parity encoding. Furthermore, we show that our method can reduce the depth of implementing the quantum Fourier transform by a factor of two when allowing measurements.
arXiv comment11 pages, 8 figures
References in corpus (28)
- Quantum Computing in the NISQ era and beyond
- Surface codes: Towards practical large-scale quantum computation
- A Quantum Approximate Optimization Algorithm
- Measurement-based quantum computation with cluster states
- Quantum Error Correction for Quantum Memories
- Quantum annealing with more than one hundred qubits
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum computing with atomic qubits and Rydberg interactions: Progress and challenges
- Surface code quantum computing by lattice surgery
- Complete universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits
- Demonstration of fault-tolerant universal quantum gate operations
- The Bitter Truth About Quantum Algorithms in the NISQ Era
- Photonic tensor networks produced by a single quantum emitter
- Parameter Concentration in Quantum Approximate Optimization
- Quantum Measurements and Gates by Code Deformation
- Robust quantum optimizer with full connectivity
- Code Deformation and Lattice Surgery Are Gauge Fixing
- Impact of qubit connectivity on quantum algorithm performance
- Limitations in quantum computing from resource constraints
- Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller Annealer
- Error propagation in NISQ devices for solving classical optimization problems
- Depth optimization of CZ, CNOT, and Clifford circuits
- Parity Quantum Optimization: Compiler
- Synthesis of and compilation with time-optimal multi-qubit gates
- Modular Parity Quantum Approximate Optimization
- Parity Quantum Optimization: Benchmarks
- Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization
- Constructive plaquette compilation for the parity architecture