Quantum Error Detection Research for PhD Candidates

🚨 Exciting #quantumcomputing alert! Now #QEC primitives actually make #quantumcomputers more powerful! 75 qubit GHZ state on a superconducting #QPU 🚨 In our latest work we address the elephant in the room about #quantumerrorcorrection - in the current era where qubit counts are a bottleneck in the systems available, adopting full-blown QEC can be a step backwards in terms of computational capacity. This is because even when it delivers net benefits in error reduction, QEC consumes a lot of qubits to do so and we just don't have enough right now... So how do we maximize value for end users while still pushing hard on the underpinning QEC technology? To answer this the team at Q-CTRL set out to determine new ways to significantly reduce the overhead penalties of QEC while delivering big benefits! In this latest demonstration we show that we can adopt parts of QEC -- indirect stabilizer measurements on ancilla qubits -- to deliver large performance gains without the painful overhead of logical encoding. And by combining error detection with deterministic error suppression we can really improve efficiency of the process, requiring only about 10% overhead in ancillae and maintaining a very low discard rate of executions with errors identified! Using this approach we've set a new record for the largest demonstrated entangled state at 75 qubits on an IBM quantum computer (validated by MQC) and also demonstrated a totally new way to teleport gates across large distances (where all-to-all connectivity isn't possible). The results outperform all previously published approaches and highlight the fact that our journey in dealing with errors in quantum computers is continuous. Of course it isn't a panacea and in the long term as we try to tackle even more complex algorithms we believe logical encoding will become an important part of our toolbox. But that's the point - logical QEC is just one tool and we have many to work with! At Q-CTRL we never lose sight of the fact that our objective is to deliver maximum capability to QC end users. This work on deploying QEC primitives is a core part of how we're making quantum technology useful, right now. https://lnkd.in/gkG3W7eE

Quantum computing is full of wild tricks… Have you heard of 𝘁𝘄𝗶𝗿𝗹𝗶𝗻𝗴? It’s not something you’ll come across in your first textbook, yet it’s a powerful tool for 𝘁𝗮𝗺𝗶𝗻𝗴 𝗲𝗿𝗿𝗼𝗿𝘀 in quantum processors. Errors in quantum hardware are inevitable, but not all errors behave the same way: - 𝗣𝗮𝘂𝗹𝗶 𝗲𝗿𝗿𝗼𝗿𝘀 (bit-flips, phase-flips) → well understood and easier to correct - 𝗖𝗼𝗵𝗲𝗿𝗲𝗻𝘁 𝗲𝗿𝗿𝗼𝗿𝘀 (over-rotations, drifts) → harder to track and accumulate over time To mitigate these 𝗰𝗼𝗵𝗲𝗿𝗲𝗻𝘁 errors, a technique called 𝗣𝗮𝘂𝗹𝗶 𝗧𝘄𝗶𝗿𝗹𝗶𝗻𝗴 can be employed. This method involves the 𝗿𝗮𝗻𝗱𝗼𝗺 𝗮𝗽𝗽𝗹𝗶𝗰𝗮𝘁𝗶𝗼𝗻 𝗼𝗳 𝗣𝗮𝘂𝗹𝗶 𝗴𝗮𝘁𝗲𝘀 (X, Y, Z, I) before and after a noisy operation. By doing so, the structured nature of coherent errors is transformed into a more stochastic form, resembling Pauli errors. Since most quantum error correction schemes are specifically designed to handle Pauli-like errors, this transformation makes error correction far more effective. 𝗛𝗼𝘄 𝗣𝗮𝘂𝗹𝗶 𝗧𝘄𝗶𝗿𝗹𝗶𝗻𝗴 𝗪𝗼𝗿𝗸𝘀: 1. Randomisation: Before executing a quantum gate that may introduce coherent noise, a randomly selected Pauli gate is applied to the qubit. 2. Noisy Operation: The intended quantum gate is performed, during which coherent errors might occur. 3. Compensatory Application: After the noisy operation, another Pauli gate is applied to the qubit. This gate is chosen to counteract the initial random Pauli gate, ensuring that the overall intended operation remains unchanged. This process effectively "𝘀𝗰𝗿𝗮𝗺𝗯𝗹𝗲𝘀" coherent errors, converting them into a form that quantum error correction methods can better handle. One of the advantages of Pauli Twirling is that it requires 𝗺𝗶𝗻𝗶𝗺𝗮𝗹 𝗮𝗱𝗱𝗶𝘁𝗶𝗼𝗻𝗮𝗹 𝗼𝘃𝗲𝗿𝗵𝗲𝗮𝗱. In many cases, it can be integrated into existing gate sequences with negligible impact on overall system performance. Have you used twirling in your quantum experiments? Or are there other error mitigation techniques you rely on? 📸 Image Credits: Tsubouchi et al. (2024) #QuantumComputing #QuantumErrorCorrection #PauliTwirling #QuantumHardware

