Decoding the Entanglement Structure of Monitored Quantum Circuits

• URL: http://arxiv.org/abs/2109.08691v1
• Date: Fri, 17 Sep 2021 18:00:00 GMT
• Title: Decoding the Entanglement Structure of Monitored Quantum Circuits
• Authors: Beni Yoshida
• Abstract summary: We find that the entanglement structure of a monitored quantum circuit in the volume-law phase is largely independent of the initial states. We derive a general relation between the code distance and the sub-leading contribution to the volume-law entanglement entropy.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Given an output wavefunction of a monitored quantum circuit consisting of both unitary gates and projective measurements, we ask whether two complementary subsystems are entangled or not. For Clifford circuits, we find that this question can be mapped to a certain classical error-correction problem where various entanglement measures can be explicitly computed from the recoverability. The dual classical code is constructed from spacetime patterns of out-of-time ordered correlation functions among local operators and measured Pauli operators in the past, suggesting that the volume-law entanglement in a monitored circuit emerges from quantum information scrambling, namely the growth of local operators. We also present a method of verifying quantum entanglement by providing a simple deterministic entanglement distillation algorithm, which can be interpreted as decoding of the dual classical code. Discussions on coding properties of a monitored Clifford circuit, including explicit constructions of logical and stabilizer operators, are also presented. Applications of our framework to various physical questions, including non-Clifford systems, are discussed as well. Namely, we argue that the entanglement structure of a monitored quantum circuit in the volume-law phase is largely independent of the initial states and past measurement outcomes except recent ones, due to the decoupling phenomena from scrambling dynamics, up to a certain polynomial length scale which can be identified as the code distance of the circuit. We also derive a general relation between the code distance and the sub-leading contribution to the volume-law entanglement entropy. Applications of these results to black hole physics are discussed as well.

Related papers

• Measurement-induced entanglement and complexity in random constant-depth 2D quantum circuits [0.0]
  We analyse the entanglement structure of states generated by random constant-depth quantum circuits. We prove that macroscopic long-ranged entanglement is generated above some constant critical depth in several natural classes of circuit architectures.
  arXiv  Detail & Related papers  (2024-10-30T17:33:02Z)
• 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)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Measurement-induced entanglement and teleportation on a noisy quantum processor [105.44548669906976]
  We investigate measurement-induced quantum information phases on up to 70 superconducting qubits. We use a duality mapping, to avoid mid-circuit measurement and access different manifestations of the underlying phases. Our work demonstrates an approach to realize measurement-induced physics at scales that are at the limits of current NISQ processors.
  arXiv  Detail & Related papers  (2023-03-08T18:41:53Z)
• 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)
• Unbounded loops in quantum programs: categories and weak while loops [0.0]
  dissertation has two main contributions: (i) a categorical study of coherent quantum iteration and (ii) the introduction of weak while loops. The objective is to endow categories of quantum processes with a traced monoidal structure capable of modelling iterative quantum loops. A weak while loop is a classical control flow primitive that offers a trade-off between the collapse caused on each iteration and the amount of information gained.
  arXiv  Detail & Related papers  (2022-12-10T22:03:51Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• 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 circuits with classical versus quantum control of causal order [0.0]
  It is known that quantum supermaps which respect a definite, predefined causal order between their input operations correspond to fixed-order quantum circuits. Here we identify two new types of circuits that naturally generalise the fixed-order case. We show that quantum circuits with quantum control of causal order can only generate "causal" correlations, compatible with a well-defined causal order.
  arXiv  Detail & Related papers  (2021-01-21T19:00:06Z)
• Quantum Simulation of Light-Front Parton Correlators [0.0]
  The physics of high-energy colliders relies on the knowledge of non-perturbative parton correlators. We propose a quantum algorithm to perform a quantum simulation of these type of correlators.
  arXiv  Detail & Related papers  (2020-11-02T19:38:33Z)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)

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.