Related papers: Implementation of the refined Deutsch-Jozsa algori…
Dynamics of large complex systems, such as relaxation towards equilibrium in classical statistical mechanics, often obeys a master equation. The equation significantly simplifies the complexities but describes essential information of…
Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic…
We report the realization of a nuclear magnetic resonance (NMR) quantum computer which combines the quantum Fourier transform (QFT) with exponentiated permutations, demonstrating a quantum algorithm for order-finding. This algorithm has the…
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…
In this article we develop quantum algorithms for learning and testing juntas, i.e. Boolean functions which depend only on an unknown set of k out of n input variables. Our aim is to develop efficient algorithms: - whose sample complexity…
A classical computer simulating Schrodinger dynamics of a quantum system requires resources which scale exponentially with the size of the system, and is regarded as inefficient for such purposes. However, a quantum computer made up of a…
In this work we study the properties of dissipatively stabilized steady states of noisy quantum algorithms, exploring the extent to which they can be well approximated as thermal distributions, and proposing methods to extract the effective…
Quantum simulation can help us study poorly understood topics such as high-temperature superconductivity and drug design. However, existing quantum simulation algorithms for current quantum computers often have drawbacks that impede their…
A probing scheme is considered with an accessible and controllable qubit, used to probe an out-of equilibrium system consisting of a second qubit interacting with an environment. Quantum spontaneous synchronization between the probe and the…
We describe a method to axiomatize computations in deterministic Turing machines. When applied to computations in non-deterministic Turing machines, this method may produce contradictory (and therefore trivial) theories, considering…
We numerically investigate the possibilities of driving quantum algorithms with laser pulses in a register of ultracold NaCs polar molecules in a static electric field. We focuse on the possibilities of performing scalable logical…
Neutral atom quantum processors provide a viable route to scalable quantum computing, with recent demonstrations of high-fidelity and parallel gate operations and initial implementation of quantum algorithms using both physical and logical…
Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the…
Nature is governed by precise physical laws, which can inspire the discovery of new computer-run simulation algorithms. Thermal states are the most ubiquitous for they are the equilibrium states of matter. Simulating thermal states of…
We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can be solved without entanglement, and show that the algorithm…
The ability to efficiently and accurately calculate equilibrium time correlation functions of many-body condensed phase quantum systems is one of the outstanding problems in theoretical chemistry. The Nakajima-Zwanzig-Mori formalism coupled…
Quantum simulation is one of the most promising scientific applications of quantum computers. Due to decoherence and noise in current devices, it is however challenging to perform digital quantum simulation in a regime that is intractable…
Geometric phases have stimulated researchers for its potential applications in many areas of science. One of them is fault-tolerant quantum computation. A preliminary requisite of quantum computation is the implementation of controlled…
Major obstacles remain to the implementation of macroscopic quantum computing: hardware problems of noise, decoherence, and scaling; software problems of error correction; and, most important, algorithm construction. Finding truly quantum…
We propose a scalable quantum-computing architecture based on cold atoms confined to sites of a tight optical lattice. The lattice is placed in a non-uniform magnetic field and the resulting Zeeman sublevels define qubit states. Microwave…