Experimentally feasible computational advantage from quantum
superposition of gate orders
- URL: http://arxiv.org/abs/2112.14541v1
- Date: Wed, 29 Dec 2021 13:36:27 GMT
- Title: Experimentally feasible computational advantage from quantum
superposition of gate orders
- Authors: Martin J. Renner, \v{C}aslav Brukner
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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 the gates are applied in a fixed order. However,
all tasks explicitly found so far require unitaries that either act on
unbounded dimensional quantum systems in the asymptotic limit (the limiting
case of a large number of black-box gates) or act on qubits, but then involve
only a few unitaries. Here we introduce tasks (1) for which there is a provable
computational advantage of a quantum-controlled ordering of gates in the
asymptotic case and (2) that require only qubit gates and are therefore
suitable to demonstrate this advantage experimentally. We study their solutions
with the quantum-$n$-switch and within the quantum circuit model and find that
while the $n$-switch requires to call each gate only once, a causal algorithm
has to call at least $2n-1$ gates. Furthermore, the best known solution with a
fixed gate ordering calls $O(n\log_2{(n)})$ gates.
Related papers
- One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing [8.478982715648547]
Scheme for qubits with $XX+YY$ coupling realizes any two-qubit gate up to single-qubit gates.
We observe marked improvements across various applications, including generic $n$-qubit gate synthesis, quantum volume, and qubit routing.
arXiv Detail & Related papers (2023-12-09T19:30:31Z) - Quantum circuit synthesis via a random combinatorial search [0.0]
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets.
We show that the fraction of perfect-fidelity quantum circuits increases rapidly as soon as the circuit size exceeds the minimum circuit size required for achieving unit fidelity.
arXiv Detail & Related papers (2023-11-29T00:59:29Z) - Decomposition Algorithm of an Arbitrary Pauli Exponential through a
Quantum Circuit [5.800032532382661]
We review the staircase algorithm to decompose the exponential of a generalized Pauli matrix.
We propose two alternative methods which offer more efficient quantum circuits.
arXiv Detail & Related papers (2023-05-08T16:05:27Z) - 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) - One-Way Ticket to Las Vegas and the Quantum Adversary [78.33558762484924]
We show that quantum Las Vegas query complexity is exactly equal to the quantum adversary bound.
This is achieved by transforming a feasible solution to the adversary inversion problem into a quantum query algorithm.
arXiv Detail & Related papers (2023-01-05T11:05:22Z) - 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) - Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system.
The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
arXiv Detail & Related papers (2021-08-30T16:30:33Z) - 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) - Computational advantage from quantum superposition of multiple temporal
orders of photonic gates [0.0]
A control quantum system can coherently determine the order in which a target quantum system undergoes $N$ gate operations.
We experimentally demonstrate the quantum $N$-switch with $N=4$ gates acting on a photonic-polarization qubit.
This is the first observation of a quantum superposition of more than $N=2$ temporal orders.
arXiv Detail & Related papers (2020-02-18T19:00:01Z)
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.