Quantum error correction meets continuous symmetries: fundamental trade-offs and case studies

• URL: http://arxiv.org/abs/2111.06360v4
• Date: Fri, 8 Dec 2023 17:04:36 GMT
• Title: Quantum error correction meets continuous symmetries: fundamental trade-offs and case studies
• Authors: Zi-Wen Liu and Sisi Zhou
• Abstract summary: We study the fundamental competition between quantum error correction (QEC) and continuous symmetries. Three meaningful measures of approximate symmetries in quantum channels are introduced and studied. We derive various forms of trade-off relations between the QEC inaccuracy and all symmetry violation measures.
• Score: 0.6526824510982799
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We systematically study the fundamental competition between quantum error correction (QEC) and continuous symmetries, two key notions in quantum information and physics, in a quantitative manner. Three meaningful measures of approximate symmetries in quantum channels and in particular QEC codes, respectively based on the violation of covariance conditions over the entire symmetry group or at a local point, and the violation of charge conservation, are introduced and studied. Each measure induces a corresponding characterization of approximately covariant codes. We explicate a host of different ideas and techniques that enable us to derive various forms of trade-off relations between the QEC inaccuracy and all symmetry violation measures. More specifically, we introduce two frameworks for understanding and establishing the trade-offs respectively based on the notions of charge fluctuation and gate implementation error, and employ methods including the Knill--Laflamme conditions as well as quantum metrology and quantum resource theory for the derivation. From the perspective of fault-tolerant quantum computing, our bounds on symmetry violation indicate limitations on the precision or density of transversally implementable logical gates for general QEC codes, refining the Eastin--Knill theorem. To exemplify nontrivial approximately covariant codes and understand the achievability of the above fundamental limits, we analyze the behaviors of two explicit types of codes: a parametrized extension of the thermodynamic code (which gives a construction of a code family that continuously interpolates between exact QEC and exact symmetry), and the quantum Reed--Muller codes. We show that both codes can saturate the scaling of the bounds for group-global covariance and charge conservation asymptotically, indicating the near-optimality of these bounds and codes.

Related papers

• Error Threshold of SYK Codes from Strong-to-Weak Parity Symmetry Breaking [1.9765390080572334]
  We study the impacts of decoherence on the information-theoretic capacity of SYK models and their variants. We find that under the strong fermion parity symmetric noise, the mixed state undergoes the strong to weak spontaneous symmetry breaking of fermion parity. Our results highlight the degradation of wormhole traversability in realistic quantum scenarios.
  arXiv  Detail & Related papers  (2024-10-31T17:59:59Z)
• Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
  We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry. For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
  arXiv  Detail & Related papers  (2024-06-06T18:04:39Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Quantum error mitigation for rotation symmetric bosonic codes with symmetry expansion [0.2770822269241974]
  We propose a class of quantum error mitigation that virtually projects the state onto the noise-free symmetric subspace. We show that symmetry expansion dramatically suppresses the effect of photon loss. Our novel error mitigation method will significantly enhance computation accuracy in the near-term bosonic quantum computing paradigm.
  arXiv  Detail & Related papers  (2022-11-11T12:33:11Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries [1.2183405753834557]
  We analytically study the most essential cases of $U(1)$ and $SU(d)$ symmetries. We show that for both symmetry groups the error of the covariant codes generated by Haar-random symmetric unitaries, typically scale as $O(n-1)$ in terms of both the average- and worst-case distances against erasure noise.
  arXiv  Detail & Related papers  (2021-12-02T18:46:34Z)
• Approximate symmetries and quantum error correction [0.6526824510982799]
  Quantum error correction (QEC) is a key concept in quantum computation as well as many areas of physics. We study the competition between continuous symmetries and QEC in a quantitative manner. We showcase two explicit types of quantum codes, obtained from quantum Reed--Muller codes and thermodynamic codes, that nearly saturate our bounds.
  arXiv  Detail & Related papers  (2021-11-11T18:09:33Z)
• Charge-conserving unitaries typically generate optimal covariant quantum error-correcting codes [1.2183405753834557]
  We consider the quantum error correction capability of random covariant codes. In particular, we show that $U(1)$-covariant codes generated by Haar random $U(1)$-symmetric unitaries saturate the fundamental limits to leading order. Our results hold for symmetric variants of unitary 2-designs, and comment on the convergence problem of charge-conserving random circuits.
  arXiv  Detail & Related papers  (2021-02-23T18:11:15Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.