Related papers: A compressed classical description of quantum stat…
Efficient representation of quantum many-body states on classical computers is a problem of enormous practical interest. An ideal representation of a quantum state combines a succinct characterization informed by the system's structure and…
This note presents a quantum protocol for private information retrieval, in the single-server case and with information-theoretical privacy, that has O(\sqrt{n})-qubit communication complexity, where n denotes the size of the database. In…
We consider the problem of testing whether an unknown $n$-qubit quantum state $|\psi\rangle$ is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using $O(n)$ copies, and conversely prove that…
We propose an efficient quantum state tomography method inspired by compressed sensing and threshold quantum state tomography that can drastically reduce the number of measurement settings to reconstruct the density matrix of an $N$-qudit…
We provide a rate distortion interpretation of the problem of quantum data compression of ensembles of mixed states with commuting density operators. There are two versions of this problem. In the visible case the sequence of states is…
Emerging quantum algorithms that process data require that classical input data be represented as a quantum state. These data-processing algorithms often follow the gate model of quantum computing--which requires qubits to be initialized to…
In this paper, we present a direct quantum adaptation of the classical shifted power method. The method is very similar to the iterative phase estimation algorithm; however, it does not require any initial estimate of an eigenvector and as…
We revisit the Pauli-Clifford connection to introduce a real, grade-preserving algebraic framework for $n$-qubit quantum computation based on the tensor product $C\ell_{2,0}(\mathbb{R})^{\otimes n}$. In this setting, the bivector $J =…
Quantum state preparation involving a uniform superposition over a non-empty subset of $n$-qubit computational basis states is an important and challenging step in many quantum computation algorithms and applications. In this work, we…
We consider the explicit construction of resource states for measurement-based quantum information processing. We concentrate on special-purpose resource states that are capable to perform a certain operation or task, where we consider…
We characterize the complete set of protocols that may be used to securely encrypt n quantum bits using secret and random classical bits. In addition to the application of such quantum encryption protocols to quantum data security, our…
Quantum computing is in an era of limited resources. Current hardware lacks high fidelity gates, long coherence times, and the number of computational units required to perform meaningful computation. Contemporary quantum devices typically…
It is proposed to map the quantum information qubit not to individual spin 1/2 states, but to the collective spin states being eigenfunctions of the Hamiltonian including spin-spin interactions, which may be not small. Such an approach…
Just as any state of a single qubit or 2-level system can be obtained from any other state by a rotation operator parametrized by three real Euler angles, we show how any state of an n-qubit or 2^n-level system can be obtained from any…
Compressible models extend the domain of simulable systems in quantum computers, but little is known about their precise limits of applicability. Using the theory of compressible matchgate circuits, we identify a class of quadratic…
Neural-network quantum states (NQS) have become a powerful tool in many-body physics. Of the numerous possible architectures in which neural-networks can encode amplitudes of quantum states the simplicity of the Restricted Boltzmann Machine…
Projected squeezed (PS) states are multipartite entangled states generated by unitary spin squeezing, followed by a collective quantum measurement and post-selection. They can lead to an appreciable decrease in the state preparation time of…
A two-step optimization is proposed to represent an arbitrary quantum state to a desired accuracy with the least number of gaussians in phase space. The Husimi distribution of the quantum state provides the information to determine the…
We propose a method for classical simulation of finite-dimensional quantum systems, based on sampling from a quasiprobability distribution, i.e., a generalized Wigner function. Our construction applies to all finite dimensions, with the…
Quantum superposition says that any physical system simultaneously exists in all of its possible states, the number of which is exponential in the number of entities composing the system. The strength of presence of each possible state in…