Related papers: Quantum simulation of the integer factorization pr…
The quantum form of the Poincar\'e recurrence theorem stipulates that a system with a time-independent Hamiltonian and discrete energy levels returns arbitrarily close to its initial state in a finite time. Qubit systems, being highly…
It is shown that a state that is factorizable in the Hilbert space corresponding to some choice of degrees of freedom, becomes entangled for a different choice of degrees of freedom. Therefore, entanglement is not a special case but is…
Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers,…
Recently a new formulation of quantum mechanics has been suggested which describes systems by means of ensembles of classical particles provided with a sign. This novel approach mainly consists of two steps: the computation of the Wigner…
We investigate how quantum signatures can emerge in a single atom heat engine consisting of an atom confined in a tapered trap and subject to hot and cold thermal reservoirs. A similar system was realized experimentally in Ref.[1]. We model…
In this paper it has been described how to use the unitary dynamics of quantum mechanics to solve the prime factorization problem on a spin ensemble without any quantum entanglement. The ensemble quantum computation for the prime…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
A simple criterion is derived in order that a number sequence ${\cal S}_n$ is a permitted spectrum of a quantized system. The sequence of the prime numbers fulfils the criterion and the corresponding one-dimensional quantum potential is…
Arrays of optically trapped atoms excited to Rydberg states have recently emerged as a competitive physical platform for quantum simulation and computing, where high-fidelity state preparation and readout, quantum logic gates and controlled…
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation…
Quantum computing has shown great potential in various quantum chemical applications such as drug discovery, material design, and catalyst optimization. Although significant progress has been made in quantum simulation of simple molecules,…
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…
An important problem in quantum information theory is to understand what makes entangled quantum systems non-local or hard to simulate efficiently. In this work we consider situations in which various parties have access to a restricted set…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
The final goal of quantum hypothesis testing is to achieve quantum advantage over all possible classical strategies. In the protocol of quantum reading this advantage is achieved for information retrieval from an optical memory, whose…
Quantum processors are potentially superior to their classical counterparts for many computational tasks including factorization. Circuit methods as well as adiabatic methods have already been proposed and implemented for finding the…
The most irreducible way to represent information is a sequence of two symbols. In this paper, we construct quantum states using this basic building block. Specifically, we show that the probabilities that arise in quantum theory can be…
A typical quantum experiment has a bunch of apparatuses placed so that quantum systems can pass between them. We regard each use of an apparatus, along with some given outcome on the apparatus (a certain detector click or a certain meter…
The working of a quantum computer is described in the concrete example of a quantum simulator of the single-particle Schrodinger equation. We show that a register of 6-10 qubits is sufficient to realize a useful quantum simulator capable of…
Quantum gates and simple quantum algorithms can be designed utilizing the diffraction phenomena of a photon within a multiplexed holographic element. The quantum eigenstates we use are the photon's linear momentum (LM) as measured by the…