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

Cambridge University Press eBooks

State Preparation

Peter P. Rohde

Published Sep 9, 2021• 0 citations
Publisher
DOI
10.1017/9781108868815.018

Related papers

State Preparation and Determination

WORLD SCIENTIFIC eBooks•Mar 1, 1998•0 citations

Nonclassical Preparation of Quantum Remote States

Shih Hsuan Chen, Kao, Yu-Chien, Neill Lambert +2 more

Remote state preparation (RSP) enables a sender to remotely prepare the quantum state of a receiver without sending the state itself. Recently, it has been recognized that quantum discord is a necessary resource for RSP. Here, we theoretically and experimentally investigate whether RSP can outperform dynamic classical remote state preparation processes. We show that such classical processes can describe certain RSPs powered by quantum discord. Rather, we argue that a new kind of Einstein-Podolsky-Rosen steering for dynamical processes, called quantum process steering, is the resource required for performing nonclassical RSP. We show how to measure quantum process steering by experimentally realizing nonclassical RSP of photonic quantum systems. Moreover, we demonstrate the transition from classical to quantum RSP. Our results also have applications in realizing genuine quantum RSP for quantum-enabled engineering.

arXiv:2008.06238•Aug 14, 2020•3 citations

Approximate State Preparation for Noisy Quantum Computers

Tom Rindell

Any quantum computation begins with some process of state preparation where the prepared state functions as the input value for the computation. For most states, preparation becomes exceedingly more demanding as the number of qubits increases. Moreover, the noise present in the gate operations further complicates the process by contributing to the decoherence of the state. This thesis studies possible approaches to address these problems. For a reader not familiar with the basic principles of quantum computing, Chapter 2 should provide a sufficient summary in order to follow through the rest of the thesis. In Chapter 3 a standard method of state preparation is presented in detail for 2 and 4-qubit cases and then generalized for an arbitrary number of qubits. However in order to present a comprehensive coverage, the necessary gate decompositions for state preparation are first presented and proved. The number of required quantum gates for the preparation of a general state increases exponentially in the number of qubits. Each gate introduces a small error in the computation, the cumulative effect of which can make the decoherence in the final state very severe. Therefore it is perhaps more suitable to prepare a less complex approximation of the target state with fewer gates to obtain better fidelity in the presence of noise. For this purpose, two methods are presented: low-rank state preparation algorithm (LRSP) and a genetic algorithm. LRSP provides a systematic way to generate circuits for approximate state preparation; however, for any given state LRSP can make only very specific approximations, giving us a very limited range of circuits to work with. For this reason our work introduces a genetic algorithm to iterate over the LRSP circuits and to provide a wider range of candidate circuits for approximate state preparation. Using this approach we prepared a range of approximate state preparation circuits for 1000 different Haar-random states and ran them with simulated noise on IBM Qiskit FakeVigo backend. We found that the numerical results matched closely with our theoretical prediction and showed that when run on a noisy quantum computer, the highest fidelity is obtained not for the exact state preparation circuit but for a shorter approximate circuit.

Työväentutkimus Vuosikirja•Oct 25, 2025•0 citations

State Preparation and Determination

WORLD SCIENTIFIC eBooks•Sep 8, 2014•0 citations

Preparing remote states for genuine quantum networks

Shih-Hsuan Chen, Chan Hsu, Yu-Chien Kao +4 more

Quantum networks typically comprise quantum channels, repeaters, and end nodes. Remote state preparation (RSP) allows one end node to prepare the states of the other end nodes remotely. While quantum discord has recently been recognized as necessary for RSP, it does not guarantee the practical implementation of RSP in quantum networks surpasses any classical method. Herein, we theoretically introduce and experimentally study a quantum resource that we call the RSP capability. This resource validates all the static and dynamic elements required to enable genuine quantum networks where the RSP’s implementation can outperform any classical emulation of entanglement- and qubit-unitaries-free strategies, including the static resources of Einstein-Podolsky-Rosen pairs and the dynamic resources of quantum channels and repeaters. Our experiment measures the RSP capability to demonstrate the transition between classical and nonclassical RSP depending on the photon-pair qualities. It shows that quantum discord does not confirm a nonclassical RSP, but the RSP capability does. These results help reveal the quantum advantages that emerge when networking RSP is in play. The authors introduce and experimentally study a quantum resource called the remote state preparation capability. This resource validates all static and dynamic elements required to enable quantum networks where the implementation of remote state preparation can outperform any classical emulation of entanglement- and qubit-unitaries-free strategies.

