相关论文: On Non Efficiency of Quantum Computer
Simulating a quantum system is more efficient on a quantum computer than on a classical computer. The time required for solving the Schr\"odinger equation to obtain molecular energies has been demonstrated to scale polynomially with system…
In this paper, we study the nature of entanglement in quantum Grover's and Shor's algorithms. So far, the authors who have been interested in this problem have approached the question quantitatively by introducing entanglement measures…
Digital quantum computers provide a computational framework for solving the Schr\"{o}dinger equation for a variety of many-particle systems. Quantum computing algorithms for the quantum simulation of these systems have recently witnessed…
Quantum computing promises to tackle technological and industrial problems insurmountable for classical computers. However, today's quantum computers still have limited demonstrable functionality, and it is expected that scaling up to…
A quantum computer is a hypothetical device in which the laws of quantum mechanics are used to introduce a degree of parallelism into computations and which could therefore significantly improve on the computational speed of a classical…
The question of the energetic efficiency of quantum computers has gained increasing attention recently. A precise understanding of the resources required to operate a quantum computer with a targeted computational performance and how the…
Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $N\times{N}$…
A theoretical model of computation is proposed based on Lorentz quantum mechanics. Besides the standard qubits, this model has an additional bit, which we call hyperbolic bit (or hybit in short). A set of basic logical gates are constructed…
Quantum cooling, a deterministic process that drives any state to the lowest eigenstate, has been widely used from studying ground state properties of chemistry and condensed matter quantum physics, to general optimization problems.…
The feasibility of computationally superior quantum computers is one of the most exciting and clear-cut scientific questions of our time. The question touches on fundamental issues regarding probability, physics, and computability, as well…
Quantum chemistry simulations on a quantum computer suffer from the overhead needed for encoding the fermionic problem in a bosonic system of qubits. By exploiting the block diagonality of a fermionic Hamiltonian, we show that the number of…
A new class of time-energy uncertainty relations is directly derived from the Schr\"odinger equations for time-dependent Hamiltonians. Only the initial states and the Hamiltonians, but neither the instantaneous eigenstates nor the full…
We introduce hybrid classical-quantum algorithms for problems involving a large classical data set X and a space of models Y such that a quantum computer has superposition access to Y but not X. These algorithms use data reduction…
This is a course on the theory of quantum computing. It consists of 16 lessons, each with a video and written component, covering the basics of quantum information, quantum algorithms (including query algorithms, Shor's algorithm for…
Practical quantum computing applications to power grids are nonexistent at the moment. This paper investigates how a fundamental grid problem, namely DC power flow, can be solved using quantum computing. Power flow is the most widely used…
The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…
We address the question of how a quantum computer can be used to simulate experiments on quantum systems in thermal equilibrium. We present two approaches for the preparation of the equilibrium state on a quantum computer. For both…
Quantum computing and quantum sensing represent two distinct frontiers of quantum information science. In this work, we harness quantum computing to solve a fundamental and practically important sensing problem: the detection of weak…
Nucleus is a typical many-body quantum system. Full calculation of a nuclear system in a classical computer is far beyond the capacity of current classical computers. With fast development of hardware, the prospect of using quantum…
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…