5,045 research outputs found
Exact stabilization of entangled states in finite time by dissipative quantum circuits
Open quantum systems evolving according to discrete-time dynamics are
capable, unlike continuous-time counterparts, to converge to a stable
equilibrium in finite time with zero error. We consider dissipative quantum
circuits consisting of sequences of quantum channels subject to specified
quasi-locality constraints, and determine conditions under which stabilization
of a pure multipartite entangled state of interest may be exactly achieved in
finite time. Special emphasis is devoted to characterizing scenarios where
finite-time stabilization may be achieved robustly with respect to the order of
the applied quantum maps, as suitable for unsupervised control architectures.
We show that if a decomposition of the physical Hilbert space into virtual
subsystems is found, which is compatible with the locality constraint and
relative to which the target state factorizes, then robust stabilization may be
achieved by independently cooling each component. We further show that if the
same condition holds for a scalable class of pure states, a continuous-time
quasi-local Markov semigroup ensuring rapid mixing can be obtained. Somewhat
surprisingly, we find that the commutativity of the canonical parent
Hamiltonian one may associate to the target state does not directly relate to
its finite-time stabilizability properties, although in all cases where we can
guarantee robust stabilization, a (possibly non-canonical) commuting parent
Hamiltonian may be found. Beside graph states, quantum states amenable to
finite-time robust stabilization include a class of universal resource states
displaying two-dimensional symmetry-protected topological order, along with
tensor network states obtained by generalizing a construction due to Bravyi and
Vyalyi. Extensions to representative classes of mixed graph-product and thermal
states are also discussed.Comment: 20 + 9 pages, 9 figure
Statistical Mechanical Formulation and Simulation of Prime Factorization of Integers
We propose a new formulation of the problem of prime factorization of
integers. With replica exchange Monte Carlo simulation, the behavior which is
seemed to indicate exponential computational hardness is observed. But this
formulation is expected to give a new insight into the computational complexity
of this problem from a statistical mechanical point of view.Comment: 5 pages, 5figures, Proceedings of 4th YSM-SPIP (Sendai, 14-16
December 2012
Finite automata for caching in matrix product algorithms
A diagram is introduced for visualizing matrix product states which makes
transparent a connection between matrix product factorizations of states and
operators, and complex weighted finite state automata. It is then shown how one
can proceed in the opposite direction: writing an automaton that ``generates''
an operator gives one an immediate matrix product factorization of it. Matrix
product factorizations have the advantage of reducing the cost of computing
expectation values by facilitating caching of intermediate calculations. Thus
our connection to complex weighted finite state automata yields insight into
what allows for efficient caching in matrix product algorithms. Finally, these
techniques are generalized to the case of multiple dimensions.Comment: 18 pages, 19 figures, LaTeX; numerous improvements have been made to
the manuscript in response to referee feedbac
Iterative solutions to the steady state density matrix for optomechanical systems
We present a sparse matrix permutation from graph theory that gives stable
incomplete Lower-Upper (LU) preconditioners necessary for iterative solutions
to the steady state density matrix for quantum optomechanical systems. This
reordering is efficient, adding little overhead to the computation, and results
in a marked reduction in both memory and runtime requirements compared to other
solution methods, with performance gains increasing with system size. Either of
these benchmarks can be tuned via the preconditioner accuracy and solution
tolerance. This reordering optimizes the condition number of the approximate
inverse, and is the only method found to be stable at large Hilbert space
dimensions. This allows for steady state solutions to otherwise intractable
quantum optomechanical systems.Comment: 10 pages, 5 figure
- …