Related papers: State complexity and quantum computation
Determining the state of a quantum system is a consuming procedure. For this reason, whenever one is interested only in some particular property of a state, it would be desirable to design a measurement setup that reveals this property with…
Quantum entanglement is widely recognized as one of the key resources for the advantages of quantum information processing, including universal quantum computation, reduction of communication complexity or secret key distribution. However,…
We investigate unitary and state $t$-designs from a computational complexity perspective. First, we address the problems of computing frame potentials that characterize (approximate) $t$-designs. We present a quantum algorithm for computing…
We consider quantum metrology with several copies of bipartite and multipartite quantum states. We characterize the metrological usefulness by determining how much the state outperforms separable states. We identify a large class of…
The aim of this work is to study the physical properties of a one-way quantum computer in an effective low-energy cluster state. We calculate the optimal working conditions as a function of the temperature and of the system parameters. The…
The usefulness of the recent experimentally realized six photon cluster state by C. Y. Lu et al. (2007, Nature {3} {91}), is investigated for quantum communication protocols like teleportation, quantum information splitting (QIS), remote…
We initiate a study of the complexity of quantum field theories (QFTs) by proposing a measure of information contained in a QFT and its observables. We show that from minimal assertions, one is naturally led to measure complexity by two…
Characterizing large quantum systems with minimal assumptions is a central challenge in quantum information science. Self-testing provides the strongest form of certification by identifying the underlying quantum state solely from observed…
Classical-quantum computational complexity separations are an important motivation for the long-term development of digital quantum computers, but classical-quantum complexity equivalences are just as important in our present era of noisy…
We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its…
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…
A complementarity relation is established between the capacity of multiport classical information transmission via quantum states and multiparty quantum correlation measures for three-qubit pure states. The multiparty quantum correlation…
Quantum discord, a kind of quantum correlation based on entropic measures, is defined as the difference between quantum mutual information and classical correlation in a bipartite system. Procedures are available for analytical calculation…
Quantum state tomography (QST) is crucial for understanding and characterizing quantum systems through measurement data. Traditional QST methods face scalability challenges, requiring $\mathcal{O}(d^2)$ measurements for a general…
We show that the quantum measurement known as the pretty good measurement can be used to identify an unknown quantum state picked from any set of $n$ mixed states that have pairwise fidelities upper-bounded by a constant below 1, given…
In the decision tree computation model for Boolean functions, the depth corresponds to query complexity, and size corresponds to storage space. The depth measure is the most well-studied one, and is known to be polynomially related to…
We examine the possible states of subsystems of a system of bits or qubits. In the classical case (bits), this means the possible marginal distributions of a probability distribution on a finite number of binary variables; we give necessary…
Highly entangled states called cluster states are a universal resource for measurement-based quantum computing (QC). Here we propose an efficient method for producing large cluster states using superconducting quantum circuits. We show that…
Can the state-space of $d$-dimensional quantum theory be derived from studying the behavior of a single "reference" measuring device? The answer is yes, if the measuring device corresponds to a complex-projective 3-design. In this…
Consider a bipartite quantum system with at least one of its two components being itself a composite system. By tracing over part of one (or both) of these two subsystems it is possible to obtain a reduced (separable) state that exhibits…