Entanglement transitions induced by quantum-data collection

• URL: http://arxiv.org/abs/2310.03061v4
• Date: Fri, 17 Jan 2025 16:11:34 GMT
• Title: Entanglement transitions induced by quantum-data collection
• Authors: Shane P. Kelly, Jamir Marino,
• Abstract summary: We present an entanglement transition in an array of qubits, induced by the transfer of quantum information from a system to a quantum computer. This quantum-data collection is an essential protocol in quantum machine learning algorithms.
• Score: 0.0
• License:
• Abstract: We present an entanglement transition in an array of qubits, induced by the transfer of quantum information from a system to a quantum computer. This quantum-data collection is an essential protocol in quantum machine learning algorithms that promise exponential advantage over their classical counterparts. In this and an accompanying work [Phys. Rev. A 111, 012425 (2025)], we identify sufficient conditions for an entanglement transition to occur in the late time state of the system and quantum computer. In this letter, we present an example entanglement transition occurring in a system comprised of a 1D chain of qubits evolving under a random brickwork circuit. After each layer, a fraction $p$ of sites undergo noisy quantum transduction in which quantum information is transferred to a quantum computer but at the cost of introducing noise from an environment. For an entanglement transition to occur, we argue that the environment must obtain the same amount of information as gained by the computer. Under this condition, the circuit shows a transition from volume law to area law entanglement as the rate $p$ is increased above a critical threshold. Our work delineates the prerequisites for quantum-data collection to induce entanglement transitions, thereby establishing a foundational framework for emergent entanglement phenomena in protocols relevant to quantum machine learning.

Related papers

• Quantum simulation of entanglement dynamics in a quantum processor [0.0]
  We implement a five-qubit protocol in IBM quantum processors to study entanglement dynamics. We observe the sudden death and sudden birth of entanglement for different inital conditions. This work takes relevance showing the usefulness of current noisy quantum devices to test fundamental concepts in quantum information.
  arXiv  Detail & Related papers  (2023-11-27T16:15:05Z)
• Quantum Coding Transitions in the Presence of Boundary Dissipation [0.3441021278275805]
  We study the fate of quantum information in a one-dimensional qudit chain. unitary evolution in the presence of boundary dissipation allows this information to remain partially protected. For strong enough dissipation, this information is completely lost to the dissipative environment.
  arXiv  Detail & Related papers  (2023-04-05T18:00:08Z)
• Low-Dissipation Data Bus via Coherent Quantum Dynamics [2.0299248281970956]
  In quantum computing the transfer of information must be coherent to preserve quantum states and hence the quantum information. We establish a simple protocol for transferring one- and two-electron encoded logical qubits in quantum dot arrays. This protocol could reduce the cooling requirements and constraints on scalable architectures for quantum dot quantum computers.
  arXiv  Detail & Related papers  (2023-04-05T12:07:02Z)
• A quantum-bit encoding converter [0.0]
  We certify the protocol on a complete set of single-photon qubits, successfully converting them to cat-state qubits with fidelities exceeding the classical limit. Our result demonstrates an essential tool for enabling interconnected quantum devices and architectures with enhanced versatility and scalability.
  arXiv  Detail & Related papers  (2022-11-18T19:00:08Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• 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)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• Quantum Information Scrambling in a Superconducting Qutrit Processor [0.0]
  Delocalization of quantum information in strongly-interacting many-body systems has recently begun to unite our understanding of black hole dynamics, transport in exotic non-Fermi liquids, and many-body analogs of quantum chaos. We implement two-qutrit scrambling operations and embed them in a five-qutrit teleportation algorithm to measure the associated out-time-ordered correlation functions.
  arXiv  Detail & Related papers  (2020-03-06T16:36:23Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.