Quantum Advantage in Reversing Unknown Unitary Evolutions
- URL: http://arxiv.org/abs/2403.04704v1
- Date: Thu, 7 Mar 2024 17:59:11 GMT
- Title: Quantum Advantage in Reversing Unknown Unitary Evolutions
- Authors: Yu-Ao Chen, Yin Mo, Yingjian Liu, Lei Zhang, Xin Wang
- Abstract summary: We introduce the Quantum Unitary Reversal Algorithm (QURA), a deterministic and exact approach to universally reverse arbitrary unknown unitary transformations.
QURA ensures an exact unitary inversion while the classical counterpart can never achieve exact inversion using a finite number of unitary calls.
- Score: 9.259390080722206
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We introduce the Quantum Unitary Reversal Algorithm (QURA), a deterministic
and exact approach to universally reverse arbitrary unknown unitary
transformations using $\mathcal{O}(d^2)$ calls of the unitary, where $d$ is the
system dimension. Our construction resolves a fundamental problem of
time-reversal simulations for closed quantum systems by affirming the
feasibility of reversing any unitary evolution without knowing the exact
process. The algorithm also provides the construction of a key oracle for
unitary inversion in quantum algorithm frameworks such as quantum singular
value transformation. Notably, our work demonstrates that compared with
classical methods relying on process tomography, reversing an unknown unitary
on a quantum computer holds a quadratic quantum advantage in computation
complexity. QURA ensures an exact unitary inversion while the classical
counterpart can never achieve exact inversion using a finite number of unitary
calls.
Related papers
- Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.
We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.
We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
arXiv Detail & Related papers (2024-10-10T16:10:10Z) - Generalised Quantum Gates for Qudits and their Application in Quantum Fourier Transform [0.0]
We propose a novel formulation of qudit gates that is universally applicable for any number of levels $d$.
By extending the mathematical framework of quantum gates to arbitrary dimensions, we derive explicit gate operations that form a universal set for quantum computation on qudits of any size.
arXiv Detail & Related papers (2024-10-07T15:23:57Z) - Halving the Cost of Quantum Algorithms with Randomization [0.138120109831448]
Quantum signal processing (QSP) provides a systematic framework for implementing a transformation of a linear operator.
Recent works have developed randomized compiling, a technique that promotes a unitary gate to a quantum channel.
Our algorithm implements a probabilistic mixture of randomizeds, strategically chosen so that the average evolution converges to that of a target function, with an error quadratically smaller than that of an equivalent individual.
arXiv Detail & Related papers (2024-09-05T17:56:51Z) - Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Taming Quantum Time Complexity [45.867051459785976]
We show how to achieve both exactness and thriftiness in the setting of time complexity.
We employ a novel approach to the design of quantum algorithms based on what we call transducers.
arXiv Detail & Related papers (2023-11-27T14:45:19Z) - Hamiltonian Encoding for Quantum Approximate Time Evolution of Kinetic
Energy Operator [2.184775414778289]
The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers.
We have proposed a new encoding method, namely quantum approximate time evolution (QATE) for the quantum implementation of the kinetic energy operator.
arXiv Detail & Related papers (2023-10-05T05:25:38Z) - 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) - Two-Unitary Decomposition Algorithm and Open Quantum System Simulation [0.17126708168238122]
We propose a quantum two-unitary decomposition (TUD) algorithm to decompose a $d$-dimensional operator $A$ with non-zero singular values.
The two unitaries can be deterministically implemented, thus requiring only a single call to the state preparation oracle for each.
Since the TUD method can be used to implement non-unitary operators as only two unitaries, it also has potential applications in linear algebra and quantum machine learning.
arXiv Detail & Related papers (2022-07-20T16:09:28Z) - 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) - Variational Hamiltonian simulation for translational invariant systems
via classical pre-processing [0.0]
We introduce a variational algorithm which uses solutions of classical optimizations to predict efficient quantum circuits.
Our strategy can improve upon the Trotter- Suzuki accuracy by several orders of magnitude.
We can extrapolate our method to beyond classically simulatable system sizes.
arXiv Detail & Related papers (2021-06-07T14:59:50Z) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z)
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.