Weakly-Driven Quantum Walks for Memory-Constrained Pauli Channel Learning

• URL: http://arxiv.org/abs/2509.07702v1
• Date: Tue, 09 Sep 2025 13:09:48 GMT
• Title: Weakly-Driven Quantum Walks for Memory-Constrained Pauli Channel Learning
• Authors: Yuan-Zhuo Wang, Yi-Ran Xiao, Ming-Yang Li, Shengjun Wu, Zeng-Bing Chen,
• Abstract summary: We introduce a mechanism termed the weakly-driven quantum walk'' to mitigate the demand for high-quality quantum memory.<n>Our algorithm lowers the quantum memory overhead to a constant order while preserving the exponential advantage in measurement complexity.
• Score: 8.505960463791139
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Accurate characterization of quantum noise, exemplified by the Pauli channel, is a cornerstone for building fault-tolerant quantum computers. A recent protocol (PRX Quantum 6, 020323 (2025)) combining channel concatenation and quantum memory has achieved an exponential reduction in measurement complexity for Pauli channel estimation. This efficiency, however, hinges on using logarithmic quantum memory to suppress hypothesis test errors. In this work, we introduce a mechanism termed the ``weakly-driven quantum walk'' to mitigate the demand for high-quality quantum memory. By exploiting the distinct dynamical properties of quantum walks under biased versus unbiased driving, our algorithm lowers the quantum memory overhead to a constant order while preserving the exponential advantage in measurement complexity. By analogy with weak measurement, our introduced concept of ``weak driving'' preserves pointer coherence even when driven by classical probabilistic information, a principle that may inspire new approaches to similar quantum algorithm design and quantum sensing of weak signals in resource-constrained scenarios.

Related papers

• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Purest Quantum State Identification [14.22473588576799]
  We introduce the purest quantum state identification, which can be used to improve the accuracy of quantum computation and communication.<n>For incoherent strategies, we derive the first adaptive algorithm achieving error probability $expleft(- Omegaleft(fracN H_1log(K) 2nfracright)$, fundamentally improving quantum property learning.
  arXiv  Detail & Related papers  (2025-02-20T07:42:16Z)
• Entanglement-enhanced learning of quantum processes at scale [2.2278634757583875]
  We show that entanglement with auxiliary noisy quantum memory combined with error mitigation considerably enhances the learning of quantum processes. Our study demonstrates that entanglement with auxiliary noisy quantum memory combined with error mitigation considerably enhances the learning of quantum processes.
  arXiv  Detail & Related papers  (2024-08-06T18:00:20Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness [0.0]
  We study the learnability of quantum circuits in the near term.<n>We adapt a learning algorithm for constant-depth quantum circuits to the quantum statistical query setting.<n>We prove that pseudorandom unitaries (PRUs) cannot be constructed using circuits of constant depth.
  arXiv  Detail & Related papers  (2024-05-20T14:55:20Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Practical limitations of quantum data propagation on noisy quantum processors [0.9362259192191963]
  We show that owing to the noisy nature of current quantum processors, such a quantum algorithm will require single- and two-qubit gates with very low error probability to produce reliable results. Specifically, we provide the upper bounds on how the relative error in variational parameters' propagation scales with the probability of noise in quantum hardware.
  arXiv  Detail & Related papers  (2023-06-22T17:12:52Z)
• Hybrid quantum gap estimation algorithm using a filtered time series [0.0]
  We prove that classical post-processing, i.e., long-time filtering of an offline time series, exponentially improves the circuit depth needed for quantum time evolution. We apply the filtering method to the construction of a hybrid quantum-classical algorithm to estimate energy gap. Our findings set the stage for unbiased quantum simulation to offer memory advantage in the near term.
  arXiv  Detail & Related papers  (2022-12-28T18:59:59Z)
• Universal cost bound of quantum error mitigation based on quantum estimation theory [0.0]
  We present a unified approach to analyzing the cost of various quantum error mitigation methods on the basis of quantum estimation theory. We derive for a generic layered quantum circuit under a wide class of Markovian noise that, unbiased estimation of an observable encounters an exponential growth with the circuit depth in the lower bound on the measurement cost. Our results contribute to the understanding of the physical limitations of quantum error mitigation and offer a new criterion for evaluating the performance of quantum error mitigation techniques.
  arXiv  Detail & Related papers  (2022-08-19T15:04:36Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Numerical hardware-efficient variational quantum simulation of a soliton solution [0.0]
  We discuss the capabilities of quantum algorithms with special attention paid to a hardware-efficient variational eigensolver. A delicate interplay between magnetic interactions allows one to stabilize a chiral state that destroys the homogeneity of magnetic ordering. We argue that, while being capable of correctly reproducing a uniform magnetic configuration, the hardware-efficient ansatz meets difficulties in providing a detailed description to a noncollinear magnetic structure.
  arXiv  Detail & Related papers  (2021-05-13T11:58:18Z)
• 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)
• 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)

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.