Related papers: Approximate k-uniform states: definition, construc…
We study remote creation of coherence (RCC) for a quantum system, A, with the help of quantum operations on another system, B, and one-way classical communication.We show that all the nonincoherent quantum states are useful for RCC and all…
Most states in the Hilbert space are maximally entangled. This fact has proven useful to investigate - among other things - the foundations of statistical mechanics. Unfortunately, most states in the Hilbert space of a quantum many body…
A fundamental question asks how uniformly finite sets of pure quantum states can be distributed in a Hilbert space. The Welch bounds address this question, and are saturated by $k$-designs, i.e. sets of states reproducing the $k$-th Haar…
Pseudorandom quantum states (PRS) are efficiently constructible states that are computationally indistinguishable from being Haar-random, and have recently found cryptographic applications. We explore new definitions, new properties and…
The Dicke state $|D_k^n\rangle$ is an equal-weight superposition of all $n$-qubit states with Hamming Weight $k$ (i.e. all strings of length $n$ with exactly $k$ ones over a binary alphabet). Dicke states are an important class of entangled…
Complex numbers are central to the formulation of quantum mechanics, yet their role as a genuine resource is only beginning to be understood. In this work, we demonstrate that quantum states with intrinsically complex amplitudes provide a…
One of the simplest and most effective classical machine learning algorithms is the $k$-nearest neighbors algorithm ($k$NN) which classifies an unknown test state by finding the $k$ nearest neighbors from a set of $M$ train states. Here we…
We investigate which quantum states can serve as universal resources for approximate and stochastic measurement-based quantum computation, in the sense that any quantum state can be generated from a given resource by means of single-qubit…
Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits are described via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that…
Classical computation of electronic properties in large-scale materials remains challenging. Quantum computation has the potential to offer advantages in memory footprint and computational scaling. However, general and practical quantum…
We propose a compositional approach to construct subspaces consisting entirely of r-uniform states, including the ones in heterogeneous systems. The approach allows one to construct new objects from old ones: it combines encoding isometries…
Measurement-based quantum computation describes a scheme where entanglement of resource states is utilized to simulate arbitrary quantum gates via local measurements. Recent works suggest that symmetry-protected topologically non-trivial,…
It has been recently shown that a state generated by a one-dimensional noisy quantum computer is well approximated by a matrix product operator with a finite bond dimension independent of the number of qubits. We show that full quantum…
In the present paper I formulate a framework that accommodates many unambiguous discrimination problems. I show that the prior information about any type of constituent (state, channel, or observable) allows us to reformulate the…
Kirkwood-Dirac (KD) quasiprobability is a quantum analog of phase space probability of classical statistical mechanics, allowing negative or/and nonreal values. It gives an informationally complete representation of a quantum state. Recent…
Quantifying and verifying the control level in preparing a quantum state are central challenges in building quantum devices. The quantum state is characterized from experimental measurements, using a procedure known as tomography, which…
Quantum many-body systems display an extraordinary degree of complexity, yet many of their features are universal: they depend not on microscopic details, but on a few fundamental physical aspects such as symmetries. A central challenge is…
We introduce $k$-local quasi-quantum states: a superset of the regular quantum states, defined by relaxing the positivity constraint. We show that a $k$-local quasi-quantum state on $n$ qubits can be 1-1 mapped to a distribution of…
Local random circuits scramble efficiently and accordingly have a range of applications in quantum information and quantum dynamics. With a global $U(1)$ charge however, the scrambling ability is reduced; for example, such random circuits…
Pseudorandom unitaries (PRUs), one of the key quantum pseudorandom notions, are efficiently computable unitaries that are computationally indistinguishable from Haar random unitaries. While there is evidence to believe that PRUs are weaker…