English
Related papers

Related papers: How to Design a Quantum Streaming Algorithm Withou…

200 papers

Data streaming, in which a large dataset is received as a "stream" of updates, is an important model in the study of space-bounded computation. Starting with the work of Le Gall [SPAA `06], it has been known that quantum streaming…

Quantum Physics · Physics 2021-11-16 John Kallaugher

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…

Demonstrating quantum advantage has been a pressing challenge in the field. Most claimed quantum speedups rely on a subroutine in which classical information can be accessed in a coherent quantum manner, which imposes a crucial constraint…

Quantum Physics · Physics 2025-11-04 Nhat A. Nghiem

Near-term quantum devices with limited qubits motivate the study of space-bounded quantum computation in the data stream model. We show that Shannon entropy estimation exhibits an exponential separation between quantum and classical space…

Quantum Physics · Physics 2026-04-21 Weijun Feng , Yongzhen Xu , Lvzhou Li , Gongde Guo , Song Lin

Universal quantum computers are the only general purpose quantum computers known that can be implemented as of today. These computers consist of a classical memory component which controls the quantum memory. In this paper, the space…

Quantum Physics · Physics 2020-11-03 Yanglin Hu , Darya Melnyk , Yuyi Wang , Roger Wattenhofer

While the search for quantum advantage typically focuses on speedups in execution time, quantum algorithms also offer the potential for advantage in space complexity. Previous work has shown such advantages for data stream problems, in…

Quantum Physics · Physics 2023-11-27 John Kallaugher , Ojas Parekh , Nadezhda Voronova

We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorithms) as a model for online algorithms. We construct problems…

Data Structures and Algorithms · Computer Science 2019-06-24 Kamil Khadiev , Aliya Khadieva , Mansur Ziatdinov , Dmitry Kravchenko , Alexander Rivosh , Ramis Yamilov , Ilnaz Mannapov

Faster algorithms, novel cryptographic mechanisms, and alternative methods of communication become possible when the model underlying information and computation changes from a classical mechanical model to a quantum mechanical one. Quantum…

Quantum Physics · Physics 2009-12-29 Eleanor G. Rieffel

Quantum algorithms based on quantum kernel methods have been investigated previously [1]. A quantum advantage is derived from the fact that it is possible to construct a family of datasets for which, only quantum processing can recognise…

Quantum Physics · Physics 2024-05-08 Sanjeev Naguleswaran

The power of quantum computers is still somewhat speculative. While they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve has not been mapped definitively onto known classical…

Quantum Physics · Physics 2020-07-09 N. H. Nguyen , E. C. Behrman , M. A. Moustafa , J. E. Steck

Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm…

Quantum Physics · Physics 2019-02-01 Yuval R. Sanders , Guang Hao Low , Artur Scherer , Dominic W. Berry

Along with the development of quantum technology, finding useful applications of quantum computers has been a central pursuit. Despite various quantum algorithms have been developed, many of them often require strong input assumptions,…

Quantum Physics · Physics 2026-02-25 Nhat A. Nghiem

Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…

Quantum Physics · Physics 2025-12-03 William A. Simon , Peter J. Love

The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle,…

Approximating quantiles and distributions over streaming data has been studied for roughly two decades now. Recently, Karnin, Lang, and Liberty proposed the first asymptotically optimal algorithm for doing so. This manuscript complements…

Data Structures and Algorithms · Computer Science 2019-07-02 Nikita Ivkin , Edo Liberty , Kevin Lang , Zohar Karnin , Vladimir Braverman

Today's quantum processors composed of fifty or more qubits have allowed us to enter a computational era where the output results are not easily simulatable on the world's biggest supercomputers. What we have not seen yet, however, is…

Quantum Physics · Physics 2021-09-01 Akitada Sakurai , Marta P. Estarellas , William J. Munro , Kae Nemoto

Quantum algorithms are demonstrated to outperform classical algorithms for certain problems and thus are promising candidates for efficient information processing. Herein we aim to provide a brief and popular introduction to quantum…

Quantum Physics · Physics 2022-12-22 Shihao Zhang , Lvzhou Li

The anticipated applications of quantum computers span across science and industry, ranging from quantum chemistry and many-body physics to optimization, finance, and machine learning. Proposed quantum solutions in these areas typically…

Quantum computing, leveraging quantum phenomena like superposition and entanglement, is emerging as a transformative force in computing technology, promising unparalleled computational speed and efficiency crucial for engineering…

Quantum Physics · Physics 2024-08-30 Osama Muhammad Raisuddin , Suvranu De

We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorithms) as a model for online algorithms. We construct problems…

Computational Complexity · Computer Science 2019-06-21 Kamil Khadiev , Aliya Khadieva , Dmitry Kravchenko , Alexander Rivosh , Ramis Yamilov , Ilnaz Mannapov
‹ Prev 1 2 3 10 Next ›