arXiv:2212.01965•Communications Physics•Oct 27, 2024•3 citations

Remote State Preparation

M. Michler, Ramón Risco, Harald Weinfurter

European Quantum Electronics Conference (EQEC)•Aug 24, 2005•10 citations
Remote state preparation (RSP) enables a sender to remotely prepare the quantum state of a receiver without sending the state itself. Recently, it has been recognized that quantum discord is a necessary resource for RSP. Here, we theoretically and experimentally investigate whether RSP can outperform dynamic classical remote state preparation processes. We show that such classical processes can describe certain RSPs powered by quantum discord. Rather, we argue that a new kind of Einstein-Podolsky-Rosen steering for dynamical processes, called quantum process steering, is the resource required for performing nonclassical RSP. We show how to measure quantum process steering by experimentally realizing nonclassical RSP of photonic quantum systems. Moreover, we demonstrate the transition from classical to quantum RSP. Our results also have applications in realizing genuine quantum RSP for quantum-enabled engineering.
Any quantum computation begins with some process of state preparation where the prepared state functions as the input value for the computation. For most states, preparation becomes exceedingly more demanding as the number of qubits increases. Moreover, the noise present in the gate operations further complicates the process by contributing to the decoherence of the state. This thesis studies possible approaches to address these problems. For a reader not familiar with the basic principles of quantum computing, Chapter 2 should provide a sufficient summary in order to follow through the rest of the thesis. In Chapter 3 a standard method of state preparation is presented in detail for 2 and 4-qubit cases and then generalized for an arbitrary number of qubits. However in order to present a comprehensive coverage, the necessary gate decompositions for state preparation are first presented and proved. The number of required quantum gates for the preparation of a general state increases exponentially in the number of qubits. Each gate introduces a small error in the computation, the cumulative effect of which can make the decoherence in the final state very severe. Therefore it is perhaps more suitable to prepare a less complex approximation of the target state with fewer gates to obtain better fidelity in the presence of noise. For this purpose, two methods are presented: low-rank state preparation algorithm (LRSP) and a genetic algorithm. LRSP provides a systematic way to generate circuits for approximate state preparation; however, for any given state LRSP can make only very specific approximations, giving us a very limited range of circuits to work with. For this reason our work introduces a genetic algorithm to iterate over the LRSP circuits and to provide a wider range of candidate circuits for approximate state preparation. Using this approach we prepared a range of approximate state preparation circuits for 1000 different Haar-random states and ran them with simulated noise on IBM Qiskit FakeVigo backend. We found that the numerical results matched closely with our theoretical prediction and showed that when run on a noisy quantum computer, the highest fidelity is obtained not for the exact state preparation circuit but for a shorter approximate circuit.
Quantum networks typically comprise quantum channels, repeaters, and end nodes. Remote state preparation (RSP) allows one end node to prepare the states of the other end nodes remotely. While quantum discord has recently been recognized as necessary for RSP, it does not guarantee the practical implementation of RSP in quantum networks surpasses any classical method. Herein, we theoretically introduce and experimentally study a quantum resource that we call the RSP capability. This resource validates all the static and dynamic elements required to enable genuine quantum networks where the RSP’s implementation can outperform any classical emulation of entanglement- and qubit-unitaries-free strategies, including the static resources of Einstein-Podolsky-Rosen pairs and the dynamic resources of quantum channels and repeaters. Our experiment measures the RSP capability to demonstrate the transition between classical and nonclassical RSP depending on the photon-pair qualities. It shows that quantum discord does not confirm a nonclassical RSP, but the RSP capability does. These results help reveal the quantum advantages that emerge when networking RSP is in play. The authors introduce and experimentally study a quantum resource called the remote state preparation capability. This resource validates all static and dynamic elements required to enable quantum networks where the implementation of remote state preparation can outperform any classical emulation of entanglement- and qubit-unitaries-free strategies.