Four qubits generated by Clifford gates
- URL: http://arxiv.org/abs/2004.08720v1
- Date: Sat, 18 Apr 2020 22:47:31 GMT
- Title: Four qubits generated by Clifford gates
- Authors: Frederic Latour and Oscar Perdomo
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Clifford group is the set of gates generated by the controlled not gates,
the Hadamard gate and the P={{1,0},{0,i}} gate. We will say that a n-qubit
state is a Clifford state if it can be prepared using Clifford gates. In this
paper we study the set of all 4-qubit Clifford states. We prove that there are
293760 states and their entanglement entropy must be either 0, 2/3, 1, 4/3 and
5/3. We also show that any pair of these states can be connected using local
gates and at most 3 CNOT gates. 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. We then study how the different CNOT gates act on the 18
groups. We also study the Clifford states with real entries under the action of
the subgroup C_R of Clifford gates with real entries. 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. The link https://youtu.be/42MI6ks2_eU leads
to a YouTube video that explains the most important results in this paper.
Related papers
- Disentangling critical quantum spin chains with Clifford circuits [39.58317527488534]
Clifford circuits can be utilized to disentangle quantum state with cost, thanks to the Gottesman-Knill theorem.
Based on this idea, Clifford Circuits Augmented Matrix Product States ( CAMPS) was proposed recently and was shown to be able to reduce entanglement in various quantum systems.
In this work, we explore the power of CAMPS method in critical spin chains described by conformal field theories (CFTs) in the scaling limit.
arXiv Detail & Related papers (2024-11-19T17:39:54Z) - Fermion-qubit fault-tolerant quantum computing [39.58317527488534]
We introduce fermion-qubit fault-tolerant quantum computing, a framework which removes this overhead altogether.
We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates.
Our framework opens the door to fermion-qubit fault-tolerant quantum computation in platforms with native fermions.
arXiv Detail & Related papers (2024-11-13T19:00:02Z) - Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
We simulate the logical Hadamard gate in the surface code under a circuit-level noise model.
Our paper is the first to do this for a unitary gate on a quantum error-correction code.
arXiv Detail & Related papers (2023-12-18T19:00:00Z) - 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) - Quantum control landscape for generation of $H$ and $T$ gates in an open
qubit with both coherent and environmental drive [57.70351255180495]
An important problem in quantum computation is generation of single-qubit quantum gates such as Hadamard ($H$) and $pi/8$ ($T$)
Here we consider the problem of optimal generation of $H$ and $T$ gates using coherent control and the environment as a resource acting on the qubit via incoherent control.
arXiv Detail & Related papers (2023-09-05T09:05:27Z) - Clifford Orbits from Cayley Graph Quotients [0.0]
We describe the structure of the $n$-qubit Clifford group $mathcalC_n$ via Cayley graphs.
In order to obtain the action of Clifford gates on a given quantum state, we introduce a quotient procedure.
We extend our study to non-stabilizer states, including the W and Dicke states.
arXiv Detail & Related papers (2023-06-01T18:00:02Z) - Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit.
This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
arXiv Detail & Related papers (2023-04-04T23:06:22Z) - 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) - Five-qubit states generated by Clifford gates [0.0]
The main goal of the paper is to understand the action of the controlled-Z gates action on the 5-qubit states.
We show that there are 93 orbits, and we label each orbit in such a way that it is easy to see the effect of the controlled-Z gates.
arXiv Detail & Related papers (2022-10-31T03:19:06Z) - 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) - Qutrit metaplectic gates are a subset of Clifford+T [0.0]
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
arXiv Detail & Related papers (2022-02-18T15:03:47Z)
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.