相关论文: Complexity of quantum states in the stabilizer for…
We explore set-stabilizability by constrained controls, and both controllability and stabilizability can be regarded as the special case of set-stabilizability. We not only clarify how to define an equilibrium point of Schr$\ddot{o}$dinger…
We define a new quantifier of classicality for a quantum state, the Roughness, which is given by the $\mathcal{L}^2 (\R^2)$ distance between Wigner and Husimi functions. We show that the Roughness is bounded and therefore it is a useful…
Non-classical probability (along with its underlying logic) is a defining feature of quantum mechanics. A formulation that incorporates them, inherently and directly, would promise a unified description of seemingly different prescriptions…
We relate a large class of classical spin models, including the inhomogeneous Ising, Potts, and clock models of q-state spins on arbitrary graphs, to problems in quantum physics. More precisely, we show how to express partition functions as…
Perturbation theories provide valuable insights on quantum many-body systems. Systems of interacting particles, like electrons, are often treated perturbatively around exactly solvable Gaussian points. Systems of interacting qubits have…
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…
Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum…
Analytical complexity of quantum wavefunction whose argument is extended into the complex plane provides an important information about the potentiality of manifesting complex quantum dynamics such as time-irreversibility, dissipation and…
We implement the so-called Weyl-Heisenberg covariant integral quantization in the case of a classical system constrained by a bounded or semi-bounded geometry. The procedure, which is free of the ordering problem of operators, is…
We define predictive states and predictive complexity for quantum systems composed of distinct subsystems. This complexity is a generalization of entanglement entropy. It is inspired by the statistical or forecasting complexity of…
We advance the characterization of complexity in quantum many-body systems by examining $W$-states embedded in a spin chain. Such states show an amount of non-stabilizerness or "magic" (measured as the Stabilizer R\'enyi Entropy -SRE-) that…
Quantum complexity measures the difficulty of obtaining a given state starting from a typically unentangled state. In this work, we show that complexity, when defined through the minimization of a Riemannian cost functional over the…
A formalism for the construction of some classes of Gazeau$-$Klauder squeezed states, corresponding to arbitrary solvable quantum systems with a known discrete spectrum, are introduced. As some physical applications, the proposed structure…
The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the…
In quantum physics, the density operator completely describes the state. Instead, in classical physics the mean value of every physical quantity is evaluated by means of a probability distribution. We study the possibility to describe pure…
We present a general formalism for studying the effects of dynamical heterogeneity in open quantum systems. We develop this formalism in the state space of density operators, on which ensembles of quantum states can be conveniently…
We study the behaviour of two different measures of the complexity of multipartite correlation patterns, weaving and neural complexity, for symmetric quantum states. Weaving is the weighted sum of genuine multipartite correlations of any…
In the realm of fault-tolerant quantum computing, stabilizer operations play a pivotal role, characterized by their remarkable efficiency in classical simulation. This efficiency sets them apart from non-stabilizer operations within the…
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such universal quantum circuits, and characterize them by…
The question of witnessing or quantifying nonclassicality of quantum systems has been addressed in various ways. For a given system or theory, we propose identifying it with the incompatibility of admissible states. We quantify the…