Related papers: Kirkwood-Dirac Nonpositivity is a Necessary Resour…

Quasiprobability representations are well-established tools in quantum information science, with applications ranging from the classical simulability of quantum computation to quantum process tomography, quantum error correction, and…

A recently introduced classical simulation method for universal quantum computation with magic states operates by repeated sampling from probability functions [M. Zurel et al. PRL 260404 (2020)]. This method is closely related to sampling…

We introduce a classical-quantum hybrid approach to computation, allowing for a quadratic performance improvement in the decision process of a learning agent. In particular, a quantum routine is described, which encodes on a quantum…

We provide an in-depth study of the recently introduced notion of completely incompatible observables and its links to the support uncertainty and to the Kirkwood-Dirac nonclassicality of pure quantum states. The latter notion has recently…

Classical shadows are a computationally efficient approach to storing quantum states on a classical computer for the purposes of estimating expectation values of local observables, obtained by performing repeated random measurements. In…

Any quasi-probability representation of a no-signaling system -- including quantum systems -- can be simulated via a purely classical scheme by allowing signed events and a cancellation procedure. This raises a fundamental question: What…

Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…

We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted.…

We develop a framework for simulating measure-preserving, ergodic dynamical systems on a quantum computer. Our approach provides a new operator-theoretic representation of classical dynamics by combining ergodic theory with quantum…

An issue which has attracted increasing attention in contemporary researches are Kirkwood--Dirac quasiprobabilities. List of their use includes many questions of quantum physics. Applications of complex tight frames in quantum information…

Near-term quantum processors are limited in terms of the number of qubits and gates they can afford. They nevertheless give unprecedented access to programmable quantum systems that can efficiently, although imperfectly, simulate quantum…

Quantum materials exhibit a wide array of exotic phenomena and practically useful properties. A better understanding of these materials can provide deeper insights into fundamental physics in the quantum realm as well as advance technology…

Machine learning techniques have led to broad adoption of a statistical model of computing. The statistical distributions natively available on quantum processors are a superset of those available classically. Harnessing this attribute has…

A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. The Ising spins can represent macroscopic two-level…

In continuous-variable quantum computation, identifying key elements that enable a quantum computational advantage is a long-standing issue. Starting from the standard results on the necessity of Wigner negativity, we develop a…

Adiabatic transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialised state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible.…

A strong analog classical simulation of general quantum evolution is proposed, which serves as a novel scheme in quantum computation and simulation. The scheme employs the approach of geometric quantum mechanics and quantum informational…

Portfolio construction has been a long-standing topic of research in finance. The computational complexity and the time taken both increase rapidly with the number of investments in the portfolio. It becomes difficult, even impossible for…

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…

Accelerating computational tasks with quantum resources is a widely-pursued goal that is presently limited by the challenges associated with high-fidelity control of many-body quantum systems. The paradigm of reservoir computing presents an…