相关论文: Universal quantum computation and simulation using…
The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a strikingly novel viewpoint for thinking about quantum computation and its powers. We consider the two major…
Extensions of average Hamiltonian theory to quantum computation permit the design of arbitrary Hamiltonians, allowing rotations throughout a large Hilbert space. In this way, the kinematics and dynamics of any quantum system may be…
We provide a scheme for quantum computation in lattice systems via global but periodic manipulation, in which only effective periodic magnetic fields and global nearest neighbor interaction are required. All operations in our scheme are…
Quantum computation can be performed by encoding logical qubits into the states of two or more physical qubits, and controlling a single effective exchange interaction and possibly a global magnetic field. This "encoded universality"…
In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is…
We report the quantum computing of reacting flows by simulating the Hamiltonian dynamics. The scalar transport equation for reacting flows is transformed into a Hamiltonian system, mapping the dissipative and non-Hermitian problem in…
We introduce a new class of quantum models with time-dependent Hamiltonians of a special scaling form. By using a couple of time-dependent unitary transformations, the time evolution of these models is expressed in terms of related systems…
The preparation of highly entangled many-body systems is one of the central challenges of both basic and applied science. The complexity of interparticle interaction and environment coupling increases rapidly with the number of…
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating…
In this thesis we present new results relevant to two important problems in quantum information science: the development of a theory of entanglement and the exploration of the use of controlled quantum systems to the simulation of quantum…
A quantum unitary evolution alternated with measurements is simulated by a bubble filled with fictitious particles called amplitude quanta that move chaotically and can be transformed by the simple rules that look like chemical reactions. A…
Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum…
We present a new scheme to perform noise resilient universal adiabatic quantum computation using two-body interactions. To achieve this, we introduce a new family of error detecting subsystem codes whose gauge generators and a set of their…
The notion of entanglement can be naturally extended from quantum-states to the level of general quantum evolutions. This is achieved by considering multi-partite unitary transformations as elements of a multi-partite Hilbert space and then…
Several recent experiments have demonstrated the promise of atomic ensembles for quantum teleportation and quantum memory. In these cases the collective internal state of the atoms is well described by continuous variables $X_1, P_1$ and…
We present a general scheme for performing a simulation of the dynamics of one quantum system using another. This scheme is used to experimentally simulate the dynamics of truncated quantum harmonic and anharmonic oscillators using nuclear…
Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the…
In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive…
Quantum computing promises to exploit the laws of quantum mechanics for processing information in ways fundamentally different from today's classical computers, leading to unprecedented efficiency. One-way quantum computation, sometimes…
This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the…