Entanglement flow in multipartite systems

We investigate entanglement dynamics in multipartite systems, establishing a quantitative concept of entanglement flow: both flow through individual particles, and flow along general networks of interacting particles. In the former case, the rate at which a particle can transmit entanglement is shown to depend on that particle's entanglement with the rest of the system. In the latter, we derive a set of entanglement rate equations, relating the rate of entanglement generation between two subsets of particles to the entanglement already present further back along the network. We use the rate equations to derive a lower bound on entanglement generation in qubit chains, and compare this to existing entanglement creation protocols.Comment: 13 pages, 5 figures, REVTeX format. Proof of lemma 3 corrected. Restructured and expande

Engineering correlation and entanglement dynamics in spin systems

We show that the correlation and entanglement dynamics of spin systems can be understood in terms of propagation of spin waves. This gives a simple, physical explanation of the behaviour seen in a number of recent works, in which a localised, low-energy excitation is created and allowed to evolve. But it also extends to the scenario of translationally invariant systems in states far from equilibrium, which require less local control to prepare. Spin-wave evolution is completely determined by the system's dispersion relation, and the latter typically depends on a small number of external, physical parameters. Therefore, this new insight into correlation dynamics opens up the possibility not only of predicting but also of controlling the propagation velocity and dispersion rate, by manipulating these parameters. We demonstrate this analytically in a simple, example system.Comment: 4 pages, 4 figures, REVTeX4 forma

Separable states can be used to distribute entanglement

We show that no entanglement is necessary to distribute entanglement; that is, two distant particles can be entangled by sending a third particle that is never entangled with the other two. Similarly, two particles can become entangled by continuous interaction with a highly mixed mediating particle that never itself becomes entangled. We also consider analogous properties of completely positive maps, in which the composition of two separable maps can create entanglement.Comment: 4 pages, 2 figures. Slight modification

Fitting quantum noise models to tomography data

The presence of noise is currently one of the main obstacles to achieving large-scale quantum computation. Strategies to characterise and understand noise processes in quantum hardware are a critical part of mitigating it, especially as the overhead of full error correction and fault-tolerance is beyond the reach of current hardware. Non-Markovian effects are a particularly unfavourable type of noise, being both harder to analyse using standard techniques and more difficult to control using error correction. In this work we develop a set of efficient algorithms, based on the rigorous mathematical theory of Markovian master equations, to analyse and evaluate unknown noise processes. In the case of dynamics consistent with Markovian evolution, our algorithm outputs the best-fit Lindbladian, i.e., the generator of a memoryless quantum channel which best approximates the tomographic data to within the given precision. In the case of non-Markovian dynamics, our algorithm returns a quantitative and operationally meaningful measure of non-Markovianity in terms of isotropic noise addition. We provide a Python implementation of all our algorithms, and benchmark these on a range of 1- and 2-qubit examples of synthesised noisy tomography data, generated using the Cirq platform. The numerical results show that our algorithms succeed both in extracting a full description of the best-fit Lindbladian to the measured dynamics, and in computing accurate values of non-Markovianity that match analytical calculations

Hamiltonian simulation algorithms for near-term quantum hardware

The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In this work, we develop quantum algorithms for Hamiltonian simulation "one level below” the circuit model, exploiting the underlying control over qubit interactions available in most quantum hardware and deriving analytic circuit identities for synthesising multi-qubit evolutions from two-qubit interactions. We then analyse the impact of these techniques under the standard error model where errors occur per gate, and an error model with a constant error rate per unit time. To quantify the benefits of this approach, we apply it to time-dynamics simulation of the 2D spin Fermi-Hubbard model. Combined with new error bounds for Trotter product formulas tailored to the non-asymptotic regime and an analysis of error propagation, we find that e.g. for a 5 × 5 Fermi-Hubbard lattice we reduce the circuit depth from 1, 243, 586 using the best previous fermion encoding and error bounds in the literature, to 3, 209 in the per-gate error model, or the circuit-depth-equivalent to 259 in the per-time error model. This brings Hamiltonian simulation, previously beyond reach of current hardware for non-trivial examples, significantly closer to being feasible in the NISQ era

Translationally Invariant Universal Quantum Hamiltonians in 1D

