Related papers: Port-Based State Preparation and Applications
We consider a scheme of quantum teleportation where a receiver has multiple (N) output ports and obtains the teleported state by merely selecting one of the N ports according to the outcome of the sender's measurement. We demonstrate that…
Fast coherent state transport is essential to quantum computation and quantum information processing. While an adiabatic transport of atomic qubits guarantees a high fidelity of the state preparation, it requires a long timescale that…
We put forth Oblivious State Preparation (OSP) as a cryptographic primitive that unifies techniques developed in the context of a quantum server interacting with a classical client. OSP allows a classical polynomial-time sender to input a…
We present a general algorithm, based on machine learning, which can create optimal unitary operators to implement quantum teleportation in any system with well-defined set of measurements in a relevant entangled basis. We illustrate it…
Transmission of quantum states is a central task in quantum information science. Remote state preparation (RSP) has the same goal as teleportation, i.e. transferring quantum information without sending physically the information carrier,…
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…
Quantum Computing allows, in principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register, offering a promising solution to overcome the limitations of traditional quantum chemistry…
We present a general method for finding loss-tolerant teleportation on large, entangled stabilizer states using only single-qubit measurements, known as \emph{stabilizer pathfinding} (SPF). For heralded loss, SPF is shown to generate…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
We propose a scheme of repeated generalized Bell state measurement (GBSM) for probabilistic quantum teleportation of single qubit state of a particle (say, 0) using 3-qubit non-maximally entangled (NME) GHZ state as a quantum channel. Alice…
Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be…
Quantum signal processing (QSP) provides a systematic framework for implementing a polynomial transformation of a linear operator, and unifies nearly all known quantum algorithms. In parallel, recent works have developed randomized…
Quantum error correction is an essential component for practical quantum computing on noisy quantum hardware. However, logical operations on error-corrected qubits require a significant resource overhead, especially for high-precision and…
Quantum state preparation (QSP) is a fundamental task in quantum computation to prepare a quantum state for a given classical description of the quantum state. The classical description of an $n$-qubit quantum state may have $\exp(O(n))$…
We demonstrate how insights gained from reformulating the problem of quantum teleportation into one of reversing quantum operations, and designing optimum completely positive maps for teleportation, can enable one to explore optimal…
Teleportation for pure states, mixed states with standard and optimal protocols are introduced and investigated systematically. An explicit equation governing the teleportation of finite dimensional quantum pure states by a generally given…
We present a quantum algorithm to prepare injective PEPS on a quantum computer, a class of open tensor networks representing quantum states. The run-time of our algorithm scales polynomially with the inverse of the minimum condition number…
Standard one-way quantum computers (1WQC) combine time symmetric unitary evolution, with asymmetric treatment of boundaries: state preparation allows to enforce a chosen initial state, however, for the final state measurement chooses a…
Universal quantum computation using optical coherent states is studied. A teleportation scheme for a coherent-state qubit is developed and applied to gate operations. This scheme is shown to be robust to detection inefficiency.
The preparation of the ground state of a Hamiltonian $H$ with a large spectral radius has applications in many areas such as electronic structure theory and quantum field theory. Given an initial state with a constant overlap with the…