相关论文: Quantifying magic via quantum $(\alpha,\beta)$ Jen…
We argue from the point of view of statistical inference that the quantum relative entropy is a good measure for distinguishing between two quantum states (or two classes of quantum states) described by density matrices. We extend this…
Magic states can be used as a resource to circumvent the restrictions due to stabilizer-preserving operations, and magic-state conversion has not been studied in the single-copy regime thus far. Here we solve the question of whether a…
Universal quantum computers require entanglement and non-stabilizerness, a resource known as \textit{quantum magic}. Here, we introduce a protocol that prepares magic steady states by leveraging non-Hermitian dynamics, which, contrary to…
A careful reexamination of the quantization of systems with first- and second-class constraints from the point of view of coherent-state phase-space path integration reveals several significant distinctions from more conventional…
Magic states are essential yet resource-intensive components for realizing universal fault-tolerant quantum computation. Preparing magic states within emerging quantum low-density parity-check (qLDPC) codes poses additional challenges, due…
A quantum mechanical theory is proposed which abandons an external parameter ``time'' in favor of a self-adjoint operator on a Hilbert space whose elements represent measurement events rather than system states. The standard quantum…
We present a description of finite dimensional quantum entanglement, based on a study of the space of all convex decompositions of a given density matrix. On this space we construct a system of real polynomial equations describing separable…
We present a canonical quantization framework for static spherically symmetric spacetimes described by the Einstein-Hilbert action with a cosmological constant. In addition to recovering the classical Schwarzschild-(Anti)-de Sitter…
Quantum magic, quantified by nonstabilizerness, measures departures from stabilizer structure and underlies potential quantum speedups. We introduce an efficient classical framework for computing stabilizer R\'enyi entropies and stabilizer…
The coherence of an individual quantum state can be meaningfully discussed only when referring to a preferred basis. This arbitrariness can however be lifted when considering sets of quantum states. Here we introduce the concept of set…
We show that every quantum computation can be described by Bayesian update of a probability distribution on a finite state space. When applied to the model of quantum computation with magic states, the size of this state space only depends…
This paper is a review of our recent work on three notorious problems of non-relativistic quantum mechanics: realist interpretation, quantum theory of classical properties and the problem of quantum measurement. A considerable progress has…
In quantum games based on 2-player--$N$-strategies classical games, each player has a quNit (a normalized vector in an $N$-dimensional Hilbert space ${\cal H}_N$) upon which he applies his strategy (a matrix $U \in$ SU(N)). The players draw…
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…
Quantum computing algorithms require that the quantum register be initially present in a superposition state. To achieve this, we consider the practical problem of creating a coherent superposition state of several qubits. Owing to…
In quantum Shannon theory, various kinds of quantum entropies are used to characterize the capacities of noisy physical systems. Among them, min-entropy and its smooth version attract wide interest especially in the field of quantum…
We consider a recently introduced framework for the description of memory effects based on quantum state distinguishability quantifiers, in which entropic quantifiers can be included. After briefly presenting the approach, we validate it…
Geometric quantization is a natural way to construct quantum models starting from classical data. In this work, we start from a symplectic vector space with an inner product and -- using techniques of geometric quantization -- construct the…
We propose an approach for quantifying a quantum circuit's quantumness as a means to understand the nature of quantum algorithmic speedups. Since quantum gates that do not preserve the computational basis are necessary for achieving quantum…
Some quantum algorithms have "quantum speedups": improved time complexity as compared with the best-known classical algorithms for solving the same tasks. Can we understand what fuels these speedups from an entropic perspective? Information…