The Quantum Memory Matrix (QMM) framework has traveled a long path: from black hole unitarity, dark matter, dark energy, and cosmic cycles, to now improving how quantum computers handle errors. In work now featured on the cover of Wiley's Advanced Quantum Technologies, we demonstrate how the QMM framework can be directly applied to quantum error correction. QMM originated in cosmology: a picture where space-time is not smooth but is built from Planck-scale cells, each with a finite memory capacity. We showed how these cells store the quantum imprints of interactions, contributing to resolving paradoxes around black holes, explaining dark matter halos, primordial black hole formation, cosmic acceleration, and even the cycles of the universe. Now, we bring this same idea into hardware: by imprinting and retrieving quantum information from local "memory cells," we can correct errors in noisy quantum processors with higher fidelity than standard repetition codes. This shows that QMM is not only a cosmological theory but also a practical tool for building the quantum computers of tomorrow. 🔗 Read the paper: https://lnkd.in/gfGwe7fe Previous QMM milestones: 🕳️ Black hole information retention and unitarity restoration ⚡ Extensions to electromagnetism, strong & weak interactions 🌌 Cosmological applications explaining dark matter and dark energy 💻 And now: direct hardware validation for quantum computation Thank you to my co-authors Eike Marx, Valerii Vinokur, Jeff Titus, and Terra Quantum AG & Leiden University for making this journey possible. #QuantumComputing #QuantumMemoryMatrix #ErrorCorrection #QuantumPhysics #QuantumTechnology #QuantumInformation #BlackHolePhysics #DarkMatter #DarkEnergy #AdvancedQuantumTechnologies #TerraQuantum #QuantumResearch

I'm thrilled to share our latest research advancement from the #QuantumComputing Engineering Research team led by Ruslan Shaydulin at Global Technology Applied Research, JPMorganChase, in collaboration with Quantinuum and University of Wisconsin-Madison. Our work, titled "Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm," has just been published on arXiv: https://lnkd.in/eMy4Qzc5.   In this article, we introduce a novel compiler for #QuantumAlgorithms integrated with an error detection code. We focus on the [[𝑘 +2,𝑘,2]] Iceberg quantum error detection code and the Quantum Approximate Optimization Algorithm (#QAOA). A novel contribution of our compiler is the fact that it bridges the gap between algorithm abstraction and error detection code, pushing the boundaries of practical applications of #quantum algorithms.    By co-optimizing the QAOA circuit and Iceberg gadgets, we achieve superior performance compared to unencoded implementations, utilizing up to 34 algorithmic qubits, 510 algorithmic two-qubit gates, and 1140 physical two-qubit gates on the Quantinuum H2-1 quantum computer. To the best of our knowledge, this is the largest hardware demonstration showing better-than-native performance of a quantum #optimization algorithm to date.    Authors: Yuwei Jin (JPMorganChase), Zichang He (JPMorganChase), Tianyi Hao (JPMorganChase and University of Wisconsin-Madison), David Amaro (Quantinuum), Swamit Tannu (University of Wisconsin-Madison), Ruslan Shaydulin (JPMorganChase), and Marco Pistoia (JPMorganChase).

