Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0102037 · Physical Review Letters

Storing Quantum Dynamics in Quantum States: A Stochastic Programmable Gate

Guifré Vidal, Lluís Masanes, J. I. Cirac

Published Jan 11, 2002• 99 citations
arXivHTMLPDF

Abstract

We show how to encode quantum dynamics in the state of a quantum system, in such a way that the system can be used to stochastically perform, at a later time, the stored transformation on some other quantum system. The probability of failure decreases exponentially with the number of qubits that store the transformation. We discuss optimality of this scheme, whose applications include viability of a (stochastic) programmable quantum gate and the teleportation of quantum transformations using entanglement and unidirectional classical communication.

DOI
10.1103/physrevlett.88.047905

Related papers

Storage of quantum dynamics on quantum states: a quasi-perfect programmable quantum gate

Guifré Vidal, J. I. Cirac

We show how quantum dynamics (a unitary transformation) can be captured in the state of a quantum system, in such a way that the system can be used to perform, at a later time, the stored transformation almost perfectly on some other quantum system. Thus programmable quantum gates for quantum information processing are feasible if some small degree of imperfection is allowed. We discuss the possibility of using this fact for securely computing a secret function on a public quantum computer. Finally, our scheme for storage of operations also allows for a new form of quantum remote control.

arXiv:quant-ph/0012067•Dec 14, 2000•37 citations

Stochastic emulation of quantum algorithms

Daniel Braun, Ronny Müller

Abstract Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two qubits at the same time. The former aspect renders the direct classical simulation of quantum algorithms difficult. Here we introduce higher-order partial derivatives of a probability distribution of particle positions as a new object that shares these basic properties of quantum mechanical states needed for a quantum algorithm. Discretization of the positions allows one to represent the quantum mechanical state of n bit qubits by 2(n bit + 1) classical stochastic bits. Based on this, we demonstrate many-particle interference and representation of pure entangled quantum states via derivatives of probability distributions and find the universal set of stochastic maps that correspond to the quantum gates in a universal gate set. We prove that the propagation via the stochastic map built from those universal stochastic maps reproduces up to a prefactor exactly the evolution of the quantum mechanical state with the corresponding quantum algorithm, leading to an automated translation of a quantum algorithm to a stochastic classical algorithm. We implement several well-known quantum algorithms, analyse the scaling of the needed number of realizations with the number of qubits, and highlight the role of destructive interference for the cost of the emulation.

arXiv:2109.07777•New Journal of Physics•Jan 13, 2022•1 citation

Probabilistic storage and retrieval of qubit phase gates

Michal Sedlák, Mário Ziman

