Related papers: Interactive Proofs for Synthesizing Quantum States…
The rapid development of quantum computing technologies already made it possible to manipulate a collective state of several dozen of qubits. This success poses a strong demand on efficient and reliable methods for characterization and…
Efficient verification of entangled states is crucial to many applications in quantum information processing. However, the effectiveness of standard quantum state verification (QSV) is based on the condition of independent and identical…
In recent years, the entanglement spectra of quantum states have been identified to be highly valuable for improving our understanding on many problems in quantum physics, such as classification of topological phases, symmetry-breaking…
A symmetry of a state $\vert \psi \rangle$ is a unitary operator of which $\vert \psi \rangle$ is an eigenvector. When $\vert \psi \rangle$ is an unknown state supplied by a black-box oracle, the state's symmetries provide key physical…
The maximum-likelihood principle unifies inference of quantum states and processes from experimental noisy data. Particularly, a generic quantum process may be estimated simultaneously with unknown quantum probe states provided that…
This article is an introduction to quant-ph/0302092. We propose to quantify how "quantum" a set of quantum states is. The quantumness of a set is the worst-case difficulty of transmitting the states through a classical communication…
We consider the transformations of quantum states obtainable by a process of the following sort. Combine the given input state with a specially prepared initial state of an auxiliary system. Apply a unitary transformation to the combined…
We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the…
The usual way to reveal properties of an unknown quantum state, given many copies of a system in that state, is to perform measurements of different observables and to analyze the measurement results statistically. Here we show that the…
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The first variant is one in which the verifier sends a short…
We introduce a general mapping for encoding quantum communication protocols involving pure states of multiple qubits, unitary transformations, and projective measurements into another set of protocols that employ coherent states of light in…
Quantum simulators are controllable quantum systems that can reproduce the dynamics of the system of interest, which are unfeasible for classical computers. Recent developments in quantum technology enable the precise control of individual…
Coherence and entanglement are fundamental properties of quantum systems, promising to power the near future quantum computers, sensors and simulators. Yet, their experimental detection is challenging, usually requiring full reconstruction…
The existence of incompatible measurements, epitomized by Heisenberg's uncertainty principle, is one of the distinctive features of quantum theory. So far, quantum incompatibility has been studied for measurements that test the preparation…
The relation between entanglement entropy and the computational difficulty of classically simulating Quantum Mechanics is briefly reviewed. Matrix product states are proven to provide an efficient representation of one-dimensional quantum…
Multi Prover Interactive Proof systems (MIPs)were first presented in a cryptographic context, but ever since they were used in various fields. Understanding the power of MIPs in the quantum context raises many open problems, as there are…
Cloud computing platforms have created the possibility for computationally limited users to delegate demanding tasks to strong but untrusted servers. Verifiable computing algorithms help build trust in such interactions by enabling the…
State preparation protocols ideally require as minimal operations as possible, in order to be implemented in near-term, potentially noisy quantum devices. Motivated by long range interactions (LRIs) intrinsic to many present-day…
In this perspective we discuss verification of quantum devices in the context of specific examples, formulated as proposed experiments. Our first example is verification of analog quantum simulators as Hamiltonian learning, where the input…
Coherent superpositions are one of the hallmarks of quantum mechanics and are vital for any quantum mechanical device to outperform the classically achievable. Generically, superpositions are verified in interference experiments, but…