Charge-conserving unitaries typically generate optimal covariant quantum error-correcting codes

• URL: http://arxiv.org/abs/2102.11835v1
• Date: Tue, 23 Feb 2021 18:11:15 GMT
• Title: Charge-conserving unitaries typically generate optimal covariant quantum error-correcting codes
• Authors: Linghang Kong, Zi-Wen Liu
• Abstract summary: 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.
• Score: 1.2183405753834557
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction and symmetries play central roles in quantum information science and physics. It is known that quantum error-correcting codes covariant with respect to continuous symmetries cannot correct erasure errors perfectly (an important case being the Eastin-Knill theorem), in contrast to the case without symmetry constraints. Furthermore, there are fundamental limits on the accuracy of such covariant codes for approximate quantum error correction. Here, 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, i.e. unitaries that commute with the charge operator (or conserve the charge), typically saturate the fundamental limits to leading order in terms of both the average- and worst-case purified distances against erasure noise. We note that the results hold for symmetric variants of unitary 2-designs, and comment on the convergence problem of charge-conserving random circuits. Our results not only indicate (potentially efficient) randomized constructions of optimal $U(1)$-covariant codes, but also reveal fundamental properties of random charge-conserving unitaries, which may underlie important models of complex quantum systems in wide-ranging physical scenarios where conservation laws are present, such as black holes and many-body spin systems.

Related papers

• Covariant Quantum Error-Correcting Codes with Metrological Entanglement Advantage [0.9499648210774583]
  We show that a subset of the basis for the irreducible representations of the total $SU(2)$ rotation forms a covariant approximate quantum error-correcting code with $U(1)$ logical gates.
  arXiv  Detail & Related papers  (2024-09-30T17:59:01Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Non-Abelian braiding of graph vertices in a superconducting processor [144.97755321680464]
  Indistinguishability of particles is a fundamental principle of quantum mechanics. braiding of non-Abelian anyons causes rotations in a space of degenerate wavefunctions. We experimentally verify the fusion rules of the anyons and braid them to realize their statistics.
  arXiv  Detail & Related papers  (2022-10-19T02:28:44Z)
• 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)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• 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)
• Quantum error correction meets continuous symmetries: fundamental trade-offs and case studies [0.6526824510982799]
  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.
  arXiv  Detail & Related papers  (2021-11-11T18:19:50Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Universal quantum computation with symmetric qubit clusters coupled to an environment [0.3670422696827526]
  We propose a scalable scheme for universal quantum computation where cores play the role of quantum-computational transistors, quansistors. We include quantum errors as a main source of decoherence, and show that symmetry makes logical operations particularly resilient to untimely anisotropic qubit rotations. Many of our results can be generalized to higher-level omega-rotation-invariant systems, or adapted to clusters with other symmetries.
  arXiv  Detail & Related papers  (2021-06-01T19:59:41Z)
• New perspectives on covariant quantum error correction [3.3811802886738462]
  We prove new and powerful lower bounds on the infidelity of covariant quantum error correction. Explicit lower bounds are derived for both erasure and depolarizing noises. We also present a type of covariant codes which nearly saturates these lower bounds.
  arXiv  Detail & Related papers  (2020-05-25T04:33:59Z)

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.