Overcoming Scaling Issues in Quantum Numerical Methods

The more qubits we add, the more control lines we need—or do we? One of the big challenges in scaling superconducting quantum processors is the sheer number of control lines needed to manipulate the qubits. These lines carry the microwave pulses that drive operations like single- and two-qubit gates. But with thousands or even millions of qubits in future systems, fitting all those lines into a cryogenic system becomes a serious problem. 𝗙𝗿𝗲𝗾𝘂𝗲𝗻𝗰𝘆-𝗺𝘂𝗹𝘁𝗶𝗽𝗹𝗲𝘅𝗲𝗱 𝗰𝗼𝗻𝘁𝗿𝗼𝗹 offers a clever solution. Instead of dedicating a separate control line to each qubit, multiple qubits share a single line. Each qubit is uniquely addressed by a pulse tuned to its specific frequency. However, a problem arises when we send multiple control pulses—typically microwaves with a Gaussian envelope—down the same line. These pulses have broad frequency profiles, which can unintentionally excite nearby qubits. This limits how densely qubit frequencies can be packed and reduces the gate fidelity. Yet, there seems to be a new solution to this problem, referred to as 𝗦𝗲𝗹𝗲𝗰𝘁𝗶𝘃𝗲 𝗘𝘅𝗰𝗶𝘁𝗮𝘁𝗶𝗼𝗻 𝗣𝘂𝗹𝘀𝗲𝘀 (𝗦𝗘𝗣).  Instead of using Gaussian pulses, SEP carefully shapes the frequency spectrum of the pulse. The key idea is to create 𝗻𝘂𝗹𝗹 𝗽𝗼𝗶𝗻𝘁𝘀—frequencies where the pulse has negligible energy—at the frequencies of the non-target qubits. This in turn isolates the target qubit, reducing unintended interactions, even when qubit frequencies are closely spaced. A recent experiment has demonstrated that SEP: - 𝗥𝗲𝗱𝘂𝗰𝗲𝘀 𝘂𝗻𝗶𝗻𝘁𝗲𝗻𝗱𝗲𝗱 𝗾𝘂𝗯𝗶𝘁 𝗲𝘅𝗰𝗶𝘁𝗮𝘁𝗶𝗼𝗻𝘀 from 10% (Gaussian pulses) to just 0.2%. - Maintains 𝗵𝗶𝗴𝗵 𝗴𝗮𝘁𝗲 𝗳𝗶𝗱𝗲𝗹𝗶𝘁𝗶𝗲𝘀, averaging 99.8% for the target qubit. This technique is highly promising, as it provides a straightforward method to 𝗰𝗼𝗻𝘁𝗿𝗼𝗹 𝗺𝗼𝗿𝗲 𝗾𝘂𝗯𝗶𝘁𝘀 𝗼𝗻 𝘁𝗵𝗲 𝘀𝗮𝗺𝗲 𝗹𝗶𝗻𝗲. New pulse shaping techniques like SEP may sometimes fly under the radar, but they are essential for improving gate fidelity and enabling scalability. Advancements like these are a powerful reminder of how much innovation is still happening at the fundamental level of quantum control. 📸 Image Credits: Matsuda et al. (2025)

I've been tackling the "barren plateaus" problem in QML, where training stalls inside vast search spaces. My latest experiment in fraud detection revealed a fascinating, counterintuitive solution. I discovered that increasing my quantum circuit's entanglement didn't smooth the path to a solution, but it created a more complex and rugged loss landscape (using a dressed quantum circuit scheme). Taking advantage of the hyvis library, I visualized this effect (thanks to the colleagues of JoS QUANTUM for putting this together), as shown in the first image of the post. The landscape evolves from a simple valley to a rich, expressive terrain (but potentially more complex for an optimizer). But did this complexity hurt performance? Usually that should be the case, but the exact opposite happened. The image shows the model with the most complex landscape (8 CNOTs by layer) not only learned faster (lower loss) but also achieved the highest accuracy (AUC) on the validation set and later in the test set. There is no free lunch on this. We can't generalize from these examples. This added complexity, or "expressivity," is precisely what allowed the model to find a superior solution in this case and avoid getting stuck, but it is not the norm. My biggest conclusion here It seems that for QML, the key to real-world performance isn't avoiding complexity, but leveraging it. To be able to extract permanent benefits, we should follow approaches like what Dra. Eva Andres Nuñez is researching by finding the way to use the extra complexity of entanglement to be able to find the global minima and not get stuck in our quantum optimization procedures using the theory behind SNNs. Here details about the hyvis library in GitHub: https://lnkd.in/dzqcFvDE An insightful paper from Eva about mixing SNNs and quantum: https://lnkd.in/dXDiuCBH Same subject from Jiechen Chen: https://lnkd.in/d-Uyngef #quantumcomputing #machinelearning #ai #datascience #frauddetection #ml #qml

Freshly published in PRX Quantum today: https://lnkd.in/gpKVEVci In this work, completed by my PhD student @Maxwell West with Prof Martin Sevior and @Jamie Heredge, we combine the techniques of geometric QML with the Lie-algebraic theory of model trainability to develop a novel class of QML architectures that respect (two-dimensional) rotation symmetry, and we rigorously prove that a subset of our models are free from the scaling issues that plague their generic counterparts. Furthermore, our numerical experiments indicate that these models can drastically outperform generic ansatze in practice. By restricting to a meaningful, symmetry-informed subset of Hilbert space, our proposed architectures join the (short) list of QML models that enjoy provably favorable scaling guarantees. Their construction is guided by ideas from representation theory, which can be applied to future model development. CSIRO's Data61 American Physical Society #quantummachinelearning #quantumcomputing

Quantum Linear System Solvers: A Survey of Algorithms and Applications https://lnkd.in/e8fsHKgP Solving linear systems of equations plays a fundamental role in numerous computational problems from different fields of science. The widespread use of numerical methods to solve these systems motivates investigating the feasibility of solving linear systems problems using quantum computers. In this work, we provide a survey of the main advances in quantum linear systems algorithms, together with some applications. We summarize and analyze the main ideas behind some of the algorithms for the quantum linear systems problem in the literature. The analysis begins by examining the Harrow-Hassidim-Lloyd (HHL) solver. We note its limitations and reliance on computationally expensive quantum methods, then highlight subsequent research efforts which aimed to address these limitations and optimize runtime efficiency and precision via various paradigms. We focus in particular on the post-HHL enhancements which have paved the way towards optimal lower bounds with respect to error tolerance and condition number. By doing so, we propose a taxonomy that categorizes these studies. Furthermore, by contextualizing these developments within the broader landscape of quantum computing, we explore the foundational work that have inspired and informed their development, as well as subsequent refinements. Finally, we discuss the potential applications of these algorithms in differential equations, quantum machine learning, and many-body physics.

Quantum Scaling Recipe: ARQUIN Provides Framework for Simulating Distributed Quantum Computing Systems Key Insights: • Researchers from 14 institutions collaborated under the Co-design Center for Quantum Advantage (C2QA) to develop ARQUIN, a framework for simulating large-scale distributed quantum computers across different layers. • The ARQUIN framework was created to address the “challenge of scale”—one of the biggest hurdles in building practical, large-scale quantum computers. • The results of this research were published in the ACM Transactions on Quantum Computing, marking a significant step forward in quantum computing scalability research. The Multi-Node Quantum System Approach: • The research, led by Michael DeMarco from Brookhaven National Laboratory and MIT, draws inspiration from classical computing strategies that combine multiple computing nodes into a single unified framework. • In theory, distributing quantum computations across multiple interconnected nodes can enable the scaling of quantum computers beyond the physical constraints of single-chip architectures. • However, superconducting quantum systems face a unique challenge: qubits must remain at extremely low temperatures, typically achieved using dilution refrigerators. The Cryogenic Scaling Challenge: • Dilution refrigerators are currently limited in size and capacity, making it difficult to scale a quantum chip beyond certain physical dimensions. • The ARQUIN framework introduces a strategy to simulate and optimize distributed quantum systems, allowing quantum processors located in separate cryogenic environments to interact effectively. • This simulation framework models how quantum information flows between nodes, ensuring coherence and minimizing errors during inter-node communication. Implications of ARQUIN: • Scalability: ARQUIN offers a roadmap for scaling quantum systems by distributing computations across multiple quantum nodes while preserving quantum coherence. • Optimized Resource Allocation: The framework helps determine the optimal allocation of qubits and operations across multiple interconnected systems. • Improved Error Management: Distributed systems modeled by ARQUIN can better manage and mitigate errors, a critical requirement for fault-tolerant quantum computing. Future Outlook: • ARQUIN provides a simulation-based foundation for designing and testing large-scale distributed quantum systems before they are physically built. • This framework lays the groundwork for next-generation modular quantum architectures, where interconnected nodes collaborate seamlessly to solve complex problems. • Future research will likely focus on enhancing inter-node quantum communication protocols and refining the ARQUIN models to handle larger and more complex quantum systems.

Scaling quantum computing isn’t just about building better qubits, it’s about designing better architectures. ⚛️ Last week Q-CTRL announced Q-NEXUS, a heterogeneous quantum computing architecture inspired by a familiar idea from classical computing: Separating the processor from memory so each component can focus on what it does best.💡 The motivation is compelling. In algorithms like Shor factoring, qubits remain idle up to 97% of the time. Holding idle data in expensive, actively error-corrected hardware is enormously wasteful. Instead, Q-NEXUS routes idle quantum data to dedicated memory modules which utilize different qubit types and error-correcting codes matched to the task. The result is striking, yielding up to a 138× reduction in physical qubit overhead and 551× reduction in algorithmic error, compared to a monolithic baseline with comparable runtime. For RSA-2048 factorization, this modular approach reduces the requirement from 900k physical qubits to 190k, with a runtime under 10 days. Perhaps most inspiring is the broader implication that there may not be a single "winning" qubit. Superconducting qubits for fast processing, trapped ions or neutral atoms for memory, photonics for interconnects, each playing to their respective strengths within a unified architecture. This philosophy reframes quantum scaling from a race to build one perfect device, into a systems engineering problem that mirrors how classical computing evolved and matured. For those of you working on scaling or large-scale architecture, how do you view this approach? 📄 arxiv.org/abs/2604.06319 #Physics #QuantumComputing #FaultTolerance #ErrorCorrection #ComputingArchitecture #Science