Simulation of many-qubit quantum computation with matrix product states

Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete problem. Errors inherent to truncations of the exact action of interacting gates are controlled by the size of the matrices in the representation. The property of finding the right solution for an instance and the expected value of the energy are found to be remarkably robust against these errors. As a symbolic example, we simulate the algorithm solving a 100-qubit hard instance, that is, finding the correct product state out of ~ 10^30 possibilities. Accumulated statistics for up to 60 qubits point at a slow growth of the average minimum time to solve hard instances with highly-truncated simulations of adiabatic quantum evolution.Comment: 5 pages, 4 figures, final versio

Frustration, interaction strength and ground-state entanglement in complex quantum systems

Entanglement in the ground state of a many-body quantum system may arise when the local terms in the system Hamiltonian fail to commute with the interaction terms in the Hamiltonian. We quantify this phenomenon, demonstrating an analogy between ground-state entanglement and the phenomenon of frustration in spin systems. In particular, we prove that the amount of ground-state entanglement is bounded above by a measure of the extent to which interactions frustrate the local terms in the Hamiltonian. As a corollary, we show that the amount of ground-state entanglement is bounded above by a ratio between parameters characterizing the strength of interactions in the system, and the local energy scale. Finally, we prove a qualitatively similar result for other energy eigenstates of the system.Comment: 11 pages, 3 figure

Entropy and Exact Matrix Product Representation of the Laughlin Wave Function

An analytical expression for the von Neumann entropy of the Laughlin wave function is obtained for any possible bipartition between the particles described by this wave function, for filling fraction nu=1. Also, for filling fraction nu=1/m, where m is an odd integer, an upper bound on this entropy is exhibited. These results yield a bound on the smallest possible size of the matrices for an exact representation of the Laughlin ansatz in terms of a matrix product state. An analytical matrix product state representation of this state is proposed in terms of representations of the Clifford algebra. For nu=1, this representation is shown to be asymptotically optimal in the limit of a large number of particles

Half the entanglement in critical systems is distillable from a single specimen

We establish that the leading critical scaling of the single-copy entanglement is exactly one half of the entropy of entanglement of a block in critical infinite spin chains in a general setting, using methods of conformal field theory. Conformal symmetry imposes that the single-copy entanglement for critical many-body systems scales as E_1(\rho_L)=(c/6) \log L- (c/6) (\pi^2/\log L) + O(1/L), where L is the number of constituents in a block of an infinite chain and c corresponds to the central charge. This proves that from a single specimen of a critical chain, already half the entanglement can be distilled compared to the rate that is asymptotically available. The result is substantiated by a quantitative analysis for all translationally invariant quantum spin chains corresponding to general isotropic quasi-free fermionic models. An analytic example of the XY model shows that away from criticality the above simple relation is only maintained near the quantum phase transition point.Comment: 4 pages RevTeX, 1 figure, final versio

Optimal generalized quantum measurements for arbitrary spin systems

Positive operator valued measurements on a finite number of N identically prepared systems of arbitrary spin J are discussed. Pure states are characterized in terms of Bloch-like vectors restricted by a SU(2 J+1) covariant constraint. This representation allows for a simple description of the equations to be fulfilled by optimal measurements. We explicitly find the minimal POVM for the N=2 case, a rigorous bound for N=3 and set up the analysis for arbitrary N.Comment: LateX, 12 page

Quantum Phase Transitions in Anti-ferromagnetic Planar Cubic Lattices

Motivated by its relation to an $\cal{NP}$-hard problem, we analyze the ground state properties of anti-ferromagnetic Ising-spin networks embedded on planar cubic lattices, under the action of homogeneous transverse and longitudinal magnetic fields. This model exhibits a quantum phase transition at critical values of the magnetic field, which can be identified by the entanglement behavior, as well as by a Majorization analysis. The scaling of the entanglement in the critical region is in agreement with the area law, indicating that even simple systems can support large amounts of quantum correlations. We study the scaling behavior of low-lying energy gaps for a restricted set of geometries, and find that even in this simplified case, it is impossible to predict the asymptotic behavior, with the data allowing equally good fits to exponential and power law decays. We can therefore, draw no conclusion as to the algorithmic complexity of a quantum adiabatic ground-state search for the system.Comment: 7 pages, 13 figures, final version (accepted for publication in PRA

Optimal minimal measurements of mixed states

The optimal and minimal measuring strategy is obtained for a two-state system prepared in a mixed state with a probability given by any isotropic a priori distribution. We explicitly construct the specific optimal and minimal generalized measurements, which turn out to be independent of the a priori probability distribution, obtaining the best guesses for the unknown state as well as a closed expression for the maximal mean averaged fidelity. We do this for up to three copies of the unknown state in a way which leads to the generalization to any number of copies, which we then present and prove.Comment: 20 pages, no figure

Multi-party entanglement in graph states

Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multi-party quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multi-particle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimension, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphies.Comment: 22 pages, 15 figures, 2 tables, typos corrected (e.g. in measurement rules), references added/update

Universal geometric entanglement close to quantum phase transitions

Under successive Renormalization Group transformations applied to a quantum state $\ket{\Psi}$ of finite correlation length $\xi$, there is typically a loss of entanglement after each iteration. How good it is then to replace $\ket{\Psi}$ by a product state at every step of the process? In this paper we give a quantitative answer to this question by providing first analytical and general proofs that, for translationally invariant quantum systems in one spatial dimension, the global geometric entanglement per region of size $L \gg \xi$ diverges with the correlation length as $(c/12) \log{(\xi/\epsilon)}$ close to a quantum critical point with central charge $c$, where $\epsilon$ is a cut-off at short distances. Moreover, the situation at criticality is also discussed and an upper bound on the critical global geometric entanglement is provided in terms of a logarithmic function of $L$.Comment: 4 pages, 3 figure

Entanglement in spin chains and lattices with long-range Ising-type interactions

We consider N initially disentangled spins, embedded in a ring or d-dimensional lattice of arbitrary geometry, which interact via some long--range Ising--type interaction. We investigate relations between entanglement properties of the resulting states and the distance dependence of the interaction in the limit N to infinity. We provide a sufficient condition when bipartite entanglement between blocks of L neighboring spins and the remaining system saturates, and determine S_L analytically for special configurations. We find an unbounded increase of S_L as well as diverging correlation and entanglement length under certain circumstances. For arbitrarily large N, we can efficiently calculate all quantities associated with reduced density operators of up to ten particles.Comment: 4 pages, 2 figures; V2: presentation improved, references adde