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/0109097 · Physical Review A

Storing unitary operators in quantum states

Jae‐Hyun Kim, Yongwook Cheong, Jae‐Seung Lee, Soonchil Lee

Published Dec 5, 2001• 16 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.65.012302

Related papers

Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations

Marco Túlio Quintino, Qingxiuxiong Dong, Atsushi Shimbo +2 more

Given a quantum gate implementing a d-dimensional unitary operation U_{d}, without any specific description but d, and permitted to use k times, we present a universal probabilistic heralded quantum circuit that implements the exact inverse U_{d}^{-1}, whose failure probability decays exponentially in k. The protocol employs an adaptive strategy, proven necessary for the exponential performance. It requires that k≥d-1, proven necessary for the exact implementation of U_{d}^{-1} with quantum circuits. Moreover, even when quantum circuits with indefinite causal order are allowed, k≥d-1 uses are required. We then present a finite set of linear and positive semidefinite constraints characterizing universal unitary inversion protocols and formulate a convex optimization problem whose solution is the maximum success probability for given k and d. The optimal values are computed using semidefinite programing solvers for k≤3 when d=2 and k≤2 for d=3. With this numerical approach we show for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.

arXiv:1810.06944•Physical Review Letters•Nov 21, 2019•108 citations

A Quantum Copy-Protection Scheme with Authentication

László Gyöngyösi, Sándor Imre

We propose a quantum copy-protection system which protects classical information in the form of non-orthogonal quantum states. The decryption of the stored information is not possible in the classical representation and the decryption mechanism of data qubits is realized by secret unitary rotations. We define an authentication method for the proposed copy-protection scheme and analyse the success probabilities of the authentication process. A possible experimental realization of the scheme is also presented.

arXiv:1207.4462•Jul 18, 2012•0 citations

Probabilistic nonunitary quantum computing

Colin P. Williams

In [1] Gingrich and Williams extended the standard quantum circuit model of quantum computation to include gates that perform arbitrary linear, yet non-unitary, transformations of their input state. In this paper we use this theory to construct quantum circuits that perform desired non-unitary state transformations of the sort arising in lattice-based quantum search. Such n-qubit non-unitary gates cannot be achieved deterministically, but they can be achieved probabilistically using a single ancilla. Our approach is to use the n-qubit non-unitary gate to design an (n+1)-qubit Hamiltonian that can be seen to induce a suitable conditional dynamics such that whenever the output value of the ancilla qubit is measured and found to be |O>, then the remaining (unmeasured) n qubits will contain the desired non-unitary transform of the n-qubit input state. The scheme is necessarily probabilistic because we cannot force the measurement on the ancilla qubit to return the value we want. Fortunately, however, failed attempts are found to disturb the n-qubit input state very little. This allows us to re-use the result of successive “failed” attempts until the success condition is finally attained, and we give analytic expressions for the success probability and net fidelity in this case. By using our previous method for designing a quantum circuit for an arbitrary n-qubit gate in conjunction with our new probabilistic non-unitary procedure we are able to compute an explicit quantum circuit sufficient to implement an arbitrary linear, yet non-unitary, transformation of an input pure or mixed n-qubit state, using only a single copy of the input state. This allows us to extend the repertoire of computations that may be performed on a quantum computer, and in particular, gives the first explicit construction of the quantum circuits needed to perform some of the key operations arising in quantum lattice search.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 24, 2004•9 citations

Multicopy teleportation and quantum program retrieval on superconducting quantum hardware

Yousef Mafi, Ali G. Moghaddam

Correction-free teleportation protocols offer a probabilistic route around the limits imposed by the quantum no-programming theorem, but have remained largely theoretical. Here, we experimentally implement and benchmark correction-free multicopy teleportation on noisy superconducting quantum hardware. Key to this is an efficient circuit implementation: by suitably decomposing the unitary that maps the multicopy measurement basis onto the computational basis, we substantially reduce circuit depth and gate count. For one- and two-qubit input states, using $k=2$ and $3$ copies, we observe success probabilities substantially exceeding the single-copy bound with fidelities above 0.85. We further explore applications to probabilistic programmable quantum processors, in particular the storage and retrieval of unitary operations encoded in quantum program states. Our results establish the practical feasibility of multicopy teleportation and highlight its potential for near-term quantum processors and distributed quantum computing.

quant-pharXiv:2611.00874•Nov 3, 2026•0 citations

All-optical storage of a qubit encoded in an oscillator

Yosuke Hashimoto, Takeshi Toyama, Jun–ichi Yoshikawa +3 more

