Results 1 
2 of
2
Quantum information processing in continuous time
, 2004
"... Quantum mechanical computers can solve certain problems asymptotically faster than any classical computing device. Several fast quantum algorithms are known, but the nature of quantum speedup is not well understood, and inventing new quantum algorithms seems to be difficult. In this thesis, we explo ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
Quantum mechanical computers can solve certain problems asymptotically faster than any classical computing device. Several fast quantum algorithms are known, but the nature of quantum speedup is not well understood, and inventing new quantum algorithms seems to be difficult. In this thesis, we explore two approaches to designing quantum algorithms based on continuoustime Hamiltonian dynamics. In quantum computation by adiabatic evolution, the computer is prepared in the known ground state of a simple Hamiltonian, which is slowly modified so that its ground state encodes the solution to a problem. We argue that this approach should be inherently robust against lowtemperature thermal noise and certain control errors, and we support this claim using simulations. We then show that any adiabatic algorithm can be implemented in a different way, using only a sequence of measurements of the Hamiltonian. We illustrate how this approach can achieve quadratic speedup for the unstructured search problem. We also demonstrate two examples of quantum speedup by quantum walk, a quantum mechanical analog of random walk. First, we consider the problem of searching a region
Quantum entanglement and geometry of determinantal varieties
"... We introduce algebraic sets, which are determinantal varieties in the complex projective spaces or the products of complex projective spaces, for the mixed states in bipartite or multipartite quantum systems as their invariants under local unitary transformations. These invariants are naturally aris ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
We introduce algebraic sets, which are determinantal varieties in the complex projective spaces or the products of complex projective spaces, for the mixed states in bipartite or multipartite quantum systems as their invariants under local unitary transformations. These invariants are naturally arised from the physical consideration of measuring mixed states by separable pure states. The algebraic sets of the mixed states are independent of the eigenvalues and only measure the geometric positions of the eigenvectors. Thus complex differential and algebraic geometry of these new invariants turn to be powerful tools for the study of quantum entanglement of both bipartite and multipartite mixed states. The algebraic sets have to be the sum of the linear subspaces if the mixed states are separable, and thus we give a new eigenvaluefree criterion of separability. Examples of the entangled mixed states which are invariant under partial transpositions