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/0012067

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

Guifré Vidal, J. I. Cirac

Published Dec 14, 2000• 37 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0012067

Related papers

Storing Quantum Dynamics in Quantum States: A Stochastic Programmable Gate

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

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.

arXiv:quant-ph/0102037•Physical Review Letters•Jan 11, 2002•99 citations

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

Benchmark for the quantum-enhanced control of reversible dynamics

Yin Mo, Giulio Chiribella

Controlling quantum systems is crucial for quantum computation and a variety of new quantum technologies. The control is typically achieved by breaking down the target dynamics into a sequence of elementary gates,whose description can be stored into the memory of a classical computer. Here we explore a different approach, initiated by Nielsen and Chuang, where the target dynamics is encoded in the state of a quantum system, regarded as a "quantum program". We show that quantum strategies based on coherent interactions between the quantum program and the target system offer an advantage over all classical strategies that measure the program and conditionally operate on the system. To certify the advantage, we provide a benchmark that guarantees the successful demonstration of quantum-enhanced programming in realistic experiments.

arXiv:1706.04128•Jun 13, 2017•1 citation

Quantum States and the Evolution of Quantum Computing

Jincheng Zhang

This paper explores the potential of quantum state transformations as a novel approach to quantum computing. Traditional quantum computation often relies on static, pre-defined quantum states, limiting the scope of computational possibilities. We propose a design of a non-linear transformation algorithm driven by quantum state dynamics, leveraging quantum computing's inherent properties to achieve precise computations and modeling. The core mechanism focuses on manipulating the quantum state through non-linear transformations to generate a precise solution. This research aims to address the limitations of current quantum algorithms by offering a fundamentally different approach to state evolution and computation.

•Aug 31, 2026•0 citations

Implementation of controlled unitary gates and its application in a remote-controlled quantum gate

Byungjoo Kim, Seongjin Hong, Yong‐Su Kim +2 more

Recently, remote-controlled quantum information processing has been proposed for its applications in secure quantum processing protocols and distributed quantum networks. For remote-controlled quantum gates, the experimental realization of controlled unitary (CU) gates between any quantum gates is an essential task. Here, we propose and experimentally demonstrate a scheme for implementing CU gates between any pair of unitary gates using the polarization and time-bin degrees of freedom of single photons. Then, we experimentally implement remote-controlled single-qubit unitary gates by controlling either the state preparation or measurement of the control qubit with high process fidelities. We believe the proposed remote-controlled quantum gate model can pave the way for secure and efficient quantum information processing.

arXiv:2405.15931•Optics Express•Oct 16, 2024•3 citations

Quantum Computers

S. Rajasekar, R. Velusamy

In quantum computers a unitary transformation is applied to a given initial state of a set of qubits through several quantum gates. Tests were conducted using Grover's algorithm and implemented in a variety of different ways on the publically available IBM quantum computers. Essentially, quantum computers manipulate quantum states instead of classical bits. Quantum information can be represented by the elementary units called quantum bits abbreviated as qubits or qbits. This chapter discusses the fundamental properties of quantum systems that are relevant to information processing. Quantum computation needs something much more than that quantum parallelism to be useful. This is achieved in Deutsch's algorithm which combines quantum parallelism with interference. One can simulate a classical circuit using a quantum circuit. That is, it is possible to perform classical computations on quantum computers. But the advantage of quantum computing is that powerful functions may be computed by making use of quantum parallelism, the fundamental feature of many quantum algorithms.

CRC Press eBooks•Oct 5, 2022•0 citations
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.
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.
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.
Controlling quantum systems is crucial for quantum computation and a variety of new quantum technologies. The control is typically achieved by breaking down the target dynamics into a sequence of elementary gates,whose description can be stored into the memory of a classical computer. Here we explore a different approach, initiated by Nielsen and Chuang, where the target dynamics is encoded in the state of a quantum system, regarded as a "quantum program". We show that quantum strategies based on coherent interactions between the quantum program and the target system offer an advantage over all classical strategies that measure the program and conditionally operate on the system. To certify the advantage, we provide a benchmark that guarantees the successful demonstration of quantum-enhanced programming in realistic experiments.
This paper explores the potential of quantum state transformations as a novel approach to quantum computing. Traditional quantum computation often relies on static, pre-defined quantum states, limiting the scope of computational possibilities. We propose a design of a non-linear transformation algorithm driven by quantum state dynamics, leveraging quantum computing's inherent properties to achieve precise computations and modeling. The core mechanism focuses on manipulating the quantum state through non-linear transformations to generate a precise solution. This research aims to address the limitations of current quantum algorithms by offering a fundamentally different approach to state evolution and computation.
Recently, remote-controlled quantum information processing has been proposed for its applications in secure quantum processing protocols and distributed quantum networks. For remote-controlled quantum gates, the experimental realization of controlled unitary (CU) gates between any quantum gates is an essential task. Here, we propose and experimentally demonstrate a scheme for implementing CU gates between any pair of unitary gates using the polarization and time-bin degrees of freedom of single photons. Then, we experimentally implement remote-controlled single-qubit unitary gates by controlling either the state preparation or measurement of the control qubit with high process fidelities. We believe the proposed remote-controlled quantum gate model can pave the way for secure and efficient quantum information processing.
In quantum computers a unitary transformation is applied to a given initial state of a set of qubits through several quantum gates. Tests were conducted using Grover's algorithm and implemented in a variety of different ways on the publically available IBM quantum computers. Essentially, quantum computers manipulate quantum states instead of classical bits. Quantum information can be represented by the elementary units called quantum bits abbreviated as qubits or qbits. This chapter discusses the fundamental properties of quantum systems that are relevant to information processing. Quantum computation needs something much more than that quantum parallelism to be useful. This is achieved in Deutsch's algorithm which combines quantum parallelism with interference. One can simulate a classical circuit using a quantum circuit. That is, it is possible to perform classical computations on quantum computers. But the advantage of quantum computing is that powerful functions may be computed by making use of quantum parallelism, the fundamental feature of many quantum algorithms.