Partitioning qubits in hypergraph product codes to implement logical
gates
- URL: http://arxiv.org/abs/2204.10812v3
- Date: Tue, 17 Oct 2023 12:47:50 GMT
- Title: Partitioning qubits in hypergraph product codes to implement logical
gates
- Authors: Armanda O. Quintavalle, Paul Webster, Michael Vasmer
- Abstract summary: Transversal gates are the simplest type of fault-tolerant logical gates.
We show that gates can be used as the basis for universal quantum computing on LDPC codes.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The promise of high-rate low-density parity check (LDPC) codes to
substantially reduce the overhead of fault-tolerant quantum computation depends
on constructing efficient, fault-tolerant implementations of logical gates on
such codes. Transversal gates are the simplest type of fault-tolerant gate, but
the potential of transversal gates on LDPC codes has hitherto been largely
neglected. We investigate the transversal gates that can be implemented in
hypergraph product codes, a class of LDPC codes. Our analysis is aided by the
construction of a symplectic canonical basis for the logical operators of
hypergraph product codes, a result that may be of independent interest. We show
that in these codes transversal gates can implement Hadamard (up to logical
SWAP gates) and control-Z on all logical qubits. Moreover, we show that
sequences of transversal operations, interleaved with error correction, allow
implementation of entangling gates between arbitrary pairs of logical qubits in
the same code block. We thereby demonstrate that transversal gates can be used
as the basis for universal quantum computing on LDPC codes, when supplemented
with state injection.
Related papers
- Efficient recursive encoders for quantum Reed-Muller codes towards Fault tolerance [2.2940141855172036]
Efficient encoding circuits for quantum codes that admit gates are crucial to reduce noise and realize useful quantum computers.
We construct resource efficient encoders for the class of quantum codes constructed from Reed-Muller and punctured Reed-Muller codes.
These encoders on $n$ qubits have circuit depth of $O(log n)$ and lower gate counts compared to previous works.
arXiv Detail & Related papers (2024-05-23T13:28:52Z) - Experimental fault-tolerant code switching [1.9088985324817254]
We present the first experimental implementation of fault-tolerant code switching between two codes.
We construct logical circuits and prepare 12 different logical states which are not accessible in a fault-tolerant way within a single code.
Our results experimentally open up a new route towards deterministic control over logical qubits with low auxiliary qubit overhead.
arXiv Detail & Related papers (2024-03-20T16:40:57Z) - Toward Constructing a Continuous Logical Operator for Error-Corrected
Quantum Sensing [0.0]
Operations on logical qubits are only performed through universal gate sets consisting of finite-sized gates such as Clifford+T.
The Eastin-Knill theorem prevents a continuous signal from being both fault tolerant to local errors and transverse.
A protocol to design continuous logical z-rotations is proposed and applied to the Steane Code.
arXiv Detail & Related papers (2023-04-30T18:22:34Z) - Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.
We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
arXiv Detail & Related papers (2023-03-24T00:29:15Z) - Hierarchical memories: Simulating quantum LDPC codes with local gates [0.05156484100374058]
Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories.
We construct a new family of hierarchical codes, that encode a number of logical qubits K = Omega(N/log(N)2.
Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.
arXiv Detail & Related papers (2023-03-08T18:48:12Z) - Neural Belief Propagation Decoding of Quantum LDPC Codes Using
Overcomplete Check Matrices [60.02503434201552]
We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix.
This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
arXiv Detail & Related papers (2022-12-20T13:41:27Z) - Transversal Injection: A method for direct encoding of ancilla states
for non-Clifford gates using stabiliser codes [55.90903601048249]
We introduce a protocol to potentially reduce this overhead for non-Clifford gates.
Preliminary results hint at high quality fidelities at larger distances.
arXiv Detail & Related papers (2022-11-18T06:03:10Z) - Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions.
We explore novel schemes for universal logic that improve resource overheads.
Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
arXiv Detail & Related papers (2021-12-22T19:00:03Z) - Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete.
We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes.
Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z) - Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing.
In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
arXiv Detail & Related papers (2021-05-28T15:20:21Z)
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.