Related papers: Programmable Open Quantum Systems
Programmable money, enabled by digital currencies, facilitates outcomes beyond simple payments by allowing users to attach conditions to the movement of funds through code. However, there is a lack of clarity on defining programmable money,…
Simulating open quantum systems is an essential technique for understanding complex physical phenomena and advancing quantum technologies. Some quantum algorithms simulate Lindblad dynamics exponentially accurately, i.e., they achieve…
Constructing general programmable circuits to be able to run any given unitary operator efficiently on a quantum processor is of fundamental importance. We present a new quantum circuit design technique resulting two general programmable…
Modern classical computing devices, except of simplest calculators, have von Neumann architecture, i.e., a part of the memory is used for the program and a part for the data. It is likely, that analogues of such architecture are also…
We consider the extent to which a Trotterized time evolution implemented on a quantum computer is altered by the presence of decoherence. Given a specific set of assumptions regarding the manner in which noise processes acting on such a…
Measurement incompatibility describes two or more quantum measurements whose expected joint outcome on a given system cannot be defined. This purely non-classical phenomenon provides a necessary ingredient in many quantum information tasks…
In a recent work [D. K. Burgarth et al., Nat. Commun. 5, 5173 (2014)] it was shown that a series of frequent measurements can project the dynamics of a quantum system onto a subspace in which the dynamics can be more complex. In this…
Quantum coherence is the key resource for quantum technology, with applications in quantum optics, information processing, metrology and cryptography. Yet, there is no universally efficient method for quantifying coherence either in…
Semidefinite programs (SDPs) are a framework for exact or approximate optimization that have widespread application in quantum information theory. We introduce a new method for using reductions to construct integrality gaps for SDPs. These…
We investigate dynamical many-body systems capable of universal computation, which leads to their properties being unpredictable unless the dynamics is simulated from the beginning to the end. Unpredictable behavior can be quantitatively…
Scalable characterization of quantum processors is crucial for mitigating noise and imperfections. While randomized measurement protocols enable efficient access to local observables, inferring a globally consistent description of…
Nonseparability - multipartite states that cannot be factorized - is one of the most striking features of quantum mechanics, as it gives rise to entanglement and non-causal correlations. In quantum computing, it also contributes directly to…
We experimentally demonstrate a programmable single-qubit quantum gate. This device applies a unitary phase shift operation to a data qubit with the value of the phase shift being fully determined by the state of a program qubit. Our linear…
We introduce a novel quantum programming language featuring higher-order programs and quantum controlflow which ensures that all qubit transformations are unitary. Our language boasts a type system guaranteeingboth unitarity and…
For a given target system and apparatus described by quantum theory, the so-called quantum no-programming theorem indicates that a family of states called programs in the apparatus with a fixed unitary operation on the total system programs…
With their constantly increasing peak performance and memory capacity, modern supercomputers offer new perspectives on numerical studies of open many-body quantum systems. These systems are often modeled by using Markovian quantum master…
The Lindblad equation determines the time evolution of the density operator of open quantum systems. While valid for any system size, its use is, in practice, restricted to prototype/surrogate models with the aim of tackling specific…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
We introduce a general construction of master equations with memory kernel whose solutions are given by completely positive trace preserving maps. These dynamics going beyond the Lindblad paradigm are obtained with reference to classical…
We present the probability preserving description of the decaying particle within the framework of quantum mechanics of open systems taking into account the superselection rule prohibiting the superposition of the particle and vacuum. In…