Fast magic state preparation by gauging higher-form transversal gates in parallel
- URL: http://arxiv.org/abs/2601.22939v1
- Date: Fri, 30 Jan 2026 12:55:53 GMT
- Title: Fast magic state preparation by gauging higher-form transversal gates in parallel
- Authors: Dominic J. Williamson,
- Abstract summary: We introduce a fast code surgery procedure that performs a fault-tolerant measurement of many logic gates in parallel.<n>The time overhead of our procedure is constant, and the qubit overhead is linear.<n>This motivates the search for good quantum low-density parity-check codes that support higher-form Clifford gates.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Magic states are a foundational resource for universal quantum computation. To survive in a realistic noisy environment, magic states must be prepared fault-tolerantly and protected by a quantum error-correcting code. The recent discovery of highly efficient quantum low-density parity-check codes, together with efficient logic gates, lays the groundwork for low-overhead fault-tolerant quantum computation. This motivates the search for fast and parallel protocols for logical magic state preparation to enable universal quantum computation. Here, we introduce a fast code surgery procedure that performs a fault-tolerant measurement of many transversal logic gates in parallel. This is achieved by performing a generalized gauging measurement on a quantum code that supports a higher-form transversal gate. The time overhead of our procedure is constant, and the qubit overhead is linear. The procedure inherits fault-tolerance properties from the base code and the structure of the higher-form transversal gate. When applied to codes that support higher-form Clifford gates our procedure achieves fast and fault-tolerant preparation of many magic states in parallel. This motivates the search for good quantum low-density parity-check codes that support higher-form Clifford gates.
Related papers
- Magic state cultivation on a superconducting quantum processor [108.15404500422814]
We present an experimental study of magic state cultivation on a superconducting quantum processor.<n>Cultivation reduces the error by a factor of 40, with a state fidelity of 0.9999(1).
arXiv Detail & Related papers (2025-12-15T21:29:40Z) - Simple logical quantum computation with concatenated symplectic double codes [0.0]
We show that symplectic double codes have promising performance at near state-of-the-art physical error rates.<n>We argue that symplectic double codes are strong contenders as the underlying computational code on medium- to large-scale quantum computers.
arXiv Detail & Related papers (2025-10-21T16:00:44Z) - Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer.<n>Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
arXiv Detail & Related papers (2024-12-19T18:38:46Z) - Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing [0.0]
We propose high-rate small-size quantum error-detecting codes as a new family of high-rate quantum codes.
Their simple structure allows for a geometrical interpretation using hypercubes corresponding to logical qubits.
We achieve high error thresholds even in a circuit-level noise model.
arXiv Detail & Related papers (2024-03-24T07:46:26Z) - Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code [0.0]
We observe improved performance for encoded circuits implementing non-Clifford gates.<n>Our results illustrate the potential of using codes with quantum gates to implement non-trivial algorithms.
arXiv Detail & Related papers (2023-09-15T18:00:02Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - 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) - Demonstration of fault-tolerant universal quantum gate operations [1.1817296279855427]
Quantum computers can be protected from noise by encoding the logical quantum information redundantly into multiple qubits.
Errors caused by imperfect operations do not spread uncontrollably through the quantum register.
We demonstrate a fault-tolerant universal set of gates on two logical qubits in a trapped-ion quantum computer.
arXiv Detail & Related papers (2021-11-24T17:34:14Z) - 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) - Classical Coding Approaches to Quantum Applications [2.5382095320488665]
In deep-space optical communications, current receivers for the pure-state-quantum channel first measure each qubit channel output and then classically post-process the measurements.
In this dissertation we investigate a recently proposed quantum algorithm for this task, which is inspired by classical belief-propagation algorithms.
We show that the algorithm is optimal for each bit and it appears to achieve optimal performance when deciding the full transmitted message.
arXiv Detail & Related papers (2020-04-14T23:31:46Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
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.