Related papers: How difficult is it to prepare a quantum state?
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…
In quantum teleportation, an unknown quantum state is transmitted from one party to another using only local operations and classical communication, at the cost of shared entanglement. Is it possible similarly, using an $N$ party entangled…
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…
Loading classical data into quantum registers is one of the most important primitives of quantum computing. While the complexity of preparing a generic quantum state is exponential in the number of qubits, in many practical tasks the state…
State transformation problems such as compressing quantum information or breaking quantum commitments are fundamental quantum tasks. However, their computational difficulty cannot easily be characterized using traditional complexity theory,…
Characterizing the quantum complexity of local random quantum circuits is a very deep problem with implications to the seemingly disparate fields of quantum information theory, quantum many-body physics and high energy physics. While our…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
Quantum Amplitude Estimation (QAE) can achieve a quadratic speed-up for applications classically solved by Monte Carlo simulation. A key requirement to realize this advantage is efficient state preparation. If state preparation is too…
If we want to transform the quantum state of a system to another using local measurement processes, what is the probability of success? This probability is bounded by quantifying entanglement in both the states. In this paper, we construct…
The use of geometric methods has proved useful in the hamiltonian description of classical constrained systems. In this note we provide the first steps toward the description of the geometry of quantum constrained systems. We make use of…
Quantifying and verifying the control level in preparing a quantum state are central challenges in building quantum devices. The quantum state is characterized from experimental measurements, using a procedure known as tomography, which…
Quantum protocols often require the generation of specific quantum states. We describe a quantum algorithm for generating any prescribed quantum state. For an important subclass of states, including pure symmetric states, this algorithm is…
Quantifying the energetic cost of implementing quantum operations is essential for assessing the efficiency and scalability of quantum sensing and information-processing technologies. Here, we introduce a framework for analysing the…
This work presents a study of Kolmogorov complexity for general quantum states from the perspective of deterministic-control quantum Turing Machines (dcq-TM). We extend the dcq-TM model to incorporate mixed state inputs and outputs, and…
Manipulating quantum systems undergoing non-Gaussian dynamics in a fast and accurate manner is becoming fundamental to many quantum applications. Here, we focus on classical and quantum protocols transferring a state across a double-well…
We address the question of how a quantum computer can be used to simulate experiments on quantum systems in thermal equilibrium. We present two approaches for the preparation of the equilibrium state on a quantum computer. For both…
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 protocol based on coherent states and linear optics operations for solving the appointment-scheduling problem. Our main protocol leaks strictly less information about each party's input than the optimal classical protocol, even…
Quantum state tomography is the standard tool in current experiments for verifying that a state prepared in the lab is close to an ideal target state, but up to now there were no rigorous methods for evaluating the precision of the state…
Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and…