相关论文: Scaling issues in ensemble implementations of the …
Quantum computing implementations under consideration today typically deal with systems with microscopic degrees of freedom such as photons, ions, cold atoms, and superconducting circuits. The quantum information is stored typically in…
We propose a physical scheme for implementing the Deutsch-Jozsa algorithm using atomic ensembles and optical devices. The scheme has inherent fault tolerance to the realistic noise and efficient scaling with the number of ensembles for some…
Deutsch-Jozsa (DJ) problem is one of the most important problems demonstrating the power of quantum algorithm. DJ problem can be described as a Boolean function $f$: $\{0,1\}^n\rightarrow \{0,1\}$ with promising it is either constant or…
Experimental NMR implementations of the Deutsch-Josza quantum algorithm based on pesudo-pure spin states exhibit an exponential sensitivity scaling with the number of qubits. By employing truly mixed spin states in spin Liouville space,…
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…
We present a generalized Deutsch-Jozsa (DJ) quantum algorithm that not only determines both the global type of an unknown Boolean function (constant or balanced) but also determines explicit output values of the function in a single oracle…
We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining…
A new approach to the implementation of a quantum computer by high-resolution nuclear magnetic resonance (NMR) is described. The key feature is that two or more line-selective radio-frequency pulses are applied simultaneously. A three-qubit…
We reveal a close relationship between quantum metrology and the Deutsch-Jozsa algorithm on continuous variable quantum systems. We develop a general procedure, characterized by two parameters, that unifies parameter estimation and the…
That superpositions of states can be useful for performing tasks in quantum systems has been known since the early days of quantum information, but only recently has quantitative theory of quantum coherence been proposed. Here we apply that…
A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. The refined version allows a simpler analysis of…
Quantum machine learning seeks to exploit the underlying nature of a quantum computer to enhance machine learning techniques. A particular framework uses the quantum property of superposition to store sets of parameters, thereby creating an…
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 implemented the refined Deutsch-Jozsa algorithm on a 3-bit nuclear magnetic resonance quantum computer, which is the meaningful test of quantum parallelism because qubits are entangled. All of the balanced and constant functions were…
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…
Quantum computing takes fully advantage of the superposition principle to increase greatly (even exponentially) the speed of calculations, relative to the classical approach. The Deutsch-Jozsa algorithm is the simplest quantum algorithm…
Using the Deutsch-Jozsa algorithm, we will develop a method for solving a class of problems in which we need to determine parts of an array and then apply a specified function to each independent part. Since present quantum computers are…
The first optical proposal for the realization of the two-bit version of the Deutsch-Jozsa algorithm [D. Deutsch and R. Jozsa, Proc. R. Soc. London A {\bf 493}, 553 (1992)] is presented. The proposal uses Stark shifts in an ensemble of…
We offer an improved method for using a nuclear-magnetic-resonance quantum computer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to the application of the NMRQC are exponential diminishment of density-matrix elements with…
Nuclear magnetic resonance (NMR) has been widely used as a demonstrative medium for showcasing the ability for quantum computations to outperform classical ones. A large number of such experiments performed have been implementations of the…