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

  title={Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms},
  author={Niklas Johansson and Jan-{\AA}ke Larsson},
  journal={Quantum Information Processing},
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch–Jozsa and Simon’s problem, both efficiently solvable on a quantum Turing machine, and both believed to lack efficient classical solutions. Here we present a framework that can simulate both quantum algorithms… 

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 Bernstein-Vazirani algorithm

This Letter analyzes in detail the quantum resources in the Bernstein-Vazirani algorithm, and investigates the one clean qubit model, showing that the model can exhibit speedup over any known classical algorithm even with arbitrary little amount of multipartite entanglement, general quantum correlations, and coherence.

Reflections on probabilistic compared to quantum computational devices

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.

Classical simulation of Grovers quantum algorithm

An introduction to quantum computing is presented where some quantum formalisms are analyzed to finally address Grover’s algorithm and the results are compared with other classical algorithms to illustrate the significant potential advantages of quantum computing.

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.

Polynomial-time solution for the #P problem based on classical electronic circuits

The running time of the proposed scheme to solve the #P problem by implementing classical electronic circuits is equivalent to those based on quantum mechanics, which is advantageous for information processing in the era of big data.

Efficient Contextual Ontological Model of n-Qubit Stabilizer Quantum Mechanics.

The most well-known tool for studying contextuality in quantum computation is the n-qubit Stabilizer state tableau representation. We provide an extension that not only describes the quantum state

Improved quantum circuit modelling based on Heisenberg representation

Efficient algorithms to facilitate accurate global phase maintenance for both stabilizer and non-stabilizer gates application that play a vital role in the stabilizer frames data structure, which is based on the Heisenberg representation are proposed.

Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?

It is straightforward to compute the transition amplitudes of a quantum circuit using the sum-over-paths methodology when the gates in the circuit are balanced, where a balanced gate is one for which



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

  • G. BrassardP. Høyer
  • Computer Science, Mathematics
    Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems
  • 1997
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
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 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.

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, Philosophy
    Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizible

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

Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features

Fault-Tolerant Quantum Computation

Fault tolerance techniques will be essential for achieving the considerable potential of quantum computers and will need to control high noise rates and do so with low overhead, since qubits are expensive.