Qutrit metaplectic gates are a subset of Clifford+T
- URL: http://arxiv.org/abs/2202.09235v2
- Date: Mon, 21 Feb 2022 16:01:35 GMT
- Title: Qutrit metaplectic gates are a subset of Clifford+T
- Authors: Andrew Glaudell, Neil J. Ross, John van de Wetering, Lia Yeh
- Abstract summary: A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily implemented on many fault-tolerant architectures.
For qutrits, there is an equivalent T gate, that, like its qubit analogue, makes Clifford+T approximately universal, is injectable by a magic state, and supports magic state distillation.
It was claimed that a better gate set for qutrits might be Clifford+R, where R=diag (1,1,-1) is the metaplectic gate, as certain protocols and gates could more easily be implemented using the R gate than the T gate
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A popular universal gate set for quantum computing with qubits is Clifford+T,
as this can be readily implemented on many fault-tolerant architectures. For
qutrits, there is an equivalent T gate, that, like its qubit analogue, makes
Clifford+T approximately universal, is injectable by a magic state, and
supports magic state distillation. However, it was claimed that a better gate
set for qutrits might be Clifford+R, where R=diag(1,1,-1) is the metaplectic
gate, as certain protocols and gates could more easily be implemented using the
R gate than the T gate. In this paper we show that when we have at least two
qutrits, the qutrit Clifford+R unitaries form a strict subset of the Clifford+T
unitaries, by finding a direct decomposition of $R \otimes \mathbb{I}$ as a
Clifford+T circuit and proving that the T gate cannot be exactly synthesized in
Clifford+R. This shows that in fact the T gate is at least as powerful as the R
gate, up to a constant factor. Moreover, we additionally show that it is
impossible to find a single-qutrit Clifford+T decomposition of the R gate,
making our result tight.
Related papers
- Targeted Clifford logical gates for hypergraph product codes [61.269295538188636]
We construct explicit targeted logical gates for hypergraph product codes.
As a concrete example, we give logical circuits for the $[[18,2,3]]$ toric code.
arXiv Detail & Related papers (2024-11-26T02:32:44Z) - A T-depth two Toffoli gate for 2D square lattice architectures [49.88310438099143]
We present a novel Clifford+T decomposition of a Toffoli gate.
Our decomposition requires no SWAP gates in order to be implemented on 2D square lattices of qubits.
This decomposition enables shallower, more fault-tolerant quantum computations on both NISQ and error-corrected architectures.
arXiv Detail & Related papers (2023-11-21T10:33:51Z) - Characterising semi-Clifford gates using algebraic sets [0.0]
We study the sets of gates of the third-level of the Clifford hierarchy and their distinguished subsets of nearly diagonal' semi-Clifford gates.
Semi-Clifford gates are important because they can be implemented with far more efficient use of these resource states.
arXiv Detail & Related papers (2023-09-26T18:41:57Z) - 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) - Quantum Fourier Addition, Simplified to Toffoli Addition [92.18777020401484]
We present the first systematic translation of the QFT-addition circuit into a Toffoli-based adder.
Instead of using approximate decompositions of the gates from the QFT circuit, it is more efficient to merge gates.
arXiv Detail & Related papers (2022-09-30T02:36:42Z) - Constructing all qutrit controlled Clifford+T gates in Clifford+T [0.0]
We show how to construct any qutrit multiple-controlled Clifford+T unitary using just Clifford+T gates.
With our results we can construct ancilla-free implementations of multiple-controlled T gates as well as all versions of the qutrit multiple-controlled Toffoli.
As an application of our results, we provide a procedure to implement any ternary classical reversible function on $n$ trits as an ancilla-free qutrit unitary.
arXiv Detail & Related papers (2022-04-01T16:21:43Z) - 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) - 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) - On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
We show that commonly held intuitions when designing quantum circuits can be misleading.
We show that reducing the T-count can increase the total depth.
We illustrate our method on addition and multiplication circuits using ripple-carry.
arXiv Detail & Related papers (2021-01-12T21:36:16Z) - Efficient quantum gate teleportation in higher dimensions [0.0]
The Clifford hierarchy is a nested sequence of sets of quantum gates critical to achieving fault-tolerant quantum computation.
We leverage the Stone-von Neumann theorem and symplectic formalism of qudit stabiliser mechanics towards extending results of Zeng-Cheng-Chuang (2008) and Beigi-Shor (2010) to higher dimensions in a uniform manner.
We prove that every third level gate of one qudit (of any prime dimension) and of two qutrits can be implemented efficiently.
arXiv Detail & Related papers (2020-10-30T22:25:22Z) - Four qubits generated by Clifford gates [0.0]
We prove that there are 293760 states and their entanglement entropy must be either 0, 2/3, 1, 4/3 and 5/3.
We achieve this by splitting the 293760 states into 18 groups where each pair of states in a group can be connected with a local Clifford gate.
This time we show that every pair of Clifford states with real entries can be connected with at most 5 CNOT gates and local gates in C_R.
arXiv Detail & Related papers (2020-04-18T22:47:31Z)
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.