Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward
- URL: http://arxiv.org/abs/2607.08508v1
- Date: Thu, 09 Jul 2026 14:03:43 GMT
- Title: Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward
- Abstract summary: We develop a theory of quantum gate teleportation protocols that implement non-Clifford gates on arbitrary input states.<n>We identify conditions under which the feedforward operators can be implemented by Pauli operators.
- Score: 42.683145133940975
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Quantum gate teleportation is a key technique in fault-tolerant quantum computation that uses resource states to implement logical gates. Here, we develop a theory of quantum gate teleportation protocols that implement non-Clifford gates on arbitrary input states without revealing any information about them; we refer to these protocols as magic gate teleportation (MGT). We uncover a hidden structure within MGT -- after backpropagating the Pauli measurements, MGT protocols can be viewed as encoding the input state into a stabilizer code heralded by the measurement outcomes, followed by a logical non-Clifford gate. Using this structure, we construct MGT protocols for any resource state obtained by applying commuting Pauli rotations to a stabilizer state, and provide an efficient algorithm for synthesizing their circuit implementations. Conversely, we prove that useful resource states for MGT, i.e., states that can be used for non-Clifford gates through MGT protocols, are necessarily Clifford-equivalent to diagonal states; in particular, the output state distilled from the $[\![5, 1, 3]\!]$ protocol is not useful for MGT. Finally, we identify conditions under which the feedforward operators can be implemented by Pauli operators, shedding light on the paradigm of algorithmic fault tolerance and simplifying the feedforward operations needed for quantum computing.
Related papers
- Addressable gate-based logical computation with quantum LDPC codes [0.0]
High-rate quantum LDPC codes can reduce error correction overhead, yet realizing high-rate fault-tolerant computation with these codes remains a central challenge.<n>We introduce a gate-based protocol for addressable single- and multi-qubit Clifford operations on individual qubits encoded within one or more quantum LDPC codes.
arXiv Detail & Related papers (2025-11-08T20:26:24Z) - Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
arXiv Detail & Related papers (2024-12-19T18:55:44Z) - Measurement-free code-switching for low overhead quantum computation using permutation invariant codes [3.058685580689604]
We present a measurement-free code-switching protocol for universal quantum teleportation, a stabiliser code for Cliffords and a permutation-invariant code for non-Cliffords.<n>Non-Clifford gates enabled by this code-switching protocol provide for a lower gate count implementation of a universal gate set relative to the Clifford$+T$ gate set.<n>We also present a new class of PI codes with tunable code distance, supporting non-Clifford gates.
arXiv Detail & Related papers (2024-11-20T09:16:07Z) - Efficient fault-tolerant code switching via one-way transversal CNOT gates [0.0]
We present a code scheme that respects the constraints of FT circuit design by only making use of switching gates.<n>We analyze application of the scheme to low-distance color codes, which are suitable for operation in existing quantum processors.<n>We discuss how the scheme can be implemented with a large degree of parallelization, provided that logical auxiliary qubits can be prepared reliably enough.
arXiv Detail & Related papers (2024-09-20T12:54:47Z) - 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) - Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages.
The computation can then be implemented using a series of non-Pauli measurements on this graph state.
arXiv Detail & Related papers (2022-09-15T14:52:31Z) - 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.