🚀 QuantumBoom

Daily Quantum Computing Research & News • November 17, 2025 • 04:21 CST

Join the QuantumBoom Digest

Never miss out the next quantum breakthrough.

📊 Today's Data Collection

Highlights: 5 top items selected
News items: 10 articles gathered
Technology papers: 10 papers fetched
Company papers: 8 papers from major players
Highlighted papers: 5 papers collected
Total sources: 6 data feeds processed

🌟 Highlights

−
⭐ TOP PAPER

TrackHHL: A Quantum Computing Algorithm for Track Reconstruction at the LHCb

Xenofon Chiotopoulos, Miriam Lucio Martinez, Davide Nicotra, Jacco A. de Vries, Kurt Driessens, Marcel Merk, Mark H. M. Winands • 2025-11-14T16:31 Score: 0.55
In the future high-luminosity LHC era, high-energy physics experiments face unprecedented computational challenges for event reconstruction. Employing the LHCb vertex locator as a case study we invest...

📰 News Items

−

📄 Technology Papers

−

Efficient computation of quantum time-optimal control

Andrei A. Stepanenko, Kseniia S. Chernova, Maxim A. Gorlach • Published: 2025-11-14
We present an approach to compute time-optimal control of a quantum system which combines quantum brachistochrone and Lax pair techniques and enables efficient investigation of large-scale quantum systems. We illustrate our method by finding the fastest way to transfer a single-particle excitation in a nearest-neighbor-coupled infinitely large qubit lattice with the fixed sum of squares of the cou...

TrackHHL: A Quantum Computing Algorithm for Track Reconstruction at the LHCb

Xenofon Chiotopoulos, Miriam Lucio Martinez, Davide Nicotra, Jacco A. de Vries, Kurt Driessens, Marcel Merk, Mark H. M. Winands • Published: 2025-11-14
In the future high-luminosity LHC era, high-energy physics experiments face unprecedented computational challenges for event reconstruction. Employing the LHCb vertex locator as a case study we investigate a novel approach for charged particle track reconstruction. The algorithm hinges on minimizing an Ising-like Hamiltonian using matrix inversion. Solving this matrix inversion classically achieve...

Hamiltonian simulation with explicit formulas for Digital-Analog Quantum Computing

Mikel Garcia-de-Andoin, Thorge Müller, Gonzalo Camacho • Published: 2025-11-14
Digital-analog is a quantum computational paradigm that employs the natural interaction Hamiltonian of a system as the entangling resource, combined with single qubit gates, to implement universal quantum operations. As in the case of its digital gate-based counterpart, designing digital-analog circuits that employ optimal quantum resources often requires an exceedingly large classical computation...

Modular quantum extreme reservoir computing

Hon Wai Lau, Aoi Hayashi, Akitada Sakurai, William John Munro, Kae Nemoto • Published: 2024-12-26
Quantum reservoir computing employs fixed quantum dynamics as a feature map for machine learning. Integrating multiple quantum reservoirs, however, raises a key question: how few inter-module connections are sufficient to match the performance of a single reservoir? To address this, we explicitly separate intra-module dynamics from inter-module couplings and systematically examine different connec...

When Federated Learning Meets Quantum Computing: Survey and Research Opportunities

Aakar Mathur, Ashish Gupta, Sajal K. Das • Published: 2025-04-09
Quantum Federated Learning (QFL) is an emerging field that harnesses advances in Quantum Computing (QC) to improve the scalability and efficiency of decentralized Federated Learning (FL) models. This paper provides a systematic and comprehensive survey of the emerging problems and solutions when FL meets QC, from research protocol to a novel taxonomy, particularly focusing on both quantum and fede...

Efficient quantum Gibbs sampling of stabilizer codes using hybrid computation

Ivan H. C. Shum, Angela Capel • Published: 2025-11-13
We present hybrid Gibbs sampling algorithms for the stabilizer code Hamiltonians of the rotated surface code and the toric code with only local quantum algorithms, using $\sim L/2$ quantum circuit depth to prepare the Gibbs state of the rotated surface code Hamiltonian, and $L$ quantum circuit depth to prepare the Gibbs state of the toric code Hamiltonian, being $L$ the side of the side of the squ...

Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation

Shinichi Sunami, Yutaka Hirano, Toshihide Hinokuma, Hayata Yamasaki • Published: 2025-11-13
Distributed architecture is a promising route to scaling fault-tolerant quantum computing (FTQC) beyond the inherent limitations of single processors. For practical implementation of distributed FTQC, logical Bell pair preparation must be designed not only for efficient Bell pair consumption but also for the spacetime volume of the protocol; however, entanglement distillation protocols have primar...

Impacts of Decoder Latency on Utility-Scale Quantum Computer Architectures

Abdullah Khalid, Allyson Silva, Gebremedhin A. Dagnew, Tom Dvir, Oded Wertheim, Motty Gruda, Xiangzhou Kong, Mia Kramer, Zak Webb, Artur Scherer, Masoud Mohseni, Yonatan Cohen, Pooya Ronagh • Published: 2025-11-13
The speed of a fault-tolerant quantum computer is dictated by the reaction time of its classical electronics, that is, the total time required by decoders and controllers to determine the outcome of a logical measurement and execute subsequent conditional logical operations. Despite its importance, the reaction time and its impact on the design of the logical microarchitecture of a quantum compute...

Quantum Algorithms for Computing Maximal Quantum $f$-divergence and Kubo-Ando means

Trung Hoa Dinh, Nhat A. Nghiem • Published: 2025-11-13
The development of quantum computation has resulted in many quantum algorithms for a wide array of tasks. Recently, there is a growing interest in using quantum computing techniques to estimate or compute quantum information-theoretic quantities such as Renyi entropy, Von Neumann entropy, matrix means, etc. Motivated by these results, we present quantum algorithms for computing the maximal quantum...

Efficient Berry Phase Calculation via Adaptive Variational Quantum Computing Approach

Martin Mootz, Yong-Xin Yao • Published: 2025-06-23
We present an adaptive variational quantum algorithm to estimate the Berry phase accumulated by a nondegenerate ground state under cyclic, adiabatic evolution of a time-dependent Hamiltonian. Our method leverages cyclic adiabatic evolution of the Hamiltonian and employs adaptive variational quantum algorithms for state preparation and evolution, optimizing circuit efficiency while maintaining high...

🏢 Company Papers

−

A Comparison of Relativistic Coupled Cluster and Equation of Motion Coupled Cluster Quadratic Response Theory

Xiang Yuan, Loïc Halbert, Lucas Visscher, André Severo Pereira Gomes • Published: 2025-06-28
We present the implementation of relativistic coupled cluster quadratic response theory (QR-CC), following our development of relativistic equation of motion coupled cluster quadratic response theory (QR-EOMCC) [X. Yuan et al., J. Chem. Theory Comput. 2023, 19, 9248]. These codes, which can be used in combination with relativistic (2- and 4-component based) as well as non-relativistic Hamiltonians...

Quantum low-density parity-check codes for erasure-biased atomic quantum processors

Laura Pecorari, Guido Pupillo • Published: 2025-02-27
Identifying the best families of quantum error correction (QEC) codes for near-term experiments is key to enabling fault-tolerant quantum computing. Ideally, such codes should have low overhead in qubit number, high physical error thresholds, and moderate requirements on qubit connectivity to simplify experiments, while allowing for high logical error suppression. Quantum Low-Density Parity-Check ...

GRIN Transfer: A production-ready tool for libraries to retrieve digital copies from Google Books

Liza Daly, Matteo Cargnelutti, Catherine Brobston, John Hess, Greg Leppert, Amanda Watson, Jonathan Zittrain • Published: 2025-11-14
Publicly launched in 2004, the Google Books project has scanned tens of millions of items in partnership with libraries around the world. As part of this project, Google created the Google Return Interface (GRIN). Through this platform, libraries can access their scanned collections, the associated metadata, and the ongoing OCR and metadata improvements that become available as Google reprocesses ...

A superinductor in a deep sub-micron integrated circuit

T. H. Swift, F. Olivieri, G. Aizpurua-Iraola, J. Kirkman, G. M. Noah, M. de Kruijf, F. E. von Horstig, A. Gomez-Saiz, J. J. L. Morton, M. F. Gonzalez-Zalba • Published: 2025-07-17
Superinductors are circuit elements characterised by an intrinsic impedance in excess of the superconducting resistance quantum ($R_\text{Q}\approx6.45~$k$Ω$), with applications from metrology and sensing to quantum computing. However, they are typically obtained using exotic materials with high density inductance such as Josephson junctions, superconducting nanowires or twisted two-dimensional ma...

