Entanglement from tensor networks on a trapped-ion QCCD quantum computer

• URL: http://arxiv.org/abs/2104.11235v2
• Date: Wed, 5 May 2021 21:22:20 GMT
• Title: Entanglement from tensor networks on a trapped-ion QCCD quantum computer
• Authors: Michael Foss-Feig, Stephen Ragole, Andrew Potter, Joan Dreiling, Caroline Figgatt, John Gaebler, Alex Hall, Steven Moses, Juan Pino, Ben Spaun, Brian Neyenhuis, and David Hayes
• Abstract summary: We experimentally demonstrate a significant benefit of this approach to quantum simulation. In addition to all correlation functions, the entanglement structure of an infinite system is conveniently encoded within a small register of "bond qubits" We quantitatively determine the near-critical entanglement entropy of a correlated spin chain directly in the thermodynamic limit.
• Score: 2.943524728957949
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The ability to selectively measure, initialize, and reuse qubits during a quantum circuit enables a mapping of the spatial structure of certain tensor-network states onto the dynamics of quantum circuits, thereby achieving dramatic resource savings when using a quantum computer to simulate many-body systems with limited entanglement. We experimentally demonstrate a significant benefit of this approach to quantum simulation: In addition to all correlation functions, the entanglement structure of an infinite system -- specifically the half-chain entanglement spectrum -- is conveniently encoded within a small register of "bond qubits" and can be extracted with relative ease. Using a trapped-ion QCCD quantum computer equipped with selective mid-circuit measurement and reset, we quantitatively determine the near-critical entanglement entropy of a correlated spin chain directly in the thermodynamic limit and show that its phase transition becomes quickly resolved upon expanding the bond-qubit register.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Sequential quantum simulation of spin chains with a single circuit QED device [5.841833052422423]
  Quantum simulation of many-body systems in materials science and chemistry are promising application areas for quantum computers. We show how a single-circuit quantum electrodynamics device can be used to simulate the ground state of a highly-entangled quantum many-body spin chain. We demonstrate that the large state space of the cavity can be used to replace multiple qubits in a qubit-only architecture, and could therefore simplify the design of quantum processors for materials simulation.
  arXiv  Detail & Related papers  (2023-08-30T18:00:03Z)
• Stabilization of Discrete Time-Crystaline Response on a Superconducting Quantum Computer by increasing the Interaction Range [0.0]
  We present the outcomes of a digital quantum simulation where we overcome the limitations of the qubit connectivity in NISQ devices. We demonstrate how to implement couplings among physically disconnected qubits at the cost of increasing the circuit depth.
  arXiv  Detail & Related papers  (2023-05-23T18:00:12Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Simulation of interaction-induced chiral topological dynamics on a digital quantum computer [3.205614282399206]
  Chiral edge states are sought-after as paradigmatic topological states relevant to quantum information processing and electron transport. We demonstrate chiral topological propagation that is induced by suitably designed interactions, instead of flux or spin-orbit coupling. By taking advantage of the quantum nature of the platform, we circumvented difficulties from the limited qubit number and gate fidelity in present-day noisy intermediate-scale quantum (NISQ)-era quantum computers.
  arXiv  Detail & Related papers  (2022-07-28T18:00:29Z)
• A scalable superconducting quantum simulator with long-range connectivity based on a photonic bandgap metamaterial [0.0]
  We present a quantum simulator architecture based on a linear array of qubits locally connected to a superconducting photonic-bandgap metamaterial. The metamaterial acts both as a quantum bus mediating qubit-qubit interactions, and as a readout channel for multiplexed qubit-state measurement. We characterize the Hamiltonian of the system using a measurement-efficient protocol based on quantum many-body chaos.
  arXiv  Detail & Related papers  (2022-06-26T06:51:54Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Entanglement transfer, accumulation and retrieval via quantum-walk-based qubit-qudit dynamics [50.591267188664666]
  Generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based it transfer & accumulate mechanism. In particular, we illustrate a possible photonic implementation where the information is encoded in the orbital angular momentum and polarization degrees of freedom of single photons.
  arXiv  Detail & Related papers  (2020-10-14T14:33:34Z)
• Probing Criticality in Quantum Spin Chains with Neural Networks [0.0]
  We show that even neural networks with no hidden layers can be effectively trained to distinguish between magnetically ordered and disordered phases. Our results extend to a wide class of interacting quantum many-body systems and illustrate the wide applicability of neural networks to many-body quantum physics.
  arXiv  Detail & Related papers  (2020-05-05T12:34:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.