Probabilistic storage and retrieval (PSR) of unitary quantum dynamics is possible with exponentially small failure probability with respect to the number of systems used as a quantum memory [M. Sedl\'ak, A. Bisio, and M. Ziman, Phys. Rev. Lett. 122, 170502 (2019)]. Here we study improvements due to a priori knowledge about the unitary transformation to be stored. In particular, we study $N\ensuremath{\rightarrow}1$ PSR of qubit phase gates, i.e., qubit rotations around the $Z$ axis with an unknown angle, and show that if we access the gate only $N$ times the optimal probability of perfect retrieving of its single use is $N/(N+1)$. We propose a quantum circuit realization for the optimal protocol and show that a programmable phase gate [G. Vidal, L. Masanes, and J. I. Cirac, Phys. Rev. Lett. 88, 047905 (2002)] can be turned into a $({2}^{k}\ensuremath{-}1)\ensuremath{\rightarrow}1$ optimal PSR of phase gates and requires only $k$ controlled-not gates, while having exponentially small failure probability in $k$.

arXiv:2008.09555•Physical Review A•Sep 17, 2020•14 citations

Teleportation of a programmable gate

Nada Ali, Mark Hillery

Alice and Bob each have a qubit, and they would like to perform a two-qubit gate on them with the assistance of Charlie. The action of this gate depends on a parameter, which either Charlie knows, will receive later as classical information, or is encoded in a program state. We discuss both the case in which Alice and Bob send Charlie their qubits, which he entangles with his state, and the case where Alice and Bob use teleportation to entangle their states with Charlie's state. All of these procedures depend on the ability of Alice and Bob to apply local correction operations that depend on the results of measurements that Charlie makes, and we discuss under what conditions such operations are possible.

quant-pharXiv:2610.09022•Oct 8, 2026•0 citations

Storing unitary operators in quantum states

Jae‐Hyun Kim, Yongwook Cheong, Jae‐Seung Lee +1 more

We present a scheme to store unitary operators with self-inverse generators in quantum states and a general circuit to retrieve them with definite success probability. The continuous variable of the operator is stored in a single-qubit state and the information about the kind of the operator is stored in classical states with finite dimension. The probability of successful retrieval is always 1/2 irrespective of the kind of the operator, which is proved to be maximum. In case of failure, the result can be corrected with additional quantum states. The retrieving circuit is almost as simple as that which handles only the single-qubit rotations and CNOT as the basic operations. An interactive way to transfer quantum dynamics, that is, to distribute naturally copy-protected programs for quantum computers is also presented using this scheme.

arXiv:quant-ph/0109097•Physical Review A•Dec 5, 2001•16 citations

Quantum Information Encoding for Complex Dynamical Systems

Jincheng Zhang

Quantum information encoding is a burgeoning field with the potential to revolutionize complex system modeling, particularly those exhibiting dynamic behavior. This paper investigates a novel approach to encoding complex dynamical systems into quantum information, leveraging quantum entanglement to achieve faster and more precise simulation compared to classical methods. We propose a method centered around the creation of entangled states that directly represent the state space of the system, offering a significant advancement in the ability to efficiently simulate and control these intricate systems. The core mechanism hinges on exploiting the inherent correlations within entangled states to facilitate a more streamlined and accurate representation of the system's dynamics. The potential impact of this research extends to diverse areas, including control systems, optimization, and fundamental physics research.

•Sep 4, 2026•0 citations
We show how to encode quantum dynamics in the state of a quantum system, in such a way that the system can be used to stochastically perform, at a later time, the stored transformation on some other quantum system. The probability of failure decreases exponentially with the number of qubits that store the transformation. We discuss optimality of this scheme, whose applications include viability of a (stochastic) programmable quantum gate and the teleportation of quantum transformations using entanglement and unidirectional classical communication.
We show how quantum dynamics (a unitary transformation) can be captured in the state of a quantum system, in such a way that the system can be used to perform, at a later time, the stored transformation almost perfectly on some other quantum system. Thus programmable quantum gates for quantum information processing are feasible if some small degree of imperfection is allowed. We discuss the possibility of using this fact for securely computing a secret function on a public quantum computer. Finally, our scheme for storage of operations also allows for a new form of quantum remote control.
Abstract Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two qubits at the same time. The former aspect renders the direct classical simulation of quantum algorithms difficult. Here we introduce higher-order partial derivatives of a probability distribution of particle positions as a new object that shares these basic properties of quantum mechanical states needed for a quantum algorithm. Discretization of the positions allows one to represent the quantum mechanical state of n bit qubits by 2(n bit + 1) classical stochastic bits. Based on this, we demonstrate many-particle interference and representation of pure entangled quantum states via derivatives of probability distributions and find the universal set of stochastic maps that correspond to the quantum gates in a universal gate set. We prove that the propagation via the stochastic map built from those universal stochastic maps reproduces up to a prefactor exactly the evolution of the quantum mechanical state with the corresponding quantum algorithm, leading to an automated translation of a quantum algorithm to a stochastic classical algorithm. We implement several well-known quantum algorithms, analyse the scaling of the needed number of realizations with the number of qubits, and highlight the role of destructive interference for the cost of the emulation.
Probabilistic storage and retrieval (PSR) of unitary quantum dynamics is possible with exponentially small failure probability with respect to the number of systems used as a quantum memory [M. Sedl\'ak, A. Bisio, and M. Ziman, Phys. Rev. Lett. 122, 170502 (2019)]. Here we study improvements due to a priori knowledge about the unitary transformation to be stored. In particular, we study $N\ensuremath{\rightarrow}1$ PSR of qubit phase gates, i.e., qubit rotations around the ZZZ axis with an unknown angle, and show that if we access the gate only NNN times the optimal probability of perfect retrieving of its single use is N/(N+1)N/(N+1)N/(N+1). We propose a quantum circuit realization for the optimal protocol and show that a programmable phase gate [G. Vidal, L. Masanes, and J. I. Cirac, Phys. Rev. Lett. 88, 047905 (2002)] can be turned into a $({2}^{k}\ensuremath{-}1)\ensuremath{\rightarrow}1$ optimal PSR of phase gates and requires only kkk controlled-not gates, while having exponentially small failure probability in kkk.
Alice and Bob each have a qubit, and they would like to perform a two-qubit gate on them with the assistance of Charlie. The action of this gate depends on a parameter, which either Charlie knows, will receive later as classical information, or is encoded in a program state. We discuss both the case in which Alice and Bob send Charlie their qubits, which he entangles with his state, and the case where Alice and Bob use teleportation to entangle their states with Charlie's state. All of these procedures depend on the ability of Alice and Bob to apply local correction operations that depend on the results of measurements that Charlie makes, and we discuss under what conditions such operations are possible.
We present a scheme to store unitary operators with self-inverse generators in quantum states and a general circuit to retrieve them with definite success probability. The continuous variable of the operator is stored in a single-qubit state and the information about the kind of the operator is stored in classical states with finite dimension. The probability of successful retrieval is always 1/2 irrespective of the kind of the operator, which is proved to be maximum. In case of failure, the result can be corrected with additional quantum states. The retrieving circuit is almost as simple as that which handles only the single-qubit rotations and CNOT as the basic operations. An interactive way to transfer quantum dynamics, that is, to distribute naturally copy-protected programs for quantum computers is also presented using this scheme.
Quantum information encoding is a burgeoning field with the potential to revolutionize complex system modeling, particularly those exhibiting dynamic behavior. This paper investigates a novel approach to encoding complex dynamical systems into quantum information, leveraging quantum entanglement to achieve faster and more precise simulation compared to classical methods. We propose a method centered around the creation of entangled states that directly represent the state space of the system, offering a significant advancement in the ability to efficiently simulate and control these intricate systems. The core mechanism hinges on exploiting the inherent correlations within entangled states to facilitate a more streamlined and accurate representation of the system's dynamics. The potential impact of this research extends to diverse areas, including control systems, optimization, and fundamental physics research.