Related papers: Interactive Proofs for Synthesizing Quantum States…
Certifying entanglement for unknown quantum states experimentally is a fundamental problem in quantum computing and quantum physics. Because of being easy to implement, a most popular approach for this problem in modern quantum experiments…
Pseudorandom quantum states (PRSs) and pseudorandom unitaries (PRUs) possess the dual nature of being efficiently constructible while appearing completely random to any efficient quantum algorithm. In this study, we establish fundamental…
Given a mixture of states, finding a way to optimally discriminate its elements is a prominent problem in quantum communication theory. In this paper, we will address mixtures of density operators that are unitarily equivalent via elements…
We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly…
Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme's validity via the probability that…
We present a classical interactive protocol that verifies the validity of a quantum witness state for the local Hamiltonian problem. It follows from this protocol that approximating the non-local value of a multi-player one-round game to…
Quantum information technologies provide promising applications in communication and computation, while machine learning has become a powerful technique for extracting meaningful structures in 'big data'. A crossover between quantum…
Significant advances in the development of computing devices based on quantum effects and the demonstration of their use to solve various problems have rekindled interest in the nature of the "quantum computational advantage." Although…
With today's quantum processors venturing into regimes beyond the capabilities of classical devices [1-3], we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
Entanglement lies at the heart of quantum information science, serving as a key resource for quantum communication, computation, and metrology. Consequently, high-precision entangled state preparation and efficient verification are…
We propose a probabilistic quantum protocol to realize a nonlinear transformation of qutrit states, which by iterative applications on ensembles can be used to distinguish two types of pure states. The protocol involves single-qutrit and…
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation…
For a given pure state of a composite quantum system we analyze the product of its projections onto a set of locally orthogonal separable pure states. We derive a bound for this product analogous to the entropic uncertainty relations. For…
In this article we extend results from our previous work [Bendersky, de la Torre, Senno, Figueira and Ac\'in, Phys. Rev. Lett. 116, 230406 (2016)] by providing a protocol to distinguish in finite time and with arbitrarily high success…
Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum…
State preparation is a process encoding the classical data into the quantum systems. Based on quantum phase estimation, we propose the specific quantum circuits for a deterministic state preparation algorithm and a probabilistic state…
Quantum multiprover interactive proof systems with entanglement MIP* are much more powerful than its classical counterpart MIP (Babai et al. '91, Ji et al. '20): while MIP = NEXP, the quantum class MIP* is equal to RE, a class including the…
Quantum signal processing (QSP) is a framework which was proven to unify and simplify a large number of known quantum algorithms, as well as discovering new ones. QSP allows one to transform a signal embedded in a given unitary using…
The perturbative consistency of coherent states within interacting quantum field theory requires them to be altered beyond the simple non-squeezed form. Building on this point, we perform explicit construction of consistent squeezed…