Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes
arXiv:2408.01339 · doi:10.1103/PhysRevLett.134.070602
Abstract
We propose schemes capable of measuring an arbitrary set of commutative logical Pauli operators in time independent of the number of operators. The only condition is commutativity, a fundamental requirement for simultaneous measurements in quantum mechanics. Quantum low-density parity check (qLDPC) codes show great promise for realizing fault-tolerant quantum computing. They are particularly significant for early fault-tolerant technologies as they can encode many logical qubits using relatively few physical qubits. By achieving simultaneous measurements of logical operators, our approaches enable fully parallelized quantum computing, thus minimizing computation time. Our schemes are applicable to any qLDPC codes and maintain the low density of parity checks while measuring multiple logical operators simultaneously. These results enhance the feasibility of applying early fault-tolerant technologies to practical problems.
References in corpus (17)
- Surface codes: Towards practical large-scale quantum computation
- Logical quantum processor based on reconfigurable atom arrays
- Surface code quantum computing by lattice surgery
- High-fidelity parallel entangling gates on a neutral atom quantum computer
- High-threshold and low-overhead fault-tolerant quantum memory
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Stabilizer Formalism for Operator Quantum Error Correction
- Quantum Low-Density Parity-Check Codes
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Quantum computation with realistic magic state factories
- Single-shot fault-tolerant quantum error correction
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- Single-shot error correction of three-dimensional homological product codes
- Code Deformation and Lattice Surgery Are Gauge Fixing
- Combining hard and soft decoders for hypergraph product codes
- Robust projective measurements through measuring code-inspired observables
Cited by in corpus (5)
- Low-overhead fault-tolerant quantum computation by gauging logical operators
- Noise-Agnostic Unbiased Quantum Error Mitigation for Logical Qubits
- Parallel Logical Measurements via Quantum Code Surgery
- Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes
- Feedforward suppression of readout-induced faults in quantum error correction