Quantum Physics

Sk Asfaq Hossain, Angshuman Bhattacharya

This work addresses a theoretical problem in quantum information theory, offering an incremental advancement in graphical representations for quantum channels.

Haimeng Zhao, Alexander Zlokapa, Hartmut Neven et al.

This work establishes machine learning on classical data as a broad domain of quantum advantage, potentially impacting fields like bioinformatics and natural language processing, but it is foundational rather than incremental.

Thomas Schuster, Dominik Kufel, Norman Y. Yao et al.

This establishes fundamental computational limits for quantum phase recognition, impacting quantum physics and materials science, but is incremental as it builds on pseudorandom unitaries and leaves open questions about constant-locality Hamiltonians.

Zimu Li, Yuguo Shao, Fuchuan Wei et al.

For quantum error correction and fault tolerance, this provides a general methodology to compute and lift logical invariants from small codes to infinite families, enabling efficient verification and new logical gate constructions.

Abolfazl Younesi, Nouhaila Innan, Alberto Marchisio et al.

For researchers and practitioners running hybrid quantum-classical algorithms on cloud quantum computers, EFaaS addresses the critical bottleneck of decoupled batch queues that cause long delays and drift penalties.

Di Fang, Jianfeng Lu, Yu Tong et al.

This work addresses the computational bottleneck of Gibbs state preparation for quantum computing applications, offering significant efficiency improvements.

Sacha Lerch, Joseph Bowles, Ricard Puig et al.

This work addresses optimization challenges in quantum generative modeling, offering incremental improvements for researchers in quantum machine learning.

Ohad Kimelfeld, Boulat A. Bash, Uzi Pereg

This work provides fundamental limits for covert quantum communication, which is important for ensuring undetectable quantum information transmission in adversarial settings.

Senrui Chen, Francesco Anna Mele, Marco Fanizza et al.

This work addresses a fundamental efficiency limit in quantum learning theory, with practical implications for quantum sensing and benchmarking, though it is incremental in advancing known theoretical bounds.

Yihang Sun, Mary Wootters

This work addresses a foundational problem in computational complexity and quantum algorithms, demonstrating limitations in current quantum approaches and providing new existential bounds for worst-case scenarios.

Yiming Li, Zimu Li, Zi-Wen Liu

This enables more efficient quantum computation by combining high-performance codes with essential non-Clifford gates, advancing fault-tolerant quantum computing.

Alexander Knapen, Junyi Luo, Guanchen Tao et al.

This work addresses resource contention in quantum-classical interfaces for fault-tolerant quantum computing by providing a scalable predecoding solution for general qLDPC codes, which is crucial for next-generation quantum error correction.

Kean Chen, Filippo Girardi, Aadil Oufkir et al.

Provides fundamental limits for quantum process tomography, a key task in characterizing quantum hardware, with implications for quantum information science.

Fabian Finger, Frederic Rapp, Pranav Kalidindi et al.

This work addresses the challenge of automating quantum algorithm design for near-term quantum computers, with potential applications in chemistry and other domains, though it is incremental as it builds on existing AI and quantum methods.

Jonas Jäger, Paolo Braccia, Pablo Bermejo et al.

This work provides a novel, interpretable, and scalable framework for quantum machine learning that addresses key limitations of existing approaches, particularly for quantum data.

Elies Gil-Fuster, Seongwook Shin, Sofiene Jerbi et al.

For researchers in quantum machine learning, this work provides a query-optimal algorithm and practical guidance for early-fault-tolerant quantum devices, though the results are incremental as they combine known techniques (amplitude estimation, observable encoding) in a systematic analysis.

Moe Shimada, Koki Awaya, Ryoya Yonemoto et al.

This work addresses computationally intractable optimization problems for fields like physics and engineering, offering a novel method that enhances performance beyond existing techniques.

Ewin Tang, John Wright

For quantum algorithm designers, this paper establishes a fundamental limitation on when quadratic speedups are achievable, clarifying why such speedups are rare in experimental settings where implementing inverses is difficult.

Junaid Aftab, Yuehaw Khoo, Haizhao Yang

This provides a foundational quantum analogue for non-uniform discrete Fourier transforms, enabling quantum algorithms for irregularly sampled data in applications like signal processing.

Natansh Mathur, Panagiotis Kl. Barkoutsos, Masako Yamada et al.

This work addresses the scalability bottleneck of training quantum neural networks on near-term hardware, enabling practical optimization for quantum machine learning in healthcare.