arXiv subjects

Jamie Friel

Publications and source records attributed to Jamie Friel.

5 recordsLinked to original sources

arXiv2026

The limits of erasure-based postselection for quantum error mitigation

In both classical and quantum error correction, heralded erasures are known to be easier to tolerate than unheralded general stochastic errors. Whilst an established benefit of loss-dominant quantum architectures such as photonic qubits, this fact has received renewed interest, with a pivot towards reconstructing other architectures to be erasure-dominant, such as dual-rail transmons. This work investigates exploiting these 'erasure qubits' in the near term by using postselection as a technique for error mitigation, wherein circuit shots detecting any erased qubits are discarded from the computational ensemble and repeated. Firstly, we outline a numerical framework for representing circuit-level erasure noise and present 'erado', an open-source library capable of simulating erasure noise and postselection. Secondly, we investigate the effects of both erasure noise and noise in the erasure checks themselves on the quantum Fourier transform (QFT), in the additional presence of gate depolarising noise. A worked example is provided of postselection fully mitigating against the erasure channel for erasure check error rates less than 3.0%. We also show how a postselected dual-rail system can surpass a fundamental noise floor at the kiloquop scale where a comparable single-rail system cannot, justifying this approach in the NISQ regime before (and, perhaps, combined with) the practical arrival of QEC.

quant-ph↗

arXiv2026

Developments in superconducting erasure qubits for hardware-efficient quantum error correction

Quantum computers are inherently noisy, and a crucial challenge for achieving large-scale, fault-tolerant quantum computing is to implement quantum error correction. A promising direction that has made rapid recent progress is to design hardware that has a specific noise profile, leading to a significantly higher threshold for noise with certain quantum error correcting codes. This Perspective focuses on erasure qubits, which enable hardware-efficient quantum error correction, by concatenating an inner code built-in to the hardware with an outer code. We focus on implementations of dual-rail encoded erasure qubits using superconducting qubits, giving an overview of recent developments in theory and simulation, and hardware demonstrators. We also discuss the differences between implementations; near-term applications using quantum error detection; and the open problems for developing this approach towards early fault-tolerant quantum computers.

quant-ph↗

arXiv2025

$\Delta$-Motif: Parallel Subgraph Isomorphism via Tabular Operations for Scalable Layout Selection

Subgraph isomorphism is a fundamental problem in graph analysis that seeks to find all instances of a pattern graph within a larger data graph while preserving structural relationships. This NP-complete problem is central to domains such as biological network analysis, social network mining, and quantum circuit optimization. Traditional approaches rely on backtracking algorithms like VF2, which suffer from sequential bottlenecks that limit their ability to exploit modern parallel hardware. In this work, we introduce $\Delta$-Motif, a GPU-accelerated subgraph isomorphism algorithm that reformulates the task through the lens of database operations. Our key insight is to represent both data and pattern graphs in tabular form, turning subgraph isomorphism into database primitives including joins, sorts, merges, and filters. $\Delta$-Motif decomposes graphs into small building blocks called motifs and systematically combines them using scalable relational operations. By leveraging mature, optimized libraries from the NVIDIA RAPIDS ecosystem and Pandas framework, our solution achieves massive parallelism while remaining portable across systems supporting standard relational primitives. Benchmarks show that $\Delta$-Motif outperforms established algorithms like VF2, achieving speedups of up to $595\times$ on GPUs. We further demonstrate its impact by applying it to quantum circuit compilation, addressing a critical bottleneck in quantum computing and enabling scaling to near- and medium-term devices. Our approach democratizes high-performance graph processing by exposing it through familiar database abstractions, eliminating the need for low-level programming while delivering exceptional computational efficiency.

cs.DS↗

arXiv2025

QMIO: A tightly integrated hybrid HPCQC system

High-Performance Computing (HPC) systems are the most powerful tools that we currently have to solve complex scientific simulations. Quantum computing (QC) has the potential to enhance HPC systems by accelerating the execution of specific kernels that can be offloaded to a Quantum Processing Unit (QPU), granting them new capabilities, improving the speed of computation, or reducing energy consumption. In this paper, we present QMIO: a state-of-the-art hybrid HPCQC system, which tightly integrates HPC and QC. We describe its hardware and software components, the integration middleware, and the lessons learned during the design, implementation, and operation of the system.

quant-ph↗

arXiv2020

Attainability of the Holevo-Cram\'er-Rao bound for two-qubit 3D magnetometry

We study quantum-limited 3D magnetometry using two qubits. Two qubits form the smallest multi-qubit system for 3D magnetometry, the simultaneous estimation of three phases, as it is impossible with a single qubit. We provide an analytical expression for the Holevo-Cram\'er-Rao bound (HCRB),the fundamental attainable quantum bound of multiparameter estimation, for 3D magnetometry using two-qubit pure states and show its attainability by rank-1 projective measurements. We also examine the attainability of the HCRB in the presence of dephasing noise using numerical methods. While attaining the HCRB may require collective measurements over infinitely many copies, we find that for high noise the HCRB is practically saturated by two copies only. In the low noise regime, up to three copies are unable to attain the HCRB. More generally, we introduce new multiparameter channel bounds to compare quantum-classical and classical-quantum strategies where multiple independent copies of the state are entangled before or after recording the parameters respectively. We find that their relative performance depends on the noise strength, with theclassical-quantum strategy performing better for high noise. We end with shallow quantum circuits that approach the fundamental quantum limit set by the HCRB for two-qubit 3D magnetometry using up to three copies.

quant-ph↗