Retrodictive Quantum Computing
- URL: http://arxiv.org/abs/2205.06346v1
- Date: Thu, 12 May 2022 20:12:41 GMT
- Title: Retrodictive Quantum Computing
- Authors: Jacques Carette and Gerardo Ortiz and Amr Sabry
- Abstract summary: We show how to exploit retrodictive quantum computing at scale.
We solve instances of the quantum Deutsch-Jozsa, Bernstein-Vazirani, Simon, Grover, and Shor's algorithms.
- Score: 0.6445605125467572
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum models of computation are widely believed to be more powerful than
classical ones. Efforts center on proving that, for a given problem, quantum
algorithms are more resource efficient than any classical one. All this,
however, assumes a standard predictive paradigm of reasoning where, given
initial conditions, the future holds the answer. How about bringing information
from the future to the present and exploit it to one's advantage? This is a
radical new approach for reasoning, so-called Retrodictive Computation, that
benefits from the specific form of the computed functions. We demonstrate how
to use tools of symbolic computation to realize retrodictive quantum computing
at scale and exploit it to efficiently, and classically, solve instances of the
quantum Deutsch-Jozsa, Bernstein-Vazirani, Simon, Grover, and Shor's
algorithms.
Related papers
- Quantum Machine Learning: Quantum Kernel Methods [0.0]
Kernel methods are a powerful and popular technique in classical Machine Learning.
The use of a quantum feature space that can only be calculated efficiently on a quantum computer potentially allows for deriving a quantum advantage.
A data dependent projected quantum kernel was shown to provide significant advantage over classical kernels.
arXiv Detail & Related papers (2024-05-02T23:45:29Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - Universal Statistical Simulator [0.0]
We present a quantum computer code for a Galton Board Simulator that is exponentially faster than a classical calculation.
We demonstrate a straight forward implementation on a quantum computer, using only three types of quantum gate, which calculates $2n$ trajectories using $mathcalO (n2)$ resources.
arXiv Detail & Related papers (2022-02-03T17:55:58Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Quantum belief function [4.286327408435937]
We encode the basic belief assignment (BBA) into quantum states, which makes each qubit correspond to control an element.
We simulate our quantum version of BBA on Qiskit platform, which ensures the computation of our algorithm experimentally.
arXiv Detail & Related papers (2021-07-08T15:57:32Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Quadratic Sieve Factorization Quantum Algorithm and its Simulation [16.296638292223843]
We have designed a quantum variant of the second fastest classical factorization algorithm named "Quadratic Sieve"
We have constructed the simulation framework of quantized quadratic sieve algorithm using high-level programming language Mathematica.
arXiv Detail & Related papers (2020-05-24T07:14:19Z) - Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular
Simulations on Quantum Computing Devices [0.0]
We introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies.
We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.
arXiv Detail & Related papers (2020-04-23T18:35:26Z)
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.