Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms

@article{Johansson2015EfficientCS,
  title={Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms},
  author={Niklas Johansson and Jan-{\AA}ke Larsson},
  journal={Quantum Information Processing},
  year={2015},
  volume={16},
  url={https://api.semanticscholar.org/CorpusID:28670540}
}
A framework is presented that can simulate both quantum algorithms efficiently, solving the Deutsch–Jozsa problem with probability 1 using only one oracle query, and Simon’s problem using linearly many oracle queries, just as expected of an ideal quantum computer.
[PDF] Semantic Reader
28 Citations
Highly Influential Citations
1
Background Citations
6
Methods Citations
6
Results Citations
1

28 Citations

Quantum Simulation Logic, Oracles, and the Quantum Advantage

This work investigates in detail the role that oracles play for the advantage of quantum algorithms by using a simulation framework, Quantum Simulation Logic (QSL), to construct oracles and algorithms that solve some problems with the same success probability and number of queries as the quantum algorithms.

Entanglement and coherence in the Bernstein-Vazirani algorithm

This Letter analyzes in detail the quantum resources in the Bernstein-Vazirani algorithm, and introduces and studies its probabilistic version, showing that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.

Comments on “Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms”

A recent paper (Quantum Info. Process 16.9, 2017) proposes a classical framework named Quantum Simulation Logic (QSL) capable of an efficient classical simulation of Deutsch–Jozsa and Simon…

Classical simulation of Grovers quantum algorithm

This paper in a didactic way, presents an introduction to quantum computing where some quantum formalisms are analyzed to address Grover’s algorithm, one of the key algorithms in quantum computing.

Reflections on probabilistic compared to quantum computational devices

    Giuseppe Corrente
    Physics, Computer Science
    Int. J. Parallel Emergent Distributed Syst.
  • 2021
This article underline and compare different quantum and deterministic models of computation by means of a probabilistic point of view, showing that generally PTM does not fit for them, also if in some particular cases it fits.

Quantum Computing Concepts with Deutsch Jozsa Algorithm

This paper describes mathematically Deutsch Jozsa algorithm in detail for 2 and 3 qubits, and calculation of balanced and unbalanced states is shown in the mathematical description of the algorithm.

Realization of Shor's Algorithm at Room Temperature

A realization of Shor's algorithm, that does not need any of the simplifications presently needed in current experiments and also gives smaller systematic errors than any former experimental implementation, which gives further insight to the resources needed for quantum computation.

Unified Information Dynamic Analysis of Quantum Decision-Making and Search Algorithms: Computational Intelligence Measure

It is shown that QAG, based on superposition of states, quantum entanglement and interference, when acting on the input vector, stores information into the system state, minimizing the gap between classical Shannon entropy and quantum von Neumann entropy.

Quantum Algorithmic Gate-Based Computing: Grover Quantum Search Algorithm Design in Quantum Software Engineering

A practical approach to modeling one of the most famous QA on classical computers, the Grover algorithm is described in details along with implementations on a local computer simulator.

Simulation of quantum algorithms using classical probabilistic bits and circuits

A new approach to simulate quantum algorithms using classical probabilistic bits and circuits is discussed, and specific procedures for implementing the Deutsch-Jozsa algorithm, and the Quantum Fourier Transform in the probability space are given.

34 References

Quantum complexity theory

This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.

Experimental realization of a one-way quantum computer algorithm solving Simon's problem.

This work represents the first experimental realization of the quantum algorithm solving Simon's problem, and helps highlight how one-way quantum computing provides a practical route to experimentally investigating the quantum-classical gap in the query complexity model.

An exact quantum polynomial-time algorithm for Simon's problem

It is shown that there is a decision problem that can be solved in exact quantum polynomial time, which would require expected exponential time on any classical bounded-error probabilistic computer if the data is supplied as a black box.

A fast quantum mechanical algorithm for database search

In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .

On the power of quantum computation

    Daniel R. Simon
    Computer Science, Physics
    Proceedings 35th Annual Symposium on Foundations…
  • 1994
This work presents here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class.

Deterministic polynomial-time quantum algorithms for Simon’s problem

It is shown that Simon’s problem and its extended version can be deterministically solved in a simpler and more concrete way than that proposed by G. Brassard and P. Høyer.

Contextuality supplies the ‘magic’ for quantum computation

This work proves a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via ‘magic state’ distillation, which is the leading model for experimentally realizing a fault-tolerant quantum computer.

Quantum theory, the Church–Turing principle and the universal quantum computer

    D. Deutsch
    Physics, Computer Science
    Proceedings of the Royal Society of London. A…
  • 1985
It is shown that quantum theory and the 'universal quantum computer’ are compatible with the principle, and quantum complexity theory allows a physically more reasonable definition of the ‘complexity’ or ‘knowledge’ in a physical system than does classical complexity theory.

Efficient Simulation of the Deutsch-Jozsa Algorithm

We provide a framework wherein one can simulate the Deutsch-Jozsa quantum algorithm on a regular computer within polynomial time, and with linear memory consumption. Under certain reasonable…

The Heisenberg Representation of Quantum Computers

A formalism describing the evolution of operators rather than states has proven extremely fruitful in understanding an important class of quantum operations, and a simple group structure is sufficient to allow a rich range of quantum effects, although it falls short of the full power of quantum computation.