Toward Multi-Fidelity Machine Learning Force Field for Cathode Materials

Guangyi Dong, Zhihui Wang • Published: 2025-11-14
Machine learning force fields (MLFFs), which employ neural networks to map atomic structures to system energies, effectively combine the high accuracy of first-principles calculation with the computational efficiency of empirical force fields. They are widely used in computational materials simulations. However, the development and application of MLFFs for lithium-ion battery cathode materials rem...

UFO$^3$: Weaving the Digital Agent Galaxy

Chaoyun Zhang, Liqun Li, He Huang, Chiming Ni, Bo Qiao, Si Qin, Yu Kang, Minghua Ma, Qingwei Lin, Saravan Rajmohan, Dongmei Zhang • Published: 2025-11-14
Large language model (LLM)-powered agents are transforming digital devices from passive tools into proactive intelligent collaborators. However, most existing frameworks remain confined to a single OS or device, making cross-device workflows brittle and largely manual. We present UFO$^3$, a system that unifies heterogeneous endpoints, desktops, servers, mobile devices, and edge, into a single orch...

The Riemann Hypothesis Emerges in Dynamical Quantum Phase Transitions

ShiJie Wei, Yue Zhai, Quanfeng Lu, Wentao Yang, Pan Gao, Chao Wei, Junda Song, Franco Nori, Tao Xin, GuiLu Long • Published: 2025-11-14
The Riemann Hypothesis (RH), one of the most profound unsolved problems in mathematics, concerns the nontrivial zeros of the Riemann zeta function. Establishing connections between the RH and physical phenomena could offer new perspectives on its physical origin and verification. Here, we establish a direct correspondence between the nontrivial zeros of the zeta function and dynamical quantum phas...

Boosting Sparsity in Graph Decompositions with QAOA Sampling

George Pennington, Naeimeh Mohseni, Oscar Wallis, Francesca Schiavello, Stefano Mensa, Corey O'Meara, Giorgio Cortiana, Víctor Valls • Published: 2025-09-12
We study the problem of decomposing a graph into a weighted sum of a small number of matchings, a task that arises in network resource allocation problems such as peer-to-peer energy exchange. Computing such decompositions is challenging for classical algorithms, even for small instances. To address this problem, we propose E-FCFW, a hybrid quantum-classical algorithm based on the Fully-Corrective...

📚 Highlighted Papers

−

Quantum enhanced Monte Carlo simulation for photon interaction cross sections

Authors: Euimin Lee, Sangmin Lee, Shiho Kim • Submitted: Submitted • arXiv: arXiv:2502.14374
Abstract: …as the dominant attenuation mechanism, we demonstrate that our approach reproduces classical probability distributions with high fidelity. Simulation results obtained via the IBM Qiskit quantum simulator reveal a quadratic speedup in amplitude estimation compared to conventional Monte C...

Time-adaptive single-shot crosstalk detector on superconducting quantum computer

Authors: Haiyue Kang, Benjamin Harper, Muhammad Usman, Martin Sevior • Submitted: Submitted • arXiv: arXiv:2502.14225
Abstract: …in two scenarios: simulation using an artificial noise model with gate-induced crosstalk and always-on idlings channels; and the simulation using noise sampled from an IBM quantum computer parametrised by the reduced HSA error model. The presented results show our method's efficacy hing...

Quantum simulation of a qubit with non-Hermitian Hamiltonian

Authors: Anastashia Jebraeilli, Michael R. Geller • Submitted: Submitted • arXiv: arXiv:2502.13910
Abstract: …-broken regime surrounding an exceptional point. Quantum simulations are carried out using IBM superconducting qubits. The results underscore the potential for variational quantum circuits and machine learning to push the boundaries of quantum simulation, offering new methods for explor...

Comment on "Energy-speed relationship of quantum particles challenges Bohmian mechanics"

Aurélien Drezet, Dustin Lazarovici, Bernard Michael Nabet
In their recent paper [Nature 643, 67 (2025)], Sharaglazova et al. report an optical microcavity experiment yielding an "energy-speed relationship" for quantum particles in evanescent states, which they infer from the observed population transfer between two coupled waveguides. The authors argue tha...