. Recent work has characterized rigorously what it means for one quantum system to simulate another and demonstrated the existence of universal Hamiltonians—simple spin lattice Hamiltonians that can replicate the entire physics of any other quantum many-body system. Previous universality results have required proofs involving complicated ‘chains’ of perturbative ‘gadgets.’ In this paper, we derive a significantly simpler and more powerful method of proving universality of Hamiltonians, directly leveraging the ability to encode quantum computation into ground states. This provides new insight into the origins of universal models and suggests a deep connection between universality and complexity. We apply this new approach to show that there are universal models even in translationally invariant spin chains in 1D. This gives as a corollary a new Hamiltonian complexity result that the local Hamiltonian problem for translationally invariant spin chains in one dimension with an exponentially small promise gap is PSPACE-complete. Finally, we use these new universal models to construct the first known toy model of 2D–1D holographic duality between local Hamiltonians

Undecidability of the Spectral Gap

We construct families of translationally-invariant, nearest-neighbour Hamiltonians on a 2D square lattice of d-level quantum systems (d constant), for which determining whether the system is gapped or gapless is an undecidable problem. This is true even with the promise that each Hamiltonian is either gapped or gapless in the strongest sense: it is promised to either have continuous spectrum above the ground state in the thermodynamic limit, or its spectral gap is lower-bounded by a constant. Moreover, this constant can be taken equal to the operator norm of the local operator that generates the Hamiltonian (the local interaction strength). The result still holds true if one restricts to arbitrarily small quantum perturbations of classical Hamiltonians. The proof combines a robustness analysis of Robinson’s aperiodic tiling, together with tools from quantum information theory: the quantum phase estimation algorithm and the history state technique mapping Quantum Turing Machines to Hamiltonians

Magnetic field control of cycloidal domains and electric polarization in multiferroic BiFeO3_3

The magnetic field induced rearrangement of the cycloidal spin structure in ferroelectric mono-domain single crystals of the room-temperature multiferroic BiFeO$_3$ is studied using small-angle neutron scattering (SANS). The cycloid propagation vectors are observed to rotate when magnetic fields applied perpendicular to the rhombohedral (polar) axis exceed a pinning threshold value of $\sim$5\,T. In light of these experimental results, a phenomenological model is proposed that captures the rearrangement of the cycloidal domains, and we revisit the microscopic origin of the magnetoelectric effect. A new coupling between the magnetic anisotropy and the polarization is proposed that explains the recently discovered magnetoelectric polarization to the rhombohedral axis

Translationally Invariant Universal Classical Hamiltonians

Spin models are widely studied in the natural sciences, from investigating magnetic materials in condensed matter physics to studying neural networks. Previous work has demonstrated that there exist simple classical spin models that are universal: they can replicate—in a precise and rigorous sense—the complete physics of any other classical spin model, to any desired accuracy. However, all previously known universal models break translational invariance. In this paper we show that there exist translationally invariant universal models. Our main result is an explicit construction of a translationally invariant, 2D, nearest-neighbour, universal classical Hamiltonian with a single free parameter. The proof draws on techniques from theoretical computer science, in particular recent complexity theoretic results on tiling problems. Our results imply that there exists a single Hamiltonian which encompasses all classical spin physics, just by tuning a single parameter and varying the size of the lattice. We also prove that our construction is optimal in terms of the number of parameters in the Hamiltonian; there cannot exist a translationally invariant universal Hamiltonian with only the lattice size as a parameter

Compact fermion to qubit mappings

Mappings between fermions and qubits are valuable constructions in physics. To date only a handful exist. In addition to revealing dualities between fermionic and spin systems, such mappings are indispensable in any quantum simulation of fermionic physics on quantum computers. The number of qubits required per fermionic mode, and the locality of mapped fermionic operators strongly impact the cost of such simulations. We present a fermion to qubit mapping that outperforms all previous local mappings in both the qubit to mode ratio and the locality of mapped operators. In addition to these practically useful features, the mapping bears an elegant relationship to the toric code, which we discuss. Finally, we consider the error mitigating properties of the mapping—which encodes fermionic states into the code space of a stabilizer code. Although there is an implicit tradeoff between low weight representations of local fermionic operators, and high distance code spaces, we argue that fermionic encodings with low-weight representations of local fermionic operators can still exhibit error mitigating properties which can serve a similar role to that played by high code distances. In particular, when undetectable errors correspond to “natural” fermionic noise. We illustrate this point explicitly both for this encoding and the Verstraete-Cirac encoding