Realization of a Quantum Streaming Algorithm on Long-lived Trapped-ion Qubits

• URL: http://arxiv.org/abs/2511.03689v1
• Date: Wed, 05 Nov 2025 18:16:21 GMT
• Title: Realization of a Quantum Streaming Algorithm on Long-lived Trapped-ion Qubits
• Abstract summary: In this work, we realize a data-streaming model using a trapped-ion quantum computer with long-lived qubits that communicate with an external server.<n>We show that the quantum space advantage persists even with the overheads of fault-tolerance.
• Score: 2.886955168147019
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Large classical datasets are often processed in the streaming model, with data arriving one item at a time. In this model, quantum algorithms have been shown to offer an unconditional exponential advantage in space. However, experimentally implementing such streaming algorithms requires qubits that remain coherent while interacting with an external data stream. In this work, we realize such a data-streaming model using Quantinuum Helios trapped-ion quantum computer with long-lived qubits that communicate with an external server. We implement a quantum pair sketch, which is the primitive underlying many quantum streaming algorithms, and use it to solve Hidden Matching, a problem known to exhibit a theoretical exponential quantum advantage in space. Furthermore, we compile the quantum streaming algorithm to fault-tolerant quantum architectures based on surface and bivariate bicycle codes and show that the quantum space advantage persists even with the overheads of fault-tolerance.

Related papers

• Exponential quantum space advantage for Shannon entropy estimation in data streams [4.740331063526406]
  Near-term quantum devices with limited qubits motivate the study of space-bounded quantum computation in the data stream model.<n>We show that Shannon entropy estimation exhibits an exponential separation between quantum and classical space complexity in this setting.
  arXiv  Detail & Related papers  (2026-04-20T09:37:19Z)
• Toward speedup without quantum coherent access [0.0]
  We propose a variant of quantum algorithms, leveraging both classical and quantum resources.<n>We show how to use it to tackle a wide range of problems, including principal component analysis, linear equation solving, Hamiltonian simulation, and data fitting.
  arXiv  Detail & Related papers  (2026-02-24T11:21:44Z)
• Weakly-Driven Quantum Walks for Memory-Constrained Pauli Channel Learning [8.505960463791139]
  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.
  arXiv  Detail & Related papers  (2025-09-09T13:09:48Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• 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)
• 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)
• Qudits for decomposing multiqubit gates and realizing quantum algorithms [0.70224924046445]
  In this Colloquium several ideas are reviewed that indicate how multilevel quantum systems, also known as qudits, can be used for efficient realization of quantum algorithms.<n>The focus in the Colloquium is on techniques for leveraging qudits for simplifying decomposition of multiqubit gates and for compressing quantum information by encoding multiple qubits in a single qudit.
  arXiv  Detail & Related papers  (2023-11-20T18:34:19Z)
• 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)
• Limitations of Noisy Quantum Devices in Computational and Entangling Power [5.178527492542246]
  We show that noisy quantum devices with a circuit depth of more than $O(log n)$ provide no advantages in any quantum algorithms. We also study the maximal entanglement that noisy quantum devices can produce under one- and two-dimensional qubit connections.
  arXiv  Detail & Related papers  (2023-06-05T12:29:55Z)
• Quantum compression with classically simulatable circuits [0.5735035463793007]
  We present a strategy to design quantum autoencoders using evolutionary algorithms for transforming quantum information into lower-dimensional representations. We successfully demonstrate the initial applications of the algorithm for compressing different families of quantum states. This approach opens the possibility of using classical logic to find low representations of quantum data, using fewer computational resources.
  arXiv  Detail & Related papers  (2022-07-06T20:36:10Z)
• A Quantum Advantage for a Natural Streaming Problem [0.07614628596146598]
  We give a one-pass quantum streaming algorithm for one of the best studied problems in classical graph counting. Almost-tight parametrized upper and lower bounds are known for streaming.
  arXiv  Detail & Related papers  (2021-06-08T18:34:22Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• 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)
• 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.