English
Related papers

Related papers: Quantum Computing and Dynamical Quantum Models

200 papers

We analyze the problem of reconstructing an unknown quantum state of a multipartite system from repeated measurements of local observables. In particular, via a system-theoretic observability analysis, we show that, even when the initial…

Quantum Physics · Physics 2025-09-23 Marco Peruzzo , Tommaso Grigoletto , Francesco Ticozzi

Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…

Quantum Physics · Physics 2008-11-26 Dave Bacon

In a previous paper a formalism to analyze the dynamical evolution of classical and quantum probability distributions in terms of their moments was presented. Here the application of this formalism to the system of a particle moving on a…

Quantum Physics · Physics 2014-12-19 David Brizuela

Quantum computation is a novel way of information processing which allows, for certain classes of problems, exponential speedups over classical computation. Various models of quantum computation exist, such as the adiabatic, circuit and…

Quantum Physics · Physics 2012-08-02 Robert Raussendorf , Tzu-Chieh Wei

Due to the exponential growth of the state space of coupled quantum systems it is not possible, in general, to numerically store the state of a very large number of quantum systems within a classical computer. We demonstrate a method for…

Quantum Physics · Physics 2017-02-07 J. J. Bowen , V. M. Dwyer , I. W. Phillips , M. J. Everitt

Each scheme of state reconstruction comes down to parametrize the state of a quantum system by expectation values or probabilities directly measurable in an experiment. It is argued that the time evolution of these quantities provides an…

Quantum Physics · Physics 2014-11-18 Stefan Weigert

Atomicity is a ubiquitous assumption in distributed computing, under which actions are indivisible and appear sequential. In classical computing, this assumption has several theoretical and practical guarantees. In quantum computing,…

Quantum Physics · Physics 2024-04-30 Zhicheng Zhang , Mingsheng Ying

Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…

Quantum Physics · Physics 2007-05-23 Yuri Ozhigov

Hybrid classical-quantum models are computational schemes that investigate the time evolution of systems, where some degrees of freedom are treated classically, while others are described quantum-mechanically. First, we present the…

Quantum Physics · Physics 2024-02-19 Daniel R. Terno

This paper considers a generalization of the notion of quantum observables in ontological models of quantum mechanics. Within this framework it is possible to construct physical models where quantum noncommutativity can arise dynamically.…

Quantum Physics · Physics 2007-12-12 Tung Ten Yong

We consider the problem of determining the state of a quantum system given one or more readings of the expectation value of an observable. The system is assumed to be a finite dimensional quantum control system for which we can influence…

Quantum Physics · Physics 2009-11-10 Domenico D'Alessandro

We consider quantum state tomography with measurement procedures of the following type: First, we subject the quantum state we aim to identify to a know time evolution for a desired period of time. Afterwards we perform a measurement with a…

Quantum Physics · Physics 2017-01-24 Michael Kech

Dynamical maps describe general transformations of the state of a physical system, and their iteration can be interpreted as generating a discrete time evolution. Prime examples include classical nonlinear systems undergoing transitions to…

Quantum Physics · Physics 2013-11-19 P. Schindler , M. Müller , D. Nigg , J. T. Barreiro , E. A. Martinez , M. Hennrich , T. Monz , S. Diehl , P. Zoller , R. Blatt

Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…

Formal Languages and Automata Theory · Computer Science 2018-07-05 Andris Ambainis , Abuzer Yakaryılmaz

We characterize good clocks, which are naturally subject to fluctuations, in statistical terms. We also obtain the master equation that governs the evolution of quantum systems according to these clocks and find its general solution. This…

Quantum Physics · Physics 2009-10-31 Inigo L. Egusquiza , Luis J. Garay , Jose M. Raya

Probabilistic cellular automata with deterministic updating are quantum systems. We employ the quantum formalism for an investigation of random probabilistic cellular automata, which start with a probability distribution over initial…

Quantum Physics · Physics 2024-05-17 A. Kreuzkamp , C. Wetterich

We study the classical motion of a particle subject to a stochastic force. We then present a perturbative schema for the associated Fokker-Planck equation where, in the limit of a vanishingly small noise source, a consistent dynamical model…

Quantum Physics · Physics 2007-05-23 M. S. Torres , J. M. A. Figueiredo

The dynamical equation of quantum mechanics are rewritten in form of dynamical equations for the measurable, positive marginal distribution of the shifted, rotated and squeezed quadrature introduced in the so called "symplectic tomography".…

Quantum Physics · Physics 2009-10-30 Stefano Mancini , Vladimir I. Man'ko , Paolo Tombesi

If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting…

Quantum Physics · Physics 2009-10-31 Daniel S. Abrams , Seth Lloyd

This paper shows that, if we could examine the entire history of a hidden variable, then we could efficiently solve problems that are believed to be intractable even for quantum computers. In particular, under any hidden-variable theory…

Quantum Physics · Physics 2007-05-23 Scott Aaronson
‹ Prev 1 2 3 10 Next ›