Do you want to publish a course? Click here

Efficient tomography of a quantum many-body system

205   0   0.0 ( 0 )
 Added by Ben Lanyon
 Publication date 2016
  fields Physics
and research's language is English




Ask ChatGPT about the research

Quantum state tomography (QST) is the gold standard technique for obtaining an estimate for the state of small quantum systems in the laboratory. Its application to systems with more than a few constituents (e.g. particles) soon becomes impractical as the effort required grows exponentially in the number of constituents. Developing more efficient techniques is particularly pressing as precisely-controllable quantum systems that are well beyond the reach of QST are emerging in laboratories. Motivated by this, there is a considerable ongoing effort to develop new characterisation tools for quantum many-body systems. Here we demonstrate Matrix Product State (MPS) tomography, which is theoretically proven to allow the states of a broad class of quantum systems to be accurately estimated with an effort that increases efficiently with constituent number. We first prove that this broad class includes the out-of-equilbrium states produced by 1D systems with finite-range interactions, up to any fixed point in time. We then use the technique to reconstruct the dynamical state of a trapped-ion quantum simulator comprising up to 14 entangled spins (qubits): a size far beyond the reach of QST. Our results reveal the dynamical growth of entanglement and description complexity as correlations spread out during a quench: a necessary condition for future beyond-classical performance. MPS tomography should find widespread use to study large quantum many-body systems and to benchmark and verify quantum simulators and computers.



rate research

Read More

We introduce the concept of pairwise tomography networks to characterise quantum properties in many-body systems and demonstrate an efficient protocol to measure them experimentally. Pairwise tomography networks are generators of multiplex networks where each layer represents the graph of a relevant quantifier such as, e.g., concurrence, quantum discord, purity, quantum mutual information, or classical correlations. We propose a measurement scheme to perform two-qubit tomography of all pairs showing exponential improvement in the number of qubits $N$ with respect to previously existing methods. We illustrate the usefulness of our approach by means of several examples revealing its potential impact to quantum computation, communication and simulation. We perform a proof-of-principle experiment demonstrating pairwise tomography networks of $W$ states on IBM Q devices.
We study the problem of learning the Hamiltonian of a quantum many-body system given samples from its Gibbs (thermal) state. The classical analog of this problem, known as learning graphical models or Boltzmann machines, is a well-studied question in machine learning and statistics. In this work, we give the first sample-efficient algorithm for the quantum Hamiltonian learning problem. In particular, we prove that polynomially many samples in the number of particles (qudits) are necessary and sufficient for learning the parameters of a spatially local Hamiltonian in l_2-norm. Our main contribution is in establishing the strong convexity of the log-partition function of quantum many-body systems, which along with the maximum entropy estimation yields our sample-efficient algorithm. Classically, the strong convexity for partition functions follows from the Markov property of Gibbs distributions. This is, however, known to be violated in its exact form in the quantum case. We introduce several new ideas to obtain an unconditional result that avoids relying on the Markov property of quantum systems, at the cost of a slightly weaker bound. In particular, we prove a lower bound on the variance of quasi-local operators with respect to the Gibbs state, which might be of independent interest. Our work paves the way toward a more rigorous application of machine learning techniques to quantum many-body problems.
The key to explaining a wide range of quantum phenomena is understanding how entanglement propagates around many-body systems. Furthermore, the controlled distribution of entanglement is of fundamental importance for quantum communication and computation. In many situations, quasiparticles are the carriers of information around a quantum system and are expected to distribute entanglement in a fashion determined by the system interactions. Here we report on the observation of magnon quasiparticle dynamics in a one-dimensional many-body quantum system of trapped ions representing an Ising spin model. Using the ability to tune the effective interaction range, and to prepare and measure the quantum state at the individual particle level, we observe new quasiparticle phenomena. For the first time, we reveal the entanglement distributed by quasiparticles around a many-body system. Second, for long-range interactions we observe the divergence of quasiparticle velocity and breakdown of the light-cone picture that is valid for short-range interactions. Our results will allow experimental studies of a wide range of phenomena, such as quantum transport, thermalisation, localisation and entanglement growth, and represent a first step towards a new quantum-optical regime with on-demand quasiparticles with tunable non-linear interactions.
Classical machine learning (ML) provides a potentially powerful approach to solving challenging quantum many-body problems in physics and chemistry. However, the advantages of ML over more traditional methods have not been firmly established. In this work, we prove that classical ML algorithms can efficiently predict ground state properties of gapped Hamiltonians in finite spatial dimensions, after learning from data obtained by measuring other Hamiltonians in the same quantum phase of matter. In contrast, under widely accepted complexity theory assumptions, classical algorithms that do not learn from data cannot achieve the same guarantee. We also prove that classical ML algorithms can efficiently classify a wide range of quantum phases of matter. Our arguments are based on the concept of a classical shadow, a succinct classical description of a many-body quantum state that can be constructed in feasible quantum experiments and be used to predict many properties of the state. Extensive numerical experiments corroborate our theoretical results in a variety of scenarios, including Rydberg atom systems, 2D random Heisenberg models, symmetry-protected topological phases, and topologically ordered phases.
Quantum many-body systems have been extensively studied from the perspective of quantum technology, and conversely, critical phenomena in such systems have been characterized by operationally relevant resources like entanglement. In this paper, we investigate robustness of magic (RoM), the resource in magic state injection based quantum computation schemes in the context of the transverse field anisotropic XY model. We show that the the factorizable ground state in the symmetry broken configuration is composed of an enormous number of highly magical $H$ states. We find the existence of a point very near the quantum critical point where magic contained explicitly in the correlation between two distant qubits attains a sharp maxima. Unlike bipartite entanglement, this persists over very long distances, capturing the presence of long range correlation near the phase transition. We derive scaling laws and extract corresponding exponents around criticality. Finally, we study the effect of temperature on two-qubit RoM and show that it reveals a crossover between dominance of quantum and thermal fluctuations.
comments
Fetching comments Fetching comments
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا