Measurement-induced phase transitions in sparse nonlocal scramblers

• URL: http://arxiv.org/abs/2109.10944v2
• Date: Fri, 25 Mar 2022 18:59:25 GMT
• Title: Measurement-induced phase transitions in sparse nonlocal scramblers
• Authors: Tomohiro Hashizume, Gregory Bentsen, Andrew J. Daley
• Abstract summary: Measurement-induced phase transitions arise due to a competition between the scrambling of quantum information in a many-body system and local measurements. We study these transitions in different classes of fast scramblers, systems that scramble quantum information as quickly as is conjectured to be possible. We find that circuits featuring sparse nonlocal interactions are able to withstand substantially higher rates of local measurement.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Measurement-induced phase transitions arise due to a competition between the scrambling of quantum information in a many-body system and local measurements. In this work we investigate these transitions in different classes of fast scramblers, systems that scramble quantum information as quickly as is conjectured to be possible -- on a timescale proportional to the logarithm of the system size. In particular, we consider sets of deterministic sparse couplings that naturally interpolate between local circuits that slowly scramble information and highly nonlocal circuits that achieve the fast-scrambling limit. We find that circuits featuring sparse nonlocal interactions are able to withstand substantially higher rates of local measurement than circuits with only local interactions, even at comparable gate depths. We also study the quantum error-correcting codes that support the volume-law entangled phase and find that our maximally nonlocal circuits yield codes with nearly extensive contiguous code distance. Use of these sparse, deterministic circuits opens pathways towards the design of noise-resilient quantum circuits and error correcting codes in current and future quantum devices with minimum gate numbers.

Related papers

• Lattice surgery-based logical state teleportation via noisy links [1.351813974961217]
  We study the correctability phase diagram of the logical state teleportation protocol. We find that the correctability-threshold lines decay as a power law with increasing separation. Our results indicate that the logical state teleportation protocol can tolerate much higher noise rates in the linking region.
  arXiv  Detail & Related papers  (2025-04-22T09:49:03Z)
• Optimization Driven Quantum Circuit Reduction [20.697821016522358]
  We propose three different transpilation approaches to substantially reduce circuit lengths without affecting functionality. The first variant is based on a search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support. We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using different qiskit optimization levels.
  arXiv  Detail & Related papers  (2025-02-20T16:41:10Z)
• Variational LOCC-assisted quantum circuits for long-range entangled states [1.6258326496071918]
  Long-range entanglement is an important quantum resource, especially for topological orders and quantum error correction. A promising avenue is offered by replacing some quantum resources with local operations and classical communication (LOCC) Here, we propose a quantum-classical hybrid algorithm to find ground states of given Hamiltonians based on parameterized LOCC protocols.
  arXiv  Detail & Related papers  (2024-09-11T14:08:33Z)
• Measurement-Based Long-Range Entangling Gates in Constant Depth [0.46040036610482665]
  We show how to reduce the depth of quantum sub-routines to a constant depth using mid-circuit measurements and feed-forward operations. We verify the feasibility by implementing the measurement-based quantum fan-out gate and long-range CNOT gate on real quantum hardware.
  arXiv  Detail & Related papers  (2024-08-06T09:35:42Z)
• Readout Error Mitigation for Mid-Circuit Measurements and Feedforward [0.0]
  Current quantum computing platforms suffer from readout errors, where faulty measurement outcomes are reported by the device. We propose a general protocol for mitigating mid-circuit measurement errors in the presence of feedforward. Our method demonstrates up to a $sim 60%$ reduction in error on superconducting quantum processors.
  arXiv  Detail & Related papers  (2024-06-11T18:00:01Z)
• 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)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Instantaneous nonlocal quantum computation and circuit depth reduction [7.148511452018054]
  Two-party quantum computation is a computation process with bipartite input and output, in which there are initial shared entanglement. In the first part, we show that a particular simplified subprocedure, known as a garden-hose gadget, cannot significantly reduce the entanglement cost. In the second part, we show that any unitary circuit consisting of layers of Clifford gates and T gates can be implemented using a circuit with measurements of depth proportional to the T-depth of the original circuit.
  arXiv  Detail & Related papers  (2023-06-15T17:57:50Z)
• 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 circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Pauli Error Propagation-Based Gate Reschedulingfor Quantum Circuit Error Mitigation [0.0]
  Noisy Intermediate-Scale Quantum (NISQ) algorithms should be carefully designed to boost the output state fidelity. In the presence of spatial variation in the error rate of the quantum gates, adjusting the circuit structure can play a major role in mitigating errors. We propose advanced predictive techniques to project the success rate of the circuit, and develop a new compilation phase post-quantum circuit mapping to improve its reliability.
  arXiv  Detail & Related papers  (2022-01-31T00:55:41Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• 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.