A quantum computer that learns from its own errors while it's computing. That's the framing in a recent paper from Google Quantum AI and Google DeepMind on reinforcement learning control of quantum error correction. Large quantum processors drift. The standard fix is to halt the computation and recalibrate, which won't scale to algorithms expected to run for days or weeks. The authors ask whether QEC can calibrate itself from the data it already produces. The idea: repurpose error detection events as a training signal for a reinforcement learning agent that continuously tunes the physical control parameters (pulse amplitudes, detunings, DRAG coefficients, CZ parameters, and so on). Rather than optimizing logical error rate directly, which is expensive and global, the agent minimizes average detector-event rate, a cheap local proxy whose gradient is approximately aligned with the gradient of LER in the small-perturbation regime. The results on a Willow superconducting processor: - On distance-5 surface and color codes, RL fine-tuning after conventional calibration and expert tuning yields about 20% additional LER suppression - Against injected drift, RL steering improves logical stability 2.4x, rising to 3.5x when decoder parameters are also steered - New record logical error per cycle: 7.72(9)×10⁻⁴ for a distance-7 surface code (with the AlphaQubit2 decoder) and 8.19(14)×10⁻³ for a distance-5 color code (with Tesseract) - In simulation, the framework scales to a distance-15 surface code with roughly 40,000 control parameters, with a convergence rate that is independent of system size The broader takeaway: calibration and computation may not need to be separate phases. If detector statistics can carry enough information to steer a large control stack online, fault tolerance becomes less about pausing to retune and more about a processor that keeps learning while it computes. Worth noting that the current experiments rely on short repeated memory circuits, so real-time steering during a single long logical algorithm (where exploration noise would affect the computation directly) remains future work. Paper: https://lnkd.in/gVQXnpzZ

Simulated non-Markovian Noise Resilience of Silicon-Based Spin Qubits with Surface Code Error Correction by Quobly, Eviden, CEA-Leti & Université Grenoble Alpes https://lnkd.in/eDaqei3C Abstract We investigate the resilience of silicon-based spin qubits against non-Markovian noise within the framework of quantum error correction. We consider a realistic non-Markovian noise model that affects both the Larmor frequency and exchange energy of qubits, allowing accurate simulations of noisy quantum circuits. We employ numerical emulation to assess the performance of the distance-3 rotated surface code and its XZZX variant, using a logical qubit coherence time metric based on Ramsey-like experiments. Our numerical results suggest that quantum error correction converts non-Markovian physical noise into Markovian logical noise, resulting in a quartic dependence of coherence time between physical and logical qubits. Additionally, we analyze the effects of spatial noise correlations and sparse architectures, substantiating the robustness of quantum error correction in silicon-based spin qubit systems.

Google Researchers Developed AlphaQubit: A Deep Learning-based Decoder for Quantum Computing Error Detection Google Research has developed AlphaQubit, an AI-based decoder that identifies quantum computing errors with high accuracy. AlphaQubit uses a recurrent, transformer-based neural network to decode errors in the leading error-correction scheme for quantum computing, known as the surface code. By utilizing a transformer, AlphaQubit learns to interpret noisy syndrome information, providing a mechanism that outperforms existing algorithms on Google’s Sycamore quantum processor for surface codes of distances 3 and 5, and demonstrates its capability on distances up to 11 in simulated environments. The approach uses two-stage training, initially learning from synthetic data and then fine-tuning on real-world data from the Sycamore processor. This adaptability allows AlphaQubit to learn complex error distributions without relying solely on theoretical models—an important advantage for dealing with real-world quantum noise. In experimental setups, AlphaQubit achieved a logical error per round (LER) rate of 2.901% at distance 3 and 2.748% at distance 5, surpassing the previous tensor-network decoder, whose LER rates stood at 3.028% and 2.915% respectively. This represents an improvement that suggests AI-driven decoders could play an important role in reducing the overhead required to maintain logical consistency in quantum systems. Moreover, AlphaQubit’s recurrent-transformer architecture scales effectively, offering performance benefits at higher code distances, such as distance 11, where many traditional decoders face challenges.... Read the full article here: https://lnkd.in/gVQtY8fc Paper: https://lnkd.in/gvhxD3pC Google Google DeepMind