Efficient quantum gate teleportation in higher dimensions
- URL: http://arxiv.org/abs/2011.00127v1
- Date: Fri, 30 Oct 2020 22:25:22 GMT
- Title: Efficient quantum gate teleportation in higher dimensions
- Authors: Nadish de Silva
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Clifford hierarchy is a nested sequence of sets of quantum gates critical
to achieving fault-tolerant quantum computation. Diagonal gates of the Clifford
hierarchy and 'nearly diagonal' semi-Clifford gates are particularly important:
they admit efficient gate teleportation protocols that implement these gates
with fewer ancillary quantum resources such as magic states. Despite the
practical importance of these sets of gates, many questions about their
structure remain open; this is especially true in the higher-dimensional qudit
setting. Our contribution is to leverage the discrete Stone-von Neumann theorem
and the 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 further give a simple algorithm for recursively
enumerating all gates of the Clifford hierarchy, a simple algorithm for
recognising and diagonalising semi-Clifford gates, and a concise proof of the
classification of the diagonal Clifford hierarchy gates due to
Cui-Gottesman-Krishna (2016) for the single-qudit case. We generalise the
efficient gate teleportation protocols of semi-Clifford gates to the qudit
setting and prove that every third level gate of one qudit (of any prime
dimension) and of two qutrits can be implemented efficiently. Numerical
evidence gathered via the aforementioned algorithms support the conjecture that
higher-level gates can be implemented efficiently.
Related papers
- Matchgate hierarchy: A Clifford-like hierarchy for deterministic gate teleportation in matchgate circuits [0.0]
The Clifford hierarchy, introduced by Gottesman and Chuang in 1999, is an increasing universality of sets of quantum gates.
We propose a gate teleportation protocol and the matchgate hierarchy in the context of matchgate circuits.
arXiv Detail & Related papers (2024-10-02T18:00:01Z) - 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) - 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) - Constructing Approximately Diagonal Quantum Gates [0.0]
We study a method of producing approximately diagonal 1-qubit gates.
For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate.
These sequences are conjectured to converge to diagonal gates doubly exponentially fast and are verified for small integers.
arXiv Detail & Related papers (2021-09-10T23:40:24Z) - 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) - On Applying the Lackadaisical Quantum Walk Algorithm to Search for
Multiple Solutions on Grids [63.75363908696257]
The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$.
This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
arXiv Detail & Related papers (2021-06-11T09:43:09Z) - Cost-optimal single-qubit gate synthesis in the Clifford hierarchy [0.0]
A synthesis algorithm can be used to approximate any unitary gate up to arbitrary precision.
Current procedures do not yet support individual assignment of base gate costs.
arXiv Detail & Related papers (2020-05-12T07:21:12Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z) - Scalable quantum computation with fast gates in two-dimensional
microtrap arrays of trapped ions [68.8204255655161]
We investigate the use of fast pulsed two-qubit gates for trapped ion quantum computing in a two-dimensional microtrap architecture.
We demonstrate that fast pulsed gates are capable of implementing high-fidelity entangling operations between ions in neighbouring traps faster than the trapping period.
arXiv Detail & Related papers (2020-05-01T13:18:22Z) - 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)
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.