Quantum algorithms with local particle number conservation: noise effects and error correction

Abstract

Quantum circuits with local particle number conservation (LPNC) restrict the quantum computation to a subspace of the Hilbert space of the qubit register. In a noiseless or fault-tolerant quantum computation, such quantities are preserved. In the presence of noise, however, the evolution's symmetry could be broken and non-valid states could be sampled at the end of the computation. On the other hand, the restriction to a subspace in the ideal case suggest the possibility of more resource efficient error mitigation techniques for circuits preserving symmetries that are not possible for general circuits. Here, we analyze the probability of staying in such symmetry-preserved subspaces under noise, providing an exact formula for local depolarizing noise. We apply our findings to benchmark, under depolarizing noise, the symmetry robustness of XY-QAOA, which has local particle number conserving symmetries, and is a special case of the Quantum Alternating Operator Ansatz. We also analyze the influence of the choice of encoding the problem on the symmetry robustness of the algorithm and discuss a simple adaption of the bit flip code to correct for symmetry-breaking errors with reduced resources.

References in corpus (32)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• Demonstration of a small programmable quantum computer with atomic qubits
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Benchmarking an 11-qubit quantum computer
• Digitized adiabatic quantum computing with a superconducting circuit
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• Repeated Quantum Error Detection in a Surface Code
• High-fidelity readout of trapped-ion qubits
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• $XY$-mixers: analytical and numerical results for QAOA
• Near-optimal quantum circuit for Grover's unstructured search using a transverse field
• Quantum Annealing for Constrained Optimization
• Symmetry-adapted variational quantum eigensolver
• Driver Hamiltonians for constrained optimization in quantum annealing
• Classical algorithms for quantum mean values
• Characterizing local noise in QAOA circuits
• A fast quantum mechanical algorithm for database search
• Classical and Quantum Bounded Depth Approximation Algorithms
• Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm
• Comparison of QAOA with Quantum and Simulated Annealing
• Effects of Quantum Noise on Quantum Approximate Optimization Algorithm
• Forbidden subspaces for level-1 QAOA and IQP circuits

Cited by in corpus (19)

• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Quantum Annealing for Industry Applications: Introduction and Review
• Error mitigation for variational quantum algorithms through mid-circuit measurements
• Fast multi-qubit gates through simultaneous two-qubit gates
• An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation
• Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
• Applying quantum approximate optimization to the heterogeneous vehicle routing problem
• Analytical Framework for Quantum Alternating Operator Ansätze
• Error Mitigation for Deep Quantum Optimization Circuits by Leveraging Problem Symmetries
• Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
• Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
• Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints
• Characterizing Error Mitigation by Symmetry Verification in QAOA
• Enabling High Performance Debugging for Variational Quantum Algorithms using Compressed Sensing
• Experimental Demonstration of Fermionic QAOA with One-Dimensional Cyclic Driver Hamiltonian
• The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
• Dual Map Framework for Noise Characterization of Quantum Computers
• Resource-Efficient Quantum Optimization via Higher-Order Encoding
• Synthesis of Energy-Conserving Quantum Circuits with XY interaction