Related papers: Quantum Computing and Dynamical Quantum Models
Quantum mechanics can emerge from classical statistics. A typical quantum system describes an isolated subsystem of a classical statistical ensemble with infinitely many classical states. The state of this subsystem can be characterized by…
Quantum annealing aims to provide a faster method for finding the minima of complicated functions, compared to classical computing, so there is an increasing interest in the relaxation dynamics of quantum spin systems. Moreover, it is known…
Future quantum computers will enable novel sign-problem-free studies of dynamical phenomena in non-perturbative quantum field theories, including real-time evolution and spontaneous supersymmetry breaking. We are investigating applications…
Quantum computing uses the physical principles of very small systems to develop computing platforms which can solve problems that are intractable on conventional supercomputers. There are challenges not only in building the required…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be…
We uncover a dynamical entanglement transition in a monitored quantum system that is heralded by a local order parameter. Classically, chaotic systems can be stochastically controlled onto unstable periodic orbits and exhibit controlled and…
We develop dynamical programming methods for the purpose of optimal control of quantum states with convex constraints and concave cost and bequest functions of the quantum state. We consider both open loop and feedback control schemes,…
We study the effects of dynamical imperfections in quantum computers. By considering an explicit example, we identify different regimes ranging from the low-frequency case, where the imperfections can be considered as static but with…
I provide an alternative way of seeing quantum computation. First, I describe an idealized classical problem solving machine that, thanks to a many body interaction, reversibly and nondeterministically produces the solution of the problem…
The article establishes a framework for dynamic generation of informationally complete POVMs in quantum state tomography. Assuming that the evolution of a quantum system is given by a dynamical map in the Kraus representation, one can…
We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associated with an underlying distribution. Amongst other properties, we (a) obtain speed-ups…
Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…
In this article we propose a dynamic quantum tomography model for open quantum systems with evolution given by phase-damping channels. Mathematically, these channels correspond to completely positive trace-preserving maps defined by the…
We develop a rigorous treatment of discontinuous stochastic unitary evolution for a system of quantum particles that interacts singularly with quantum "bubbles" at random instants of time. This model of a "cloud chamber" allows to watch and…
Quantum sampling, a fundamental subroutine in numerous quantum algorithms, involves encoding a given probability distribution in the amplitudes of a pure state. Given the hefty cost of large-scale quantum storage, we initiate the study of…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…
Quantum algorithms are built enabling to find Poincar\'e recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of…
We discuss the classical statistics of isolated subsystems. Only a small part of the information contained in the classical probability distribution for the subsystem and its environment is available for the description of the isolated…
The model of open quantum systems is adopted to describe the non-local dynamical behaviour of qubits processed by entangling gates. The analysis gets to the conclusion that a distinction between evaluation steps and task-oriented computing…