Low-cost Fredkin gate with auxiliary space
- URL: http://arxiv.org/abs/2011.14713v1
- Date: Mon, 30 Nov 2020 11:54:00 GMT
- Title: Low-cost Fredkin gate with auxiliary space
- Authors: Wen-Qiang Liu, Hai-Rui Wei and Leong-Chuan Kwek
- Abstract summary: We propose an optimization of an n-controlled-qubit Fredkin gate with a maximum of 2n+1 two-qubit gates and 2n single-qudit gates.
The number of logic gates required improves on earlier results on simulating arbitrary n-qubit Fredkin gates.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Effective quantum information processing is tantamount in part to the
minimization the quantum resources needed by quantum logic gates. Here, we
propose an optimization of an n-controlled-qubit Fredkin gate with a maximum of
2n+1 two-qubit gates and 2n single-qudit gates by exploiting auxiliary Hilbert
spaces. The number of logic gates required improves on earlier results on
simulating arbitrary n-qubit Fredkin gates. In particular, the optimal result
for one-controlled-qubit Fredkin gate (which requires three qutrit-qubit
partial-swap gates) breaks the theoretical nonconstructive lower bound of five
two-qubit gates. Furthermore, using an additional spatial-mode degree of
freedom, we design a possible architecture to implement a polarization-encoded
Fredkin gate with linear optical elements.
Related papers
- 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) - Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance.
Here we report on a strategy that can overcome such problems.
We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
arXiv Detail & Related papers (2023-08-04T13:39:46Z) - Extensive characterization of a family of efficient three-qubit gates at
the coherence limit [0.4471952592011114]
We implement a three-qubit gate by simultaneously applying two-qubit operations.
We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once.
We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
arXiv Detail & Related papers (2022-07-06T19:42:29Z) - Efficient variational synthesis of quantum circuits with coherent
multi-start optimization [1.3108652488669734]
We consider the problem of synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates.
A key idea we propose is to use parametrized two-qubit (2q) controlled phase gates, which can interpolate between the identity gate and the CNOT gate.
This coherent optimization of the architecture together with 1q gates appears to work surprisingly well in practice.
arXiv Detail & Related papers (2022-05-02T18:00:03Z) - Experimentally feasible computational advantage from quantum
superposition of gate orders [0.0]
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems.
The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state.
It is known that this quantum-controlled ordering of gates can reduce the query complexity in deciding a property of black-box unitaries with respect to the best algorithm in which gates are applied in a fixed order.
arXiv Detail & Related papers (2021-12-29T13:36:27Z) - Software mitigation of coherent two-qubit gate errors [55.878249096379804]
Two-qubit gates are important components of quantum computing.
But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications.
We present two software methods to mitigate parasitic two-qubit gate errors.
arXiv Detail & Related papers (2021-11-08T17:37:27Z) - Approaching the theoretical limit in quantum gate decomposition [0.0]
We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count.
Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
arXiv Detail & Related papers (2021-09-14T15:36:22Z) - 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) - 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) - Optimal synthesis of the Fredkin gate in a multilevel system [0.0]
optimal cost of a three-qubit Fredkin gate is 5 two-qubit entangling gates, and the overhead climbs to 8 when restricted to controlled-not (CNOT) gates.
We reduce the cost of a three-qubit Fredkin gate from 8 CNOTs to 5 nearest-neighbor CNOTs.
The cost of a nondeterministic three-qubit Fredkin gate is further reduced to 4 nearest-neighbor CNOTs, and the success of such a gate is heralded by a single-photon detector.
arXiv Detail & Related papers (2020-04-07T05:36:34Z)
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.