Related papers: Atomicity in Distributed Quantum Computing
We initiate the study of asynchronous quantum distributed systems, focusing on the case of implementing atomic quantum global operations that can be decomposed into a collection of local operations on the components of the system. A simple…
We develop a formal model for distributed measurement-based quantum computations, adopting an agent-based view, such that computations are described locally where possible. Because the network quantum state is in general entangled, we need…
A dynamical quantum model assigns an eigenstate to a specified observable even when no measurement is made, and gives a stochastic evolution rule for that eigenstate. Such a model yields a distribution over classical histories of a quantum…
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…
The transport of ultra-cold atoms in magneto-optical potentials provides a clean setting in which to investigate the distinct predictions of classical versus quantum dynamics for a system with coupled degrees of freedom. In this system,…
Quantum mechanics is widely regarded as a complete theory, yet we argue it is a tractable projection of a deeper, computationally-inaccessible classical variational structure. By analyzing the coupled partial differential equations of the…
Quantum computing is presently undergoing rapid development to achieve a significant speedup promised in certain applications. Nonetheless, scaling quantum computers remains a formidable engineering challenge, prompting exploration of…
The promise of universal quantum computing requires scalable single- and inter-qubit control interactions. Currently, three of the leading candidate platforms for quantum computing are based on superconducting circuits, trapped ions, and…
According to the stochastic-quantum correspondence, a quantum system can be understood as a stochastic process unfolding in an old-fashioned configuration space based on ordinary notions of probability and `indivisible' stochastic laws,…
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…
One of the central problems in quantum theory is to characterize, detect, and quantify quantumness in terms of classical strategies. Dephasing processes, caused by non-dissipative information exchange between quantum systems and…
We construct a formal framework for investigating epistemic and temporal notions in the context of distributed quantum computation. While we rely on structures developed earlier, we stress that our notion of quantum knowledge makes sense…
Classical dynamics is formulated as a Hamiltonian flow on phase space, while quantum mechanics is formulated as a unitary dynamics in Hilbert space. These different formulations have made it difficult to directly compare quantum and…
In quantum physics, the density operator completely describes the state. Instead, in classical physics the mean value of every physical quantity is evaluated by means of a probability distribution. We study the possibility to describe pure…
Quantum dynamics can be regarded as a generalization of classical finite-state dynamics. This is a familiar viewpoint for workers in quantum computation, which encompasses classical computation as a special case. Here this viewpoint is…
In the discussion about the quantumness of NMR computation a conclusion is done that computational states are separable and therefore can not be entangled. This conclusion is based on the assumption that the initial density matrix of an…
Quantum nuclear dynamics with wavepacket time-evolution is classically intractable and viewed as a promising avenue for quantum information processing. Here, we use an IonQ 11-qubit trapped-ion quantum computer, Harmony, to study the…
A fundamental problem in statistics and learning theory is to test properties of distributions. We show that quantum computers can solve such problems with significant speed-ups. In particular, we give fast quantum algorithms for testing…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
We consider the problem of quantum behavior in the finite background. Introduction of continuum or other infinities into physics leads only to technical complications without any need for them in description of empirical observations. The…