Summary form only given. The efficient and reliable storage of quantum states plays a crucial role for the realization of quantum computation and communication. For example, in linear optics quantum computation as represented by the KLM scheme [1], quantum storage enables one to store intermediate “results” or to boost scalability and reliability of the computation. To employ quantum storage for quantum computation, the storage should be applicable to superposition states, including phase information of the superposition as well as the amplitude information of the state's coefficients. Some schemes exist for such storage using electron or nuclear spins [2]. However, an all-optical storage without the use of atoms or ions has several attractive features such as the wavelength independence of the transition energy. We have already succeeded in storing and retrieving phase-insensitive single-photon states in all-optical way with high purity sufficient for observing non-classicality [3]. Here we demonstrate the all-optical storage of a phase-sensitive photon-number superposition as a next natural step. We can store arbitrary qubits α|0〉 + β|1〉.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 1, 2017•0 citations

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
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.
Given a quantum gate implementing a d-dimensional unitary operation U_{d}, without any specific description but d, and permitted to use k times, we present a universal probabilistic heralded quantum circuit that implements the exact inverse U_{d}^{-1}, whose failure probability decays exponentially in k. The protocol employs an adaptive strategy, proven necessary for the exponential performance. It requires that k≥d-1, proven necessary for the exact implementation of U_{d}^{-1} with quantum circuits. Moreover, even when quantum circuits with indefinite causal order are allowed, k≥d-1 uses are required. We then present a finite set of linear and positive semidefinite constraints characterizing universal unitary inversion protocols and formulate a convex optimization problem whose solution is the maximum success probability for given k and d. The optimal values are computed using semidefinite programing solvers for k≤3 when d=2 and k≤2 for d=3. With this numerical approach we show for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.
We propose a quantum copy-protection system which protects classical information in the form of non-orthogonal quantum states. The decryption of the stored information is not possible in the classical representation and the decryption mechanism of data qubits is realized by secret unitary rotations. We define an authentication method for the proposed copy-protection scheme and analyse the success probabilities of the authentication process. A possible experimental realization of the scheme is also presented.
In [1] Gingrich and Williams extended the standard quantum circuit model of quantum computation to include gates that perform arbitrary linear, yet non-unitary, transformations of their input state. In this paper we use this theory to construct quantum circuits that perform desired non-unitary state transformations of the sort arising in lattice-based quantum search. Such n-qubit non-unitary gates cannot be achieved deterministically, but they can be achieved probabilistically using a single ancilla. Our approach is to use the n-qubit non-unitary gate to design an (n+1)-qubit Hamiltonian that can be seen to induce a suitable conditional dynamics such that whenever the output value of the ancilla qubit is measured and found to be |O>, then the remaining (unmeasured) n qubits will contain the desired non-unitary transform of the n-qubit input state. The scheme is necessarily probabilistic because we cannot force the measurement on the ancilla qubit to return the value we want. Fortunately, however, failed attempts are found to disturb the n-qubit input state very little. This allows us to re-use the result of successive “failed” attempts until the success condition is finally attained, and we give analytic expressions for the success probability and net fidelity in this case. By using our previous method for designing a quantum circuit for an arbitrary n-qubit gate in conjunction with our new probabilistic non-unitary procedure we are able to compute an explicit quantum circuit sufficient to implement an arbitrary linear, yet non-unitary, transformation of an input pure or mixed n-qubit state, using only a single copy of the input state. This allows us to extend the repertoire of computations that may be performed on a quantum computer, and in particular, gives the first explicit construction of the quantum circuits needed to perform some of the key operations arising in quantum lattice search.
Correction-free teleportation protocols offer a probabilistic route around the limits imposed by the quantum no-programming theorem, but have remained largely theoretical. Here, we experimentally implement and benchmark correction-free multicopy teleportation on noisy superconducting quantum hardware. Key to this is an efficient circuit implementation: by suitably decomposing the unitary that maps the multicopy measurement basis onto the computational basis, we substantially reduce circuit depth and gate count. For one- and two-qubit input states, using k=2k=2k=2 and 333 copies, we observe success probabilities substantially exceeding the single-copy bound with fidelities above 0.85. We further explore applications to probabilistic programmable quantum processors, in particular the storage and retrieval of unitary operations encoded in quantum program states. Our results establish the practical feasibility of multicopy teleportation and highlight its potential for near-term quantum processors and distributed quantum computing.
Summary form only given. The efficient and reliable storage of quantum states plays a crucial role for the realization of quantum computation and communication. For example, in linear optics quantum computation as represented by the KLM scheme [1], quantum storage enables one to store intermediate “results” or to boost scalability and reliability of the computation. To employ quantum storage for quantum computation, the storage should be applicable to superposition states, including phase information of the superposition as well as the amplitude information of the state's coefficients. Some schemes exist for such storage using electron or nuclear spins [2]. However, an all-optical storage without the use of atoms or ions has several attractive features such as the wavelength independence of the transition energy. We have already succeeded in storing and retrieving phase-insensitive single-photon states in all-optical way with high purity sufficient for observing non-classicality [3]. Here we demonstrate the all-optical storage of a phase-sensitive photon-number superposition as a next natural step. We can store arbitrary qubits α|0〉 + β|1〉.
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.