🚀 QuantumBoom

Daily Quantum Computing Research & News • November 18, 2026 • 12:38 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
Featured papers: 5 papers collected
Total sources: 6 data feeds processed

🌟 Highlights

−

📰 News Items

−

🚀 Flagship Papers and Tools

−

🛠️ QuantumGraph

Learning Tool
QuantumGraph organizes quantum computing concepts into a connected graph, where each topic links to related ideas and prerequisites, making it easy to see how concepts fit together and build knowledge step by step.
Breakthrough

Surface code scaling on heavy‑hex superconducting quantum processors

USC • 21-Oct-25
Demonstrating subthreshold scaling of a surface-code quantum memory on hardware whose native connectivity does not match the code remains a central challenge. We address this on IBM heavy-hex superconducting processors by co-designing the code embedding and control: a depth-minimizing SWAP-based "fold-unfold" embedding that uses bridge ancillas, together with robust, gap-aware dynamical decoupling (DD). On Heron-generation devices we perform anisotropic scaling from a uniform distance 3 code to anisotropic distance (dx,dz) = (3,5) and (5,3) codes. We find that increasing dz (dx) improves the protection of Z-basis (X-basis) logical states across multiple quantum error correction cycles. Even if global subthreshold code scaling for arbitrary logical initial states is not yet achieved, we argue that it is within reach with minor hardware improvements. We show that DD plays a major role: it suppresses coherent ZZ crosstalk and non-Markovian dephasing that accumulate during idle gaps on heavy-hex layouts, and it eliminates spurious subthreshold claims that arise when scaled codes without DD are compared against smaller codes with DD. To quantify performance, we derive an entanglement fidelity metric that is computed directly from X- and Z-basis logical-error data and provides per-cycle, SPAM-aware bounds. The entanglement fidelity metric reveals that widely used single-parameter fits used to compute suppression factors can mischaracterize or obscure code performance when their assumptions are violated; we identify the strong assumptions of stationarity, unitality, and negligible logical SPAM required for those fits to be valid and show that they do not hold for our data. Our results establish a concrete path to robust tests of subthreshold surface-code scaling under biased, non-Markovian noise by integrating QEC with optimized DD on non-native architectures.
Overview

Architectural mechanisms of a universal fault-tolerant quantum computer

QuEra Computing, Harvard, MIT and others • 25-Jun-25
Quantum error correction (QEC) is believed to be essential for the realization of large-scale quantum computers. However, due to the complexity of operating on the encoded `logical' qubits, understanding the physical principles for building fault-tolerant quantum devices and combining them into efficient architectures is an outstanding scientific challenge. Here we utilize reconfigurable arrays of up to 448 neutral atoms to implement all key elements of a universal, fault-tolerant quantum processing architecture and experimentally explore their underlying working mechanisms. We first employ surface codes to study how repeated QEC suppresses errors, demonstrating 2.14(13)x below-threshold performance in a four-round characterization circuit by leveraging atom loss detection and machine learning decoding. We then investigate logical entanglement using transversal gates and lattice surgery, and extend it to universal logic through transversal teleportation with 3D [[15,1,3]] codes, enabling arbitrary-angle synthesis with logarithmic overhead. Finally, we develop mid-circuit qubit re-use, increasing experimental cycle rates by two orders of magnitude and enabling deep-circuit protocols with dozens of logical qubits and hundreds of logical teleportations with [[7,1,3]] and high-rate [[16,6,4]] codes while maintaining constant internal entropy. Our experiments reveal key principles for efficient architecture design, involving the interplay between quantum logic and entropy removal, judiciously using physical entanglement in logic gates and magic state generation, and leveraging teleportations for universality and physical qubit reset. These results establish foundations for scalable, universal error-corrected processing and its practical implementation with neutral atom systems.
Breakthrough

Constructive interference at the edge of quantum ergodic dynamics

Google Quantum AI and Collaborators • 11-Jun-25
Quantum observables in the form of few-point correlators are the key to characterizing the dynamics of quantum many-body systems. In dynamics with fast entanglement generation, quantum observables generally become insensitive to the details of the underlying dynamics at long times due to the effects of scrambling. In experimental systems, repeated time-reversal protocols have been successfully implemented to restore sensitivities of quantum observables. Using a 103-qubit superconducting quantum processor, we characterize ergodic dynamics using the second-order out-of-time-order correlators, OTOC. In contrast to dynamics without time reversal, OTOC are observed to remain sensitive to the underlying dynamics at long time scales. Furthermore, by inserting Pauli operators during quantum evolution and randomizing the phases of Pauli strings in the Heisenberg picture, we observe substantial changes in OTOC values. This indicates that OTOC is dominated by constructive interference between Pauli strings that form large loops in configuration space. The observed interference mechanism endows OTOC with a high degree of classical simulation complexity, which culminates in a set of large-scale OTOC measurements exceeding the simulation capacity of known classical algorithms. Further supported by an example of Hamiltonian learning through OTOC, our results indicate a viable path to practical quantum advantage.
Breakthrough

Demonstrating real-time and low-latency quantum error correction with superconducting qubits

Rigetti Computing and Riverlane • 7-Oct-24
Quantum error correction (QEC) will be essential to achieve the accuracy needed for quantum computers to realise their full potential. The field has seen promising progress with demonstrations of early QEC and real-time decoded experiments. As quantum computers advance towards demonstrating a universal fault-tolerant logical gate set, implementing scalable and low-latency real-time decoding will be crucial to prevent the backlog problem, avoiding an exponential slowdown and maintaining a fast logical clock rate. Here, we demonstrate low-latency feedback with a scalable FPGA decoder integrated into the control system of a superconducting quantum processor. We perform an 8-qubit stability experiment with up to decoding rounds and a mean decoding time per round below, showing that we avoid the backlog problem even on superconducting hardware with the strictest speed requirements. We observe logical error suppression as the number of decoding rounds is increased. We also implement and time a fast-feedback experiment demonstrating a decoding response time of for a total of measurement rounds. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments that go beyond purely keeping logical qubits alive and into demonstrating building blocks of fault-tolerant computation, such as lattice surgery and magic state teleportation.
Overview

IBM Quantum Computers: Evolution, Performance, and Future Directions

Muhammad AbuGhanem • 17-Sep-24
Quantum computers represent a transformative frontier in computational technology, promising exponential speedups beyond classical computing limits. IBM Quantum has led significant advancements in both hardware and software, providing access to quantum hardware via IBM Cloud® since 2016, achieving a milestone with the world's first accessible quantum computer. This article explores IBM's quantum computing journey, focusing on the development of practical quantum computers. We summarize the evolution and advancements of IBM Quantum's processors across generations, including their recent breakthrough surpassing the 1,000-qubit barrier. The paper reviews detailed performance metrics across various hardware, tracing their evolution over time and highlighting IBM Quantum's transition from the noisy intermediate-scale quantum (NISQ) computing era towards fault-tolerant quantum computing capabilities.
Overview

Comparison of Superconducting NISQ Architectures

Lincoln Laboratory, Massachusetts Institute of Technology • 3-Sep-24
Advances in quantum hardware have begun the noisy intermediate-scale quantum (NISQ) computing era. A pressing question is: what architectures are best suited to take advantage of this new regime of quantum machines? We study various superconducting architectures including Google's Sycamore, IBM's Heavy-Hex, Rigetti's Aspen and Ankaa in addition to a proposed architecture we call bus next-nearest neighbor (busNNN). We evaluate these architectures using benchmarks based on the quantum approximate optimization algorithm (QAOA) which can solve certain quadratic unconstrained binary optimization (QUBO) problems. We also study compilation tools that target these architectures, which use either general heuristic or deterministic methods to map circuits onto a target topology defined by an architecture.
Breakthrough

Quantum error correction below the surface code threshold

Google Quantum AI and Collaborators • 24-Aug-24
Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. In this work, we present two surface code memories operating below this threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed...Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.

📄 Technology Papers

−

Performance of Fusion-Based Quantum Computing with Imperfect Photon Indistinguishability

Katia Hakem, Grégoire de Gliniasty, Nathan Shettell, Paul Hilaire, Stephen C. Wein • Published: 2026-11-17
Fusion-based quantum computation (FBQC) is a promising route to fault-tolerant photonic quantum computing, connecting small entangled resource states through linear-optical fusion measurements. While logical encoding can substantially improve resilience to photon loss, whether these benefits extend to other noise remain an open question. In this work, we show that this is not generally the case wh...

Efficient Iterative Symmetrization algorithm for quantum computing and hadron applications

Nahia J. Dios-Bilbao, Adrián Castaño-García, J. J. Gálvez-Viruet, Felipe J. Llanes-Estrada, Mario Logrosán-Álvarez, Nicolás M. Arenaza • Published: 2026-11-13
Efficient algorithms for the (anti)symmetrization of quantum registers are necessary for upcoming few- and many-body physics applications, from atomic to particle-physics scales. We propose a recursive algorithm (anti)symmetrizing the last particle added to memory, each time one is created or destroyed, respect to the rest of already (anti)symmetrized ones. Given a generalized Dicke state (GDS) of...

Perturbative Recovery of Stabilizer-Subspace Correlations for Quantum Computational Chemistry

Qianjun Yao, Jie Liu, He Li • Published: 2026-11-17
Stabilizer-based subspace methods can substantially reduce the quantum resources required for electronic structure calculations, but the resulting projection neglects Hamiltonian couplings to configurations outside the retained subspace. In this work, we introduce Stabilizer-Subspace Perturbation Theory (SSPT) to recover the associated correlation contributions, using the Contextual Subspace Varia...

Simulating Quantum Computation Using Probabilistic Programming

Yafei Yang, Chung-chieh Shan • Published: 2026-11-16
Developing quantum programs requires not only running them on quantum hardware but also simulating them on classical hardware. Because the meaning of a quantum program can be defined in terms of state vectors, it can be viewed as a form of weighted nondeterminism and simulated using any implementation of probabilistic programming that supports complex or at least negative weights. In this study, w...

AI-Enabled Qubit Loss Detection and Replenishment Strategy for Atom Array Quantum Computing

Yuqing Wang, Xiaotian Nie, Jiale Dai, Zhongyi Ni, Tao Zhang, Hui Zhai, Linghui Chen • Published: 2026-04-15
Qubit loss is a major source of error in atom-array quantum computing and invalidates the algebraic structure of the standard stabilizer formalism for quantum error-correcting codes. On the one hand, it complicates decoding; on the other hand, it introduces tochastic flicker patterns in stabilizers as a hallmark of qubit loss. Here, we develop an artificial-intelligence-enabled decoder based on a ...

Stabilizer-Restricted Antidistinguishability in Quantum Computation with Magic States

Selman Ipek • Published: 2026-11-16
An antidistinguishing measurement for a family of preparations excludes at least one preparation for every possible outcome, constraining 'classical' representations of these processes, known as ontological models. We develop this connection within quantum computing with magic states (QCM), a universal model of quantum computation. Our constructions use adaptive Pauli measurements on tensor produc...

Quantum Computing-Based Wasserstein Generative Adversarial Networks for Airfoil Parameterization

Abdur Rahman Ovy, Xiaosong Du • Published: 2026-11-16
Airfoil geometry parameterization is essential in aerodynamic design optimization. Optimization search in the large space suffers from low efficiency and modest feasible region, which could further incur failures to convergence. Generative adversarial networks (GAN), aiming to learn the statistical distribution of existing data, pave a new avenue for shape generation and airfoil parameterization. ...

Double-Randomized Quantum Singular Value Transformations For Early Fault-Tolerant Quantum Computers

Joel Bierman, Pawan Poudel, Yuan Liu • Published: 2026-11-13
The Quantum Singular Value Transformation (QSVT) is an algorithmic framework which encompasses a wide range of problems, including Hamiltonian dynamics, ground state preparation, Gibbs state preparation, amplitude amplification, and matrix inversion. For many areas of scientific interest such as quantum chemistry and condensed matter, the circuit depth of the block-encoding subroutine in QSVT can ...

Universal Quantum Computation in a Wigner's Friend Framework

Martí Cladera-Rosselló, Sebastian Horvat, Borivoje Dakić, Lee A. Rozema, Philip Walther • Published: 2026-11-13
The Wigner's Friend thought experiment illustrates a core tension in quantum mechanics: an observer inside an isolated laboratory (the Friend) measures a definite outcome, while an external observer (Wigner) describes the laboratory as a coherent superposition. Here we show that this discrepancy, usually studied as a conflict between descriptions, has a direct computational consequence. We namely ...

Quantum computational spectroscopy of complex resonances and optical residues

Payman Mahmoudi, Jiate Luo, Chonghao Zhai, Qiang Shi, Alexander Yosifov, Jinzhao Sun • Published: 2026-11-13
Optical spectra of dissipative molecular systems depend on both complex resonance energies and the way each resonance couples to an optical probe. In a non-Hermitian description, these con- tributions are determined by complex residues involving left and right eigenvectors. We introduce a quantum protocol that reconstructs the resonance poles and their biorthogonal optical residues within a common...

🏢 Company Papers

−

Nonlinearity-preserving quantum simulation of flows in the early fault-tolerant regime

Hansol Noh, Unam Oh, Sangkyu Baek, Doyeol, Ahn • Published: 2026-11-17
Ensemble prediction of nonlinear dynamics propagates a probability density whose linear transport equation retains the nonlinear drift, but grid-dependent circuit costs leave end-to-end feasibility in early fault-tolerant quantum computing unresolved. We couple polynomial reduced-order models fitted by sparse identification of nonlinear dynamics to Walsh-synthesized Koopman-von Neumann (KvN) trans...

Machine learning quantum data to accelerate quantum Monte Carlo

Tong Jiang, Andrew Zhao, Shashwat Kumar, Jigyasa Nigam, Eliott Rosenberg, Ryan Babbush, Andrew D. Baczewski, William J. Huggins, Joonho Lee • Published: 2026-11-05
Simulating strongly correlated electrons in molecules and materials remains a central goal for quantum computing. A promising strategy uses quantum processors to prepare trial wavefunctions that guide classical quantum Monte Carlo (QMC). However, the enormous computational cost of repeatedly processing quantum measurements has severely limited the practical scalability of this approach. Here, we o...

WIP: Exploring Student-Created AI Agents and Instructional Videos to Foster Engagement in Computing Education

Lucas G. Zangari, Olufisayo Omojokun, Pedro Guillermo Feijóo-García • Published: 2026-11-17
This work-in-progress (WIP) research-to-practice study examines the use of student-created artifacts to promote active learning in a large undergraduate Software Design and Engineering (SWE) course. Active learning strategies have been shown to significantly enhance student engagement, comprehension, and motivation, particularly in computing education. In this work, we explore the use of student-c...

RoadAnnoter: An AI-Assisted Desktop Tool for Semantic Segmentation Annotation of Road-Scene Images

Nazmul Haque, Arnob Protim Roy • Published: 2026-11-17
Accurate semantic segmentation of road-scene images is essential for road safety research; however, polygon-level annotation remains labor-intensive and limits labelled dataset development. This study presents RoadAnnoter v1.0, an open-source desktop application integrating six human-in-the-loop annotation modes: manual polygon delineation, SAM Prompt, Smart Select, Edge Fill, pretrained semantic ...

Cancellation of cryocooler-induced vibration in trapped-ion systems

Alexandra Plocki, Kyle Debry, Agustin Valdes Martinez, Isaac L. Chuang, Robert McConnell, Colin D. Bruzewicz • Published: 2026-11-17
Mechanical cryocoolers offer numerous benefits for the operation of vacuum systems containing trapped atomic ions. However, the fidelity of laser-based gates can be degraded by phase noise induced by the cryocooler vibrations. We present a feed-forward vibration-cancellation system that directly measures inner shield displacement with an auxiliary interferometer and applies a compensating phase co...

Molecular energies from sparse quantum prolate diagonalization on a trapped-ion quantum processor

Davide Castaldo, Marvin Kronenberger, Marek Miller, Sélène Forget, Gemma C. Solomon, Kresten Lindorff-Larsen, Matthias Christandl, Markus Reiher • Published: 2026-11-17
We introduce sparse quantum prolate diagonalization (sparse QPD), which combines the original formulation of QPD [Phys. Rev. Res., 8(3), 033177, (2026)] with compressed sensing to exploit Hamiltonian spectrum sparsity for molecular systems. We show that sparse sampling reduces the sample complexity of QPD from $\mathcal{O}(N_s)$ to $\mathcal{O}(\log N_s)$, where $N_s$ is the number of sampled poin...

Groups of AI agents underuse resources despite shared evidence of increased capacity

Takahiro Ezaki, Naoto Imura, Katsuhiro Nishinari • Published: 2026-11-17
When AI agents share limited resources, such as computing services or public infrastructure, their individual choices affect how much work they complete as a group. Can sharing evidence of what is available let a group make full use of its resources after capacity changes? We tested this with language-model agents choosing between two simulated servers. One server recovered while its status report...

Spin-Polarized Transport Tomography of a Quantum-Dot Spin Qubit via Ferromagnetic Leads

M. B. Sambú, L. Sanz, F. M. Souza • Published: 2021-01-26
We propose a theoretical protocol for reconstructing the density matrix of a single-electron spin qubit using spin-polarized transport. The system consists of a quantum dot coupled to ferromagnetic reservoirs and subject to a magnetic field lying in the $xy$ plane of the Bloch sphere. Spin-dependent tunneling events measured along the $x\pm$, $y\pm$, and $z\pm$ quantization axes give rise to proba...

📚 BrowseAI Featured 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 Car...

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 hinges...

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 explorin...

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...