Related papers: Port-Based State Preparation and Applications
The holographic principle and its realization in the AdS/CFT correspondence led to unexpected connections between general relativity and quantum information. This set the stage for studying aspects of quantum gravity models, which are…
Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc.…
We introduce a new multipartite communication scheme, with the aim to enable the senders to remotely and obliviously provide the receivers with an arbitrary amount of multipartite entanglement. The scheme is similar to Remote State…
Quantum state preparation, a crucial subroutine in quantum computing, involves generating a target quantum state from initialized qubits. Arbitrary state preparation algorithms can be broadly categorized into arithmetic decomposition (AD)…
We propose a unifying framework for the state preparation using quantum power method algorithms based on generalized quantum signal processing (GQSP). We apply GQSP to realize quantum analogs of classical power iteration, power Lanczos,…
The travelling salesman problem (TSP) is a popular NP-hard-combinatorial optimization problem that requires finding the optimal way for a salesman to travel through different cities once and return to the initial city. The existing methods…
Quantum state preparation is an important class of quantum algorithms that is employed as a black-box subroutine in many algorithms, or used by itself to generate arbitrary probability distributions. We present a novel state preparation…
We propose a modified quantum teleportation scheme to increase the teleportation accuracy by applying a cubic phase gate to the displaced squeezed state. We have described the proposed scheme in Heisenberg's language, evaluating it from the…
We present a scheme for probabilistic teleportation via a non-maximally entangled GHZ state. Quantum teleportation will succeed with a certain probability if the sender makes a generalized Bell state measurement, the cooperator performs a…
An Equivalent Circuit Programming (ECP) approach that expresses the optimality conditions of an optimization problem in terms of an equivalent circuit model and uses circuit simulation techniques to solve for an optimal solution, is applied…
We consider the explicit construction of resource states for measurement-based quantum information processing. We concentrate on special-purpose resource states that are capable to perform a certain operation or task, where we consider…
A fundamental model of quantum computation is the programmable quantum gate array. This is a quantum processor that is fed by a program state that induces a corresponding quantum operation on input states. While being programmable, any…
Global optimization is a challenging problem, with plenty of algorithms displaying empirical success, but scarce theoretical backing. In this work, we propose a new theoretical framework called Proximal Basin Hopping (PBH), carefully…
We examine continuous-variable gate teleportation using entangled states made from pure product states sent through a beamsplitter. We show that such states are Choi states for a (typically) non-unitary gate, and we derive the associated…
Universal compilation is a training process that compiles a trainable unitary into a target unitary and it serves vast potential applications from quantum dynamic simulations to optimal circuits with deep-compressing, device benchmarking,…
We give the analytic expressions of maximal probabilities of successfully controlled teleportating an unknown qubit via every kind of tripartite states. Besides, another kind of localizable entanglement is also determined. Furthermore, we…
We study the probabilistic (conditional) teleportation protocol when the entanglement needed to its implementation is given by thermal entanglement, i.e., when the entangled resource connecting Alice and Bob is an entangled mixed state…
The universal transpose of quantum states is an anti-unitary transformation that is not allowed in quantum theory. In this work, we investigate approximating the universal transpose of quantum states of two-level systems (qubits) using the…
We propose a natural application of Quantum Linear Systems Problem (QLSP) solvers such as the HHL algorithm to efficiently prepare highly excited interior eigenstates of physical Hamiltonians in a variational and targeted manner. This is…
We discuss some properties of the Knill-Laflamme-Milburn scheme for quantum teleportation with both maximally and nonmaximally entangled states. We derive the error correction scheme when one performs teleportation with nonmaximally…