相关论文: Classical simulation versus universality in measur…
In this paper, we address the problem how to represent a classical data distribution in a quantum system. The proposed method is to learn quantum Hamiltonian that is such that its ground state approximates the given classical distribution.…
This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states and their applications in computing, networking, and sensing.…
Quantum-enhanced machine learning is a rapidly evolving field that aims to leverage the unique properties of quantum mechanics to enhance classical machine learning. However, the practical applicability of these methods remains an open…
Quantum state estimation, based on the numerical integration of stochastic master equations (SMEs), provides estimates for the evolution of quantum systems subject to continuous weak measurements. The approach is similar to classical state…
Characterization of quantum systems from experimental data is a central problem in quantum science and technology. But which measurements should be used to gather data in the first place? While optimal measurement choices can be worked out…
In this report we are aiming at introducing a global measure of non-classicality of the state space of $N$-level quantum systems and estimating it in the limit of large $N$. For this purpose we employ the Wigner function negativity as a…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
Can complex classical systems be designed to exhibit superpositions of tensor products of basis states, thereby mimicking quantum states? We exhibit a one-to one map between the product basis of quantum states comprising an arbitrary number…
We present a classical protocol, using the matrix product state representation, to simulate cluster-state quantum computation at a cost polynomial in the number of qubits in the cluster and exponential in d -- the width of the cluster. We…
Classical simulation of quantum circuits is a critical tool for validating quantum hardware and probing the boundary between classical and quantum computational power. Existing state-of-the-art methods, notably tensor network approaches,…
In a previous paper, a project of constructing quantum models of classical properties has been started. The present paper concludes the project by turning to classical mechanics. The quantum states that maximize entropy for given averages…
We have shown that quantum systems on finite-dimensional Hilbert spaces are equivalent under local transformations. Using these transformations give rise to a gauge group that connects the hamiltonian operators associated with each quantum…
Quantum advantage in computation refers to the existence of computational tasks that can be performed efficiently on a quantum computer but cannot be efficiently simulated on any classical computer. Identifying the precise boundary of…
Quantum tomography is a process of quantum state reconstruction using data from multiple measurements. An essential goal for a quantum tomography algorithm is to find measurements that will maximize the useful information about an unknown…
Quantum instruments describe both the classical output and the updated quantum state in a measurement process. To do this in a non-trivial way, instruments must have the capability to interact coherently with the state that they measure.…
The Gottesman-Knill theorem states that a Clifford circuit acting on stabilizer states can be simulated efficiently on a classical computer. Recently, this result has been generalized to cover inputs that are close to a coherent…
We show the following: a randomly chosen pure state as a resource for measurement-based quantum computation, is - with overwhelming probability - of no greater help to a polynomially bounded classical control computer, than a string of…
Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. We first show that robustness of magic is a well-behaved magic monotone that operationally quantifies the…
In this paper, we introduce a technique for contracting (i.e. numerically evaluating) ZX-diagrams whose complexity scales with their rank-width, a graph parameter that behaves nicely under ZX rewrite rules. Given a rank-decomposition of…
In this paper we propose a general method to quantify how "quantum" a set of quantum states is. The idea is to gauge the quantumness of the set by the worst-case difficulty of transmitting the states through a purely classical communication…