🚀 QuantumBoom

Daily Quantum Computing Research & News • November 16, 2026 • 13:59 CST

Join the QuantumBoom Digest

Never miss out the next quantum breakthrough.

📊 Today's Data Collection

Highlights: 3 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

−

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

Scalable topological quantum computing based on Sine-Cosine chain models

A. Lykholat, G. F. Moreira, I. R. Martins, D. Sousa, A. M. Marques, R. G. Dias • Published: 2026-03-26
We propose a scalable framework for quantum information processing based on Matryoshka-type sine-cosine chains, a hierarchy of one-dimensional chiral-symmetric lattices obtained by repeated ($P$ times) square-root construction starting from the Su-Schrieffer-Heeger (SSH) chain. A chain of order $P$ can host $2^{P+2}-2$ protected edge states, so a single physical device can encode a qudit of equiva...

Minimizing classical resources in variational measurement-based quantum computation for generative modeling

Arunava Majumder, Hendrik Poulsen Nautrup, Hans J. Briegel • Published: 2026-04-13
Measurement-based quantum computation (MBQC) is a framework for quantum information processing in which a computational task is carried out through one-qubit measurements on a highly entangled resource state. Due to the indeterminacy of the outcomes of a quantum measurement, the random outcomes of these operations, if not corrected, yield a variational quantum channel family. Traditionally, this r...

Lagrange: Operating Italy's First Publicly-Accessible Quantum Computer for Research and Education

Paolo Viviani, Fabrizio Bertone, Giacomo Vitali, Emanuele Dri, Federico Stirano, Giuseppe Caragnano, Francesco Lubrano, Marco Cipollini, Martina Giovalli, Chiara Vercellino, Alberto Scionti, Virginia Ajani, Antonino Nespola, Olivier Terzo, Matteo Cocuzza, Bartolomeo Montrucchio, Giovanna Turvani, Gianluca Bertaina, Marco Coisson, Davide Calonico, Fabrizio Pirri, Pietro Asinari • Published: 2026-04-23
We describe the design, implementation, and nine-month operational experience of the software management stack for Lagrange, an IQM Spark five-qubit superconducting quantum computer jointly acquired by LINKS Foundation, Politecnico di Torino and the Italian National Institute of Metrological Research (INRiM), and managed by LINKS. Lagrange is, to our knowledge, the first quantum computer in Italy ...

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

Implementation of non-local arbitrary two-qubit controlled gates via geometric quantum computation with Rydberg anti-blockade

Le-Jiang Yu, Jia Zheng, Kun Pu, Chao Gao • Published: 2026-03-18
In the context of Rydberg anti-blockade, this paper proposes a new scheme for a high-fidelity controlled-unitary gate based on non-adiabatic holonomic quantum computation. Under specific detuning and interaction conditions, the scheme achieves a suitable evolution path for non-adiabatic holonomic quantum computation through reverse engineering of pulse parameters. This scheme can implement arbitra...

Quantum Data Processing Unit for Neutral-Atom Quantum Computers

Pranav Srinivas Murali, Russell Marroquin Solares, Warren Zhou, Wanda Hou, Anil Bilgin, Yi-Zhuang You • Published: 2026-11-13
Quantum computers need real-time classical processing to convert measurement data into feedback within device-specific timing constraints. We introduce the quantum data processing unit (QDPU), an architecture between a quantum device and its controller. Its core is a machine-learned quantum data model (QDM), adapted to the measurement response and noise characteristics of the device. We implement ...

Embedded quantum computing for many-body surface reaction

Dedong Wan, Xiaopeng Li, Yi Fan, Jie Liu, Xiongzhi Zeng, Zhenyu Li • Published: 2026-07-29
Predictive simulations of catalytic interfaces require correlated electronic-structure treatments that describe localized chemical transformations while retaining the influence of the extended metallic environment. We introduce QC-DFET, a quantum-computing density-functional embedding framework that maps surface-reaction active spaces to compact, environment-aware qubit Hamiltonians. A reaction-co...

Persistent-mediator architecture for universal fault-tolerant quantum computation with color codes

Zhi-Cheng He, Jingbo Wang, Dong E. Liu • Published: 2026-11-12
Two-dimensional color codes provide transversal Clifford gates, whereas suitable three-dimensional codes provide a transversal $T$ gate. Representative cross-dimensional schemes either switch the computational encoding or consume a 3D encoded state. Reusing the same protected 3D block would remove repeated auxiliary-state preparation and terminal readout, raising a central question: can the 3D mod...

Accelerating Distributed Variational Quantum Computing over Wireless Networks with Incentive Mechanism Design

Shaba Shaon, Dinh C. Nguyen, Octavia Dobre • Published: 2026-11-12
Distributed variational quantum computing (DVQC) appears as the emerging paradigm to address the limitations of near-term quantum devices by decomposing large parameterized quantum circuits (PQCs) into smaller subcircuits executed across multiple quantum processors. In this context, how to incentivize quantum processors to participate actively is crucial for accelerating DVQC, yet remains largely ...

🏢 Company Papers

−

Dissipation as a Resource for Entanglement via High-Spin Mediator Purification

Ellen Martins Fernandes, Fabricio Macedo de Souza • Published: 2026-11-13
We study entanglement generation between two spin qubits mediated by a single, thermally mixed, high-spin ($S=5/2$) magnetic impurity, using the Lindblad master equation to compare coherent and dissipative control of the mediator. We show that no coherent drive, however strong or resonant, can purify the mediator beyond its thermal value --- a direct consequence of unitary evolution exactly preser...

VellSSLH: Sound Type-Guided Selective Speculative Load Hardening for LLVM IR

Swarn Priya • Published: 2026-11-13
Constant-time cryptographic programs written in C can still leak secrets during speculative execution. Mispredicted branches may allow instructions to access secret data and expose it through observable behavior. Speculative load hardening (SLH) addresses these leaks, but protecting values unnecessarily can introduce significant runtime overhead. We present VellSSLH, which selectively inserts spec...

Tessa: Encoding Classical Data Across an Entire Quantum Processor

Daniel Bultrini • Published: 2026-11-13
We present Tessa, a hardware-aware, device-wide scheme to encode classical data on quantum computers. We use it to experimentally encode and decode up to $1568$ real values using IBM's Phoenix and Fez quantum computers on a variety of data. Tessa's construction is an extension of QPIXL and QCrank. However, it checkerboards address and data qubits across a coupling graph with neighbouring data qubi...

Transfer-Matrix Calculus for Infinite Matrix Product States

Qi Yang, Philippe Corboz • Published: 2026-11-13
Long-range interactions, from the Coulomb repulsion between electrons to the power-law interactions of trapped ions and Rydberg atoms, are widespread in quantum many-body physics. For infinite systems, however, MPS algorithms, the standard classical reference in one dimension, conventionally rely on a computational compromise: replacing these interactions by fitted sums of exponentials. We develop...

They Will See Johnny's Message: A Measurement Study of Post-Quantum Cryptography Across Email Delivery Paths

Jaehwan Park, Sunghyun Park, Kevin Nam, Doowon Kim • Published: 2026-10-26
Harvest-now, decrypt-later (HNDL) attacks make the transition to post-quantum cryptography (PQC) urgent for email. This paper presents a systematic measurement that jointly examines PQC deployment across email service stages, negotiation by communicating peers, and usable message encryption. Endpoint-level support alone does not establish PQC readiness across email workflows because submission, re...

Phase-resolved spin-orbit exciton transfer with dressed quantum encodings

Yücel Yıldırı m, Özgür Polat, Cengiz Şen • Published: 2026-11-13
A quantum simulation of a material runs on a register much smaller than the electronic problem behind it, and the map between the two decides what a measured correlation means. We study this map for spin--orbit exciton transfer across an Ir--Ir bond of a LiIrF$_6$-derived model. Exact references show that a bare product-state encoding has an amplitude floor above a 0.02 state tolerance at sampled ...

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

Evaluating Human Sensitivity to Gender Biased AI-Generated Content through Human Assessment of Google's Autocomplete Function

Tamara Serrano, Nikoleta Pantelidou, Raquel Montero, Natalia Moskvina, Paolo Morosi, Evelina Leivada • Published: 2026-11-13
Large Language Models (LLMs) are increasingly present, but their effects on human users remain underexplored. We tested whether AI-attributed information influences views regarding gender-related statements, a domain where biases are pervasive. Spanish-speaking participants recruited through Prolific evaluated biased statements derived from Google's autocomplete function and human-authored, non-bi...

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