Universal Quantum Computation via Superposed Orders of Single-Qubit
Gates
- URL: http://arxiv.org/abs/2311.13654v1
- Date: Wed, 22 Nov 2023 19:10:57 GMT
- Title: Universal Quantum Computation via Superposed Orders of Single-Qubit
Gates
- Authors: Kyrylo Simonov, Marcello Caleffi, Jessica Illiano, Angela Sara
Cacciapuoti
- Abstract summary: We prove that any two-qubit controlled quantum gate can be deterministically realized.
Superposed orders of single-qubit gates can enable universal quantum computation.
- Score: 7.796917261490019
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Superposed orders of quantum channels have already been proved - both
theoretically and experimentally - to enable unparalleled opportunities in the
quantum communication domain. As a matter of fact, superposition of orders can
be exploited within the quantum computing domain as well, by relaxing the
(traditional) assumption underlying quantum computation about applying gates in
a well-defined causal order. In this context, we address a fundamental question
arising with quantum computing: whether superposed orders of single-qubit gates
can enable universal quantum computation. As shown in this paper, the answer to
this key question is a definitive "yes". Indeed, we prove that any two-qubit
controlled quantum gate can be deterministically realized, including the
so-called Barenco gate that alone enables universal quantum computation.
Related papers
- What is computable and non-computable in the quantum domain: 7 statements and 3 conjectures [0.7892577704654171]
There is no universal approach that helps to define a scope of problems that quantum computers are able to speed up.
On the one hand, the class of quantum states that is of interest for quantum computing should be complex.
On the other hand, such quantum states should be reachable on a practical quantum computer.
arXiv Detail & Related papers (2024-03-25T15:47:35Z) - Quantum machine learning with indefinite causal order [0.0]
In a conventional circuit for quantum machine learning, the quantum gates used to encode the input parameters are constructed with a fixed order.
We introduce indefinite causal order to quantum machine learning.
arXiv Detail & Related papers (2024-03-06T08:22:52Z) - A vertical gate-defined double quantum dot in a strained germanium
double quantum well [48.7576911714538]
Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation.
We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well.
We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
arXiv Detail & Related papers (2023-05-23T13:42:36Z) - 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) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Quantum Computation Using Action Variables [4.087043981909747]
We argue quantum computation using action variables as fault-tolerant quantum computation, whose fault-tolerance is guaranteed by the quantum KAM theorem.
Besides, we view the Birkhoff norm form as a mathematical framework of the extended harmonic oscillator quantum computation.
arXiv Detail & Related papers (2021-09-24T12:04:27Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - Universal quantum computation via quantum controlled classical
operations [0.0]
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation.
We show that even a primitive computer capable of implementing only SWAP gates, can be lifted to universal quantum computing.
arXiv Detail & Related papers (2021-04-13T18:00:13Z) - Counterfactual universal quantum computation [1.3706331473063877]
We show that universal quantum computation can be achieved without interaction among initially independent two-level quantum subsystems.
Our work has practical applications to color imaging of ancient arts, upon which light is forbidden to shine.
arXiv Detail & Related papers (2020-11-14T02:16:49Z)
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.