We show that universal quantum computation can be achieved in the standard pure-state circuit model while the entanglement entropy of every bipartition is small in each step of the computation. The entanglement entropy required for large-scale quantum computation even tends to zero. Moreover we show that the same conclusion applies to many entanglement measures commonly used in the literature. This includes e.g., the geometric measure, localizable entanglement, multipartite concurrence, squashed entanglement, witness-based measures, and more generally any entanglement measure which is continuous in a certain natural sense. These results demonstrate that many entanglement measures are unsuitable tools to assess the power of quantum computers.
We show that universal quantum computation can be achieved in the standard pure-state circuit model while the entanglement entropy of every bipartition is small in each step of the computation. The entanglement entropy required for large-scale quantum computation even tends to zero. Moreover we show that the same conclusion applies to many entanglement measures commonly used in the literature. This includes e.g., the geometric measure, localizable entanglement, multipartite concurrence, squashed entanglement, witness-based measures, and more generally any entanglement measure which is continuous in a certain natural sense. These results demonstrate that many entanglement measures are unsuitable tools to assess the power of quantum computers.
The paper is an elaborate comparative assessment of the most relevant entropy-based quantities to be applied in quantifying quantum entanglement in pure, mixed, bipartite, and multipartite quantum systems. The study fills the existing gap in the literature in which most of the previous literature examines individual measures, but a lot of knowledge is lacking on what these measures are regarding their strengths, weaknesses, and the operational usefulness against each other. The study can prove the behaviour of each measure under noise, decoherence, dimensional scaling, and variation of state-type by analysing von Neumann entropy, the Tsallis entropy, entropy of entanglement of formation, concurrence and logarithmic negativity. Numerical studies with pure two-qubit states, Werner states, GHZ states, W states and mixed random states demonstrate specific sensitivity properties and computational limitations which ensure that no single measure can be a universal quantifier. The paper goes on to say that entropy-only measures do not work in mixed regimes because of a dominance in classical correlations. The results have several important implications to quantum communication, quantum simulation, and quantum computing in the NISQ-era, where the choice of measurement has a direct impact on benchmarking, error-correction scheme, and protocol performance based on entanglement. The paper ends with a recommendation of contextual, purpose-based scheme of selecting entanglement measures and suggests a further study on scalable benchmarking, hybrid quantifiers, and operational performance-based entanglement measurements. These observations reinforce the theoretical premise of entanglement studies and enable the advancement of more effective quantum technologies in the field of practice.
The ``power of one qubit'' refers to a computational model that has access to only one pure bit of quantum information, along with n qubits in the totally mixed state. This model, though not as powerful as a pure-state quantum computer, is capable of performing some computational tasks exponentially faster than any known classical algorithm. One such task is to estimate with fixed accuracy the normalized trace of a unitary operator that can be implemented efficiently in a quantum circuit. We show that circuits of this type generally lead to entangled states, and we investigate the amount of entanglement possible in such circuits, as measured by the multiplicative negativity. We show that the multiplicative negativity is bounded by a constant, independent of n, for all bipartite divisions of the n+1 qubits, and so becomes, when n is large, a vanishingly small fraction of the maximum possible multiplicative negativity for roughly equal divisions. This suggests that the global nature of entanglement is a more important resource for quantum computation than the magnitude of the entanglement.
It is often argued that entanglement is at the root of the speedup for quantum compared to classical computation, and that one needs a sufficient amount of entanglement for this speedup to be manifest. In measurement-based quantum computing, the need for a highly entangled initial state is particularly obvious. Defying this intuition, we show that quantum states can be too entangled to be useful for the purpose of computation, in that high values of the geometric measure of entanglement preclude states from offering a universal quantum computational speedup. We prove that this phenomenon occurs for a dramatic majority of all states: the fraction of useful n-qubit pure states is less than exp(-n;{2}). This work highlights a new aspect of the role entanglement plays for quantum computational speedups.
Abstract Quantum entanglement and quantum entropy are crucial concepts in the study of multipartite quantum systems. In this work, we show how the notion of concurrence vector, re-expressed in a particularly useful form, provides new insights and computational tools for the analysis of both. In particular, using this approach for a general multipartite pure state, one can easily prove known relations in an easy way and to build up new relations between the concurrences associated with the different bipartitions. The approach is also useful to derive sufficient conditions for genuine entanglement in generic multipartite systems that are computable in polynomial time. From an entropy-of-entanglement perspective, the approach is powerful to prove properties of the Tsallis-2 entropy, such as the subadditivity, and to derive new ones, e.g., a modified version of the strong subadditivity which is always fulfilled; thanks to the purification theorem these results hold for any multipartite state, whether pure or mixed.
Our understanding of physical phenomena hinges on finding universal core mechanisms that unite them. The concept of universality is deeply ingrained in the study of quantum many-body systems. At zero temperature, microscopically different systems with long-range order collapse into their universal state described by a handful of universal parameters. Establishing those parameters implies identification of the universal theory that is effectively describing the system and ultimately providing the desired understanding. We take up this task with the help of Renyi entanglement entropy. Defined with respect to a system bipartition, this measure quantifies information shared between the subsystems. Understanding what insights into universality are encoded within this information-theoretic quantity as well as developing numerical tools to efficiently estimate the Renyi entanglement entropy are the subjects of this thesis. \n \nOn the computational end of this far-reaching goal, we develop a novel theoretical framework for constructing improved Renyi entanglement entropy estimators in the context of d+1 quantum Monte Carlo methods. The discovery of a connection of this methodology to the well-established Kandel-Domany formalism provides a clear path towards generalization. Additionally, we embrace a data-driven approach towards learning the ground state wavefunction. We demonstrate how a restricted Boltzmann machine can be used to reconstruct the Renyi entanglement entropy from projective measurements of a quantum ground state. Furthermore, we extend this classical generative architecture to a quantum analogue that we call the quantum Boltzmann machine. \n \nOn the theoretical side of this endeavour, we study the Renyi entanglement entropy scaling terms for two quantum lattice models embedded in two dimensional space via extensive quantum Monte Carlo simulations. For the ground state of the XY model, we provide conclusive numerical evidence for a logarithmic contribution that uniquely characterizes the continuous symmetry of the emerging order parameter. Moreover, we confirm the form of the subleading universal geometric contribution arising due to the bosonic nature of low-energy degrees of freedom in this model. For the critical ground state of the transverse field Ising model, we develop a novel scaling procedure to extract a universal number κ revealed via a cylindrical entangling bipartition in the thin-slice limit. The combined product of our work sheds new light on the entanglement-based classification of universality and brings a suite of new powerful numerical tools to continue illuminating this theoretical program in the future.
This paper investigates the critical role of entanglement entropy measurement in advancing quantum computing. We propose a novel methodology for precisely quantifying entanglement entropy within quantum systems, recognizing its significance as a key performance indicator for assessing both the quality and scalability of quantum algorithms and hardware. The core of the work focuses on developing a high-precision and efficient measurement technique, addressing the current limitations in entanglement entropy characterization. Specifically, we explore methods for minimizing measurement errors and maximizing the information obtained from entanglement entropy measurements. The theoretical framework presented allows for a deeper understanding of how entanglement entropy relates to computational complexity and provides a basis for optimizing quantum algorithms and designing more robust quantum computing architectures. Ultimately, this research contributes to overcoming a significant bottleneck in the field and paves the way for practical, fault-tolerant quantum computation.