Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
- URL: http://arxiv.org/abs/2411.13142v1
- Date: Wed, 20 Nov 2024 09:16:07 GMT
- Title: Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
- Authors: Yingkai Ouyang, Yumang Jing, Gavin K. Brennen,
- Abstract summary: We present a measurement-free code-switching protocol for universal quantum computation.
The novel non-Clifford gates enabled by this code-switching protocol enable implementation of a universal gate set more efficient than the Clifford$+T$ gate set.
- Score: 6.281229317487581
- License:
- Abstract: Transversal gates on quantum error correction codes have been a promising approach for fault-tolerant quantum computing, but are limited by the Eastin-Knill no-go theorem. Existing solutions like gate teleportation and magic state distillation are resource-intensive. We present a measurement-free code-switching protocol for universal quantum computation, switching between a stabiliser code for transversal Cliffords and a permutation-invariant code for transversal non-Cliffords that are logical $Z$ rotations for any rational multiple of $\pi$. The novel non-Clifford gates enabled by this code-switching protocol enable implementation of a universal gate set more efficient than the Clifford$+T$ gate set. To achieve this, we present a protocol for performing controlled-NOTs between the codes using near-term quantum control operations that employ a catalytic bosonic mode.
Related papers
- 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.
We analyze application of the scheme to low-distance color codes, which are suitable for operation in existing quantum processors.
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) - Logical Gates and Read-Out of Superconducting Gottesman-Kitaev-Preskill Qubits [0.0]
In superconducting circuits, all the required two-qubit gates can be implemented with a single piece of hardware.
We analyze the error-spreading properties of GKP Clifford gates and describe how a modification in the decoder can reduce the gate infidelity by multiple orders of magnitude.
arXiv Detail & Related papers (2024-03-04T19:00:04Z) - 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.
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) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - 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) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Error mitigation for universal gates on encoded qubits [5.774786149181392]
We show how to implement Clifford+T circuits with a number of T-gates inversely proportional to the physical noise rate.
We argue that such circuits can be out of reach for state-of-the-art classical simulation algorithms.
arXiv Detail & Related papers (2021-03-08T17:27:04Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z)
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.