Related papers: An implementation of the Deutsch-Jozsa algorithm o…
The nitrogen-vacancy defect center (NV center) is a promising candidate for quantum information processing due to the possibility of coherent manipulation of individual spins in the absence of the cryogenic requirement. We report a…
Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with a single quantum query, and thus achieved the best separation between classical deterministic and exact quantum query complexity. Until recent years,…
We present an idealized quantum continuous variable analog of the Deutsch-Jozsa algorithm which can be implemented on a perfect continuous variable quantum computer. Using the Fourier transformation and XOR gate appropriate for continuous…
With the quantum state diffusion measurement theory(QSD), the measurement problem in liquid nuclear magnetic resonance(NMR) quantum computers was addressed and then it was shown that due to statistical fluctuations, the measured magnetic…
Shor and Grover demonstrated that a quantum computer can outperform any classical computer in factoring numbers and in searching a database by exploiting the parallelism of quantum mechanics. Whereas Shor's algorithm requires both…
Grover's quantum search algorithm, involving a large number of qubits, is highly sensitive to errors in the physical implementation of the unitary operators. This poses an intrinsic limitation to the size of the database that can be…
We present a computational method to automatically design the n-qubit realisations of quantum algorithms. Our approach leverages a domain-specific language (DSL) that enables the construction of quantum circuits via modular building blocks,…
DNA has been proposed as a chemical platform for computing and data storage, paving the way for building DNA-based computers. Recently, DNA has been hypothesized as an ideal quantum computer with the base pairs working as Josephson…
We examine the "Guessing Secrets" problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon…
Refocusing of a quantum system in NMR and quantum information processing can be achieved by application of short pulses according to the methods of spin echo and dynamical decoupling. However, these methods are strongly limited by the…
We consider a quantum processor based on five qutrits represented by spins S=1, which is driven by radio fre-quency (RF) pulses selective in transitions between adjacent levels. Numerical simulation of the implementation of the…
Nuclear magnetic resonance (NMR) is a powerful tool for applications ranging from chemical analysis to quantum information processing. Achieving optical initialization and detection of molecular nuclear spins promises new opportunities -…
We show that one can implement the Deutsch-Josza algorithm, one of the first and simplest quantum algorithms, in a fault-tolerant manner using the smallest quantum error-detecting code -- the $[[4,2,2]]$ code -- without any ancillae. We…
A novel quantum algorithm for solving the Boltzmann-Maxwell equations of the 6D collisionless plasma is proposed. The equation describes the kinetic behavior of plasma particles in electromagnetic fields and is known for the classical…
The nuclear spins in nanostructured semiconductors play a central role in quantum applications. The nuclear spins represent a useful resource for generating local magnetic fields but nuclear spin noise represents a major source of dephasing…
Four-body interaction plays an important role in many-body systems, and it can exhibit interesting phase transition behaviors. Historically it was the need to efficiently simulate quantum systems that lead the idea of a quantum computer. In…
Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating…
We experimentally demonstrate a weak measurement and measurement reversal-based scheme to ameliorate the effects of decoherence due to amplitude damping, on an NMR quantum processor. The weak measurement and measurement reversal processes…
The developments of quantum computing algorithms and experiments for atomic scale simulations have largely focused on quantum chemistry for molecules, while their application in condensed matter systems is scarcely explored. Here we present…
A solid-state implementation of a quantum computer composed entirely of silicon is proposed. Qubits are Si-29 nuclear spins arranged as chains in a Si-28 (spin-0) matrix with Larmor frequencies separated by a large magnetic field gradient.…