Related papers: Distributed exact quantum algorithms for Deutsch-J…
To address the issue of excessive quantum resource requirements in Kuperberg's algorithm for the dihedral hidden subgroup problem, this paper proposes a distributed algorithm based on the function decomposition. By splitting the original…
Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [Phys. Rev. A 65, 062310 (2002)]. This adiabatic algorithm gives rise to a quadratic speed up over classical algorithms. We show that a modified…
One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report the first experimental realization of the complete process of deterministic one-way…
Hoyer has given a generalisation of the Deutsch--Jozsa algorithm which uses the Fourier transform on a group G which is (in general) non-Abelian. His algorithm distinguishes between functions which are either perfectly balanced (m-to-one)…
A scheme to execute an n-bit Deutsch-Jozsa (D-J) algorithm using n qubits has been implemented for up to three qubits on an NMR quantum computer. For the one and two bit Deutsch problem, the qubits do not get entangled, hence the NMR…
We describe a general framework for regarding oracle-assisted quantum algorithms as tools for discriminating between unitary transformations. We apply this to the Deutsch-Jozsa problem and derive all possible quantum algorithms which solve…
Limited by today's physical devices, quantum circuits are usually noisy and difficult to be designed deeply. The novel computing architecture of distributed quantum computing is expected to reduce the noise and depth of quantum circuits. In…
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.…
The well-known Deutsch Algorithm (DA) and Deutsch-Jozsha Algorithm (DJA) both are used as an evidence to the power of quantum computers over classical computation mediums. In these theoretical experiments, it has been shown that a quantum…
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the…
In the black-box model, problems constrained by a `promise' are the only ones that admit a quantum exponential speedup over the best classical algorithm in terms of query complexity. The most prominent example of this is the Deutsch-Jozsa…
Measurement-based quantum computing (MBQC), an alternate paradigm for formulating quantum algorithms, can lead to potentially more flexible and efficient implementations as well as to theoretical insights on the role of entanglement in a…
We propose a method for quantum algorithm design assisted by machine learning. The method uses a quantum-classical hybrid simulator, where a "quantum student" is being taught by a "classical teacher." In other words, in our method, the…
Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to…
Realistic physical implementations of quantum computers can entail tradeoffs which depart from the ideal model of quantum computation. Although these tradeoffs have allowed successful demonstration of certain quantum algorithms, a crucial…
We perform quantum interference experiments on a single self-assembled semiconductor quantum dot. The presence or absence of a single exciton in the dot provides a qubit that we control with femtosecond time resolution. We combine a set of…
Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of…
Distributed quantum computation has gained extensive attention since small-qubit quantum computers seem to be built more practically in the noisy intermediate-scale quantum (NISQ) era. In this paper, we give a distributed Bernstein-Vazirani…
In 1985, David Deutsch challenged the Church-Turing thesis by stating that his quantum model of computation "could, in principle, be built and would have many remarkable properties not reproducible by any Turing machine". While this is…
We report the first experimental demonstration of an all-optical one-way implementation of Deutsch's quantum algorithm on a four-qubit cluster state. All the possible configurations of a balanced or constant function acting on a two-qubit…