相关论文: Complexity of quantum states in the stabilizer for…
The notion of complexity of quantum states is quite different from uncertainty or information contents, and involves the tradeoff between its classical and quantum features. In this work, we we introduce a quantifier of complexity of…
Universal quantum computing requires nonstabilizer (magic) quantum states. Quantifying the nonstabilizerness and relating it to other quantum resources is vital for characterizing the complexity of quantum many-body systems. In this work,…
Two classically equivalent expressions of mutual information of probability distributions (classical bipartite states) diverge when extended to quantum systems, and this difference has been employed to define quantum discord, a quantifier…
We introduce a quantifier of phase-space complexity for discrete-variable (DV) quantum systems. Motivated by a recent framework developed for continuous-variable systems, we construct a complexity measure of quantum states based on the…
An extension to computational mechanics complexity measure is proposed in order to tackle quantum states complexity quantification. The method is applicable to any $n-$partite state of qudits through some simple modifications. A Werner…
The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman-Knill theorem.…
The complexity of the quantum state of a multiparticle system and the maximum possible accuracy of its quantum description are connected by a relation similar to the coordinate-momentum uncertainty relation. The coefficient in this relation…
Quantum complexity quantifies the difficulty of preparing a state or implementing a unitary transformation with limited resources. Applications range from quantum computation to condensed matter physics and quantum gravity. We seek to…
This is a short review on an interdisciplinary field of quantum information science and statistical mechanics. We first give a pedagogical introduction to the stabilizer formalism, which is an efficient way to describe an important class of…
We propose a measure of quantum state complexity defined by minimizing the spread of the wave-function over all choices of basis. Our measure is controlled by the "survival amplitude" for a state to remain unchanged, and can be efficiently…
The statistical complexity of continuous-variable quantum states can be characterized with a quantifier defined in terms of information-theoretic quantities derived from the Husimi Q-function. In this work, we utilize this complexity…
The stabilizer formalism is a scheme, generalizing well-known techniques developed by Gottesman [quant-ph/9705052] in the case of qubits, to efficiently simulate a class of transformations ("stabilizer circuits", which include the quantum…
Based on the {\it nonlinear coherent states} method, a general and simple algebraic formalism for the construction of \textit{`$f$-deformed intelligent states'} has been introduced. The structure has the potentiality to apply to systems…
Despite the exponential overhead to describe general multi-qubit quantum states and processes, efficient methods for certain state families and operations have been developed and utilised. The stabilizer formalism and the Gottesman-Knill…
State conversion generalizes query complexity to the problem of converting between two input-dependent quantum states by making queries to the input. We characterize the complexity of this problem by introducing a natural…
We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We discuss the possibility for such transitions…
Quantifying the complexity of quantum states is a longstanding key problem in various subfields of science, ranging from quantum computing to the black-hole theory. The lower bound on quantum pure state complexity has been shown to grow…
Quantification of coherence lies at the heart of quantum information processing and fundamental physics. Exact evaluation of coherence measures generally needs a full reconstruction of the density matrix, which becomes intractable for…
There are at least a number of ways to formally define complexity. Most of them relate to some kind of minimal description of the studied object. Being this one in form of minimal resources of minimal effort needed to generate the object…
Vast developments in quantum technology have enabled the preparation of quantum states with more than a dozen entangled qubits. The full characterization of such systems demands distinct constructions depending on their specific type and…