Searcharxiv⌕ Search

arXiv subjects

Gavin K. Brennen

Publications and source records attributed to Gavin K. Brennen.

At least 19 recordsLinked to original sources

Finite-round quantum error correction on symmetric quantum sensors

In quantum sensing using $N$ entangled probes, the variance of the estimated signal strength $\hatθ$ scales like $ Θ(N^{-2})$ at the Heisenberg limit, which is a quadratic improvement over the standard quantum limit, and is the maximum quantum advantage over classical methods. This limit remains elusive, however, because of the inevitable presence of noise decohering quantum sensors. Here, we introduce a quantum sensing protocol \texttt{ECSense} based on permutation-invariant quantum error correction (QEC) codes that support tunable code parameters to suit the physical noise model. We show that when the signal duration is much shorter than decoherence times, such that errors only accumulate during the $N$ qubit probe state preparation and idle stage, then the estimate's variance of $Θ( N^{-3/2})$ is achievable in the presence of $Θ(\sqrt{N})$ errors while the Heisenberg limit is achieved when the number of errors is a constant. In the more challenging setting where errors also occur during signal accumulation, we prove using a non-Markovian QEC strategy, that even for a linear number of deletion errors, a variance approaching the Heisenberg limit is still achievable. We illustrate a concrete way to implement our protocol on near-term quantum hardware using cavity-assisted geometric phase gates.

quant-ph↗

A quantum algorithm for one-shot signatures

We provide a pre-obfuscation circuit-level implementation of an efficient one shot signature scheme, which has known applications to delegated signatures, secured token transfer, and publicly verifiable randomness. The algorithm consists of two stages: a key generation stage where a classical public key/quantum secret key pair is produced, and a signing stage where the quantum secret key is processed with a message string to produce a classical signature. There is no algorithmic error in the construction and the signed message can be efficiently checked by a classical verifier. Our scheme works by preparing a superposition over elements of a random affine coset determined by the output of a puncturable pseudorandom function, together with a circuit that tests coset membership. The logical qubit number scales like $Θ( κ\log(r) + n + l)$ and the gate complexity scales like $Θ(n^3 + nl)$, where $r$ is the public key size, $n+l$ is the signature size, $l$ is the message size, and $κ= Ω(n)$ is the cryptographic security parameter. We provide explicit qubit and gate counts for varying $n$ and identify the circuit components where obfuscation would be required for security against classical and quantum polynomial time attacks.

quant-ph↗

Quantum algorithm for solving differential equations using SLAC derivatives

In numerical approaches to solving differential equations on a lattice, a representation of the derivative operator that correctly matches the continuum behaviour of functions of momentum up to the band limit must be non-local. We present the construction of efficient linear-combination-of-unitaries ($\mathrm{LCU}$)-based block-encodings for the first-order derivative and Laplacian operators in the non-local \(N=2^n\)-dimensional SLAC representation. We use state-preparation techniques designed for smoothly decaying functions to prepare the dense $\mathrm{LCU}$ amplitudes with high success probability and low gate cost. Furthermore, we demonstrate how Shannon wavelet transforms can be applied to these block-encodings to obtain multiscale representations of the SLAC derivative operators. We then show how to apply a diagonal preconditioner that reduces the condition number of these matrices in the multiscale wavelet basis to a small constant. This enables the solution of partial differential equations (PDEs) with SLAC-discretised derivative operators on a finite lattice using the quantum linear solving algorithm ($\mathrm{QLSA}$). For a $d$-dimensional PDE, after projection away from the nullspace, the resulting quantum linear-system algorithm has overall gate complexity ${O}(dn^3α^{(k)}\log(1/\varepsilon))$, where $α^{(k)}$ is the subnormalisation factor of the order-$k$ SLAC block-encoding and $\varepsilon$ denotes the algorithmic approximation error.

quant-ph↗

Loss-biased fault-tolerant quantum error correction

We investigate the limits of quantum error correction (QEC) in neutral-atom processors approaching high-fidelity gates and fast cycle times. We show that shorter QEC cycles amplify platform-specific errors, notably Rydberg excitation hopping, and hinder decay of residual Rydberg population, leading to non-Markovian correlated errors that degrade logical performance. To address this, we introduce loss biasing, where spurious Rydberg excitations are rapidly converted into atom loss via mid-circuit ionization, transforming errors into erasure-like noise and suppressing their propagation. Loss biasing restores the fault-tolerant logical error scaling for intra-cycle Pauli errors; furthermore, we argue that when supported with loss-aware decoding, it can achieve the optimal scaling of erasures while enabling shorter QEC cycles with reduced hardware overhead. We outline an implementation using fast autoionization in alkaline-earth(-like) atoms, establishing loss biasing as a practical route toward fault-tolerant quantum computing with sub-millisecond QEC cycles.

quant-ph↗

Answering Counting Queries with Differential Privacy on a Quantum Computer

Differential privacy is a mathematical notion of data privacy that has fast become the de facto standard in privacy-preserving data analysis. Recently a lot of work has focused on differential privacy in the quantum setting. Continuing on this line of study, we investigate how to answer counting queries on a quantum encoded dataset with differential privacy. An example of a counting query is ``How many people in the dataset are over the age of 25 and with a university education?'' Counting queries form the most basic but nonetheless rich set of statistics extractable from a dataset. We show that answering these queries on a quantum encoded dataset reduces to measuring the amplitude of one of two orthogonal states. We then analyze the differential privacy properties of two algorithms from literature to measure amplitude: one which performs repeated measurements in the computational basis, and the other which utilizes the classic amplitude estimation algorithm. For the first technique, we prove privacy results for the case of counting queries that improve on previously known results on general queries, and show that the mechanism in fact \emph{amplifies} privacy due to inherent randomness. For the second method, we derive a tight bound on maximum possible change in the amplitude if we add or remove a single item in the dataset, a quantity called global sensitivity which is central in making an algorithm differentially private. We then show a differentially private version of the amplitude estimation algorithm for counting queries. We also discuss how these methods can be outsourced to a quantum server to blindly compute counting queries with differential privacy.

quant-ph↗

A theory of quantum error correction for permutation-invariant codes

We present for the first time a general theory of error correction for permutation invariant (PI) codes. Using representation theory of the symmetric group we construct efficient algorithms that can correct any correctible error on any PI code. These algorithms involve measurements of total angular momentum, quantum Schur transforms or logical state teleportations, and geometric phase gates. For erasure errors, or more generally deletion errors, on certain PI codes, we give a simpler quantum error correction algorithm.

quant-ph↗

Quantum-enabled optical large-baseline interferometry: applications, protocols and feasibility

Optical Very Long Baseline Interferometry (VLBI) offers the potential for unprecedented angular resolution in both astronomical imaging and precision measurements. Classical approaches, however, face significant limitations due to photon loss, background noise, and the requirements for dynamical delay lines over large distances. This document surveys recent developments in quantum-enabled VLBI, which aim to address these challenges using entanglement-assisted protocols, quantum memory storage, and nonlocal measurement techniques. While its application to astronomy is well known, we also examine how these techniques may be extended to geodesy -- specifically, the monitoring of Earth's rotation. Particular attention is given to quantum-enhanced telescope architectures, including repeater-based long baseline interferometry and quantum error-corrected encoding schemes, which offer a pathway toward high-fidelity optical VLBI. To aid the discussion, we also compare specifications for key enabling technologies to current state-of-the-art experimental components, including switching rates, gate times, entanglement distribution rates, and memory lifetimes. By integrating quantum technologies, future interferometric networks may achieve diffraction-limited imaging at optical and near-infrared wavelengths, surpassing the constraints of classical techniques and enabling new precision tests of astrophysical and fundamental physics phenomena.

quant-ph↗

Emergent metric from wavelet-transformed quantum field theory

We introduce a method of reverse holography by which a bulk metric is shown to arise from locally computable multiscale correlations of a boundary quantum field theory (QFT). The metric is obtained from the Petz-Rényi mutual information defined with input correlations computed from the continuous wavelet transform. The method is applicable to a variety of boundary QFTs that need not be conformal field theories (CFTs). For thermal free scalar and Dirac field theories the resulting bulk metric is that of (asymmetrically) warped anti-de Sitter (AdS) space. For massless, ground state CFTs the geometry simply reduces to AdS space. We show that certain parameters of the geometry can be tuned by changing the shape of the wavelet function.

hep-th↗

Unitary Quantum Cellular Automata for Density Classification

We investigate the density classification task (DCT) -- determining the majority bit in a one-dimensional binary lattice -- within a quantum cellular automaton (CA) framework. While there is no one-dimensional two-state, radius $r \geq 1$, deterministic CA with periodic boundary conditions that solves the DCT perfectly, we explore whether a unitary quantum model can succeed. We employ the Partitioned Unitary Quantum Cellular Automaton (PUQCA), a number-conserving model, and, via evolutionary search, find solutions to the DCT where the success condition is stipulated in terms of measurement probabilities rather than convergence to fixed-point configurations. Finally, we identify a classically simulable regime of the PUQCA in which we find rules that solve the DCT at fixed system sizes and analyze their performance.

quant-ph↗

Measurement-free code-switching for low overhead quantum computation using permutation invariant codes

Transversal gates on quantum error correction codes have been a promising approach for fault-tolerant quantum computing, but are limited by the Eastin-Knill no-go theorem. Existing solutions like gate teleportation and magic state distillation are resource-intensive. We present a measurement-free code-switching protocol for universal quantum computation, switching between a stabiliser code for transversal Cliffords and a permutation-invariant (PI) code for transversal non-Cliffords that are logical $Z$ rotations for any rational multiple of $π$. The novel non-Clifford gates enabled by this code-switching protocol provide for a lower gate count implementation of a universal gate set relative to the Clifford$+T$ gate set. To achieve this, we present a protocol for performing controlled-NOTs between the codes using near-term quantum control operations that employ a catalytic bosonic mode. We also present a new class of PI codes with tunable code distance, supporting transversal non-Clifford gates, and demonstrate their reduced gate count overhead relative to a comparable stabilizer code to stabilizer code switching scheme.

quant-ph↗

Fast quantum algorithm for differential equations

Partial differential equations (PDEs) are ubiquitous in science and engineering. Prior quantum algorithms for solving the system of linear algebraic equations obtained from discretizing a PDE have a computational complexity that scales at least linearly with the condition number $κ$ of the matrices involved in the computation. For many practical applications, $κ$ scales polynomially with the size $N$ of the matrices, rendering a polynomial complexity in $N$ for these algorithms. Here we present a quantum algorithm with a complexity that is polylogarithmic in $N$ but is independent of $κ$ for a large class of PDEs. Our algorithm generates a quantum state from which features of the solution can be extracted. Central to our methodology is using a wavelet basis as an auxiliary system of coordinates in which the condition number of associated matrices becomes independent of $N$ by a simple diagonal preconditioner. We present numerical simulations showing the effect of the wavelet preconditioner for several differential equations. Our work could provide a practical way to boost the performance of quantum simulation algorithms where standard methods are used for discretization.

quant-ph↗

Massive quantum superpositions using magneto-mechanics

Macroscopic quantum superpositions of massive objects are deeply interesting as they have a number of potential applications ranging from the exploration of the interaction of gravity with quantum mechanics to quantum sensing, quantum simulation, and computation. In this letter, we propose two related schemes to prepare a spatial superposition of massive quantum oscillator systems with high Q-factor via a superposition of magnetic forces. In the first method, we propose a large spatial superposition of a levitated spherical magnet generated via magnetic forces applied by adjacent flux qubits. We find that in this method the spatial superposition extent ($Δz$) is independent of the size of the particle. In the second method, we propose a large spatial superposition of a magnetically levitated (using the Meissner effect) flux qubit, generated via driving the levitated qubit inductively. In both schemes, we show that ultra-large superpositions $Δz/δz_{\rm zpm}\sim 10^6$, are possible, where $δz_{\rm zpm}$ is the zero point motional extent.

quant-ph↗

Global Variational Quantum Circuits for Arbitrary Symmetric State Preparation

Quantum states that are symmetric under particle exchange play a crucial role in fields such as quantum metrology and quantum error correction. We use a variational circuit composed of global one-axis twisting and global rotations to efficiently prepare arbitrary symmetric states, i.e. any superposition of Dicke states. The circuit does not require local addressability or ancilla qubits and thus can be readily implemented in a variety of experimental platforms including trapped-ion quantum simulators and cavity QED systems. We provide analytic and numerical evidence that any $N$-qubit symmetric state can be prepared in $2N/3$ steps. We demonstrate the utility of our protocol by preparing (i) metrologically useful $N$-qubit Dicke states of up to $N = 300$ qubits in $\mathcal{O}(1)$ gate steps with theoretical infidelities $1-\mathcal{F} < 10^{-3}$, (ii) the $N = 9$ Ruskai codewords in $P = 4$ gate steps with $1-\mathcal{F} < 10^{-4}$, and (iii) the $N = 13$ Gross codewords in $P = 7$ gate steps with $1-\mathcal{F} < 10^{-4}$. Focusing on trapped-ion platforms, for the $N = 9$ Ruskai and $N = 13$ Gross codewords we estimate that the protocol achieves fidelities $\gtrsim 95\%$ in the presence of typical experimental noise levels, thus providing a pathway to the preparation of a wide range of useful highly-entangled quantum states.

quant-ph↗

Estimating the Jones polynomial for Ising anyons on noisy quantum computers

The evaluation of the Jones polynomial at roots of unity is a paradigmatic problem for quantum computers. In this work we present experimental results obtained from existing noisy quantum computers for special cases of this problem, where it is classically tractable. Our approach relies on the reduction of the problem of evaluating the Jones polynomial of a knot at lattice roots of unity to the problem of computing quantum amplitudes of qudit stabiliser circuits, which are classically efficiently simulatable. More specifically, we focus on evaluation at the fourth root of unity, which is a lattice root of unity, where the problem reduces to evaluating amplitudes of qubit stabiliser circuits. To estimate the real and imaginary parts of the amplitudes up to additive error we use the Hadamard test, yielding non-Clifford circuits that nevertheless we can always efficiently compute the correct output of. Hence, we further argue that this setup defines a standard benchmark for near-term noisy quantum processors. Additionally, we study the benefit of performing quantum error mitigation with the method of zero noise extrapolation.

quant-ph↗

Non-local resources for error correction in quantum LDPC codes

Quantum low density parity check (qLDPC) codes are an attractive alternative to the surface code due to their relatively high code rate and distance. However, unlike the surface code which has simple, geometrically local, stabilizer checks, high performing qLDPC codes have non-local stabilizers that are challenging to measure. Recent advancements have shown how to deterministically perform high-fidelity, cavity mediated many-body gates, enabling the encoding and decoding of non-local GHZ states. We integrate this non-local resource into the DiVincenzo-Aliferis method of fault-tolerant stabilizer measurement for quantum hypergraph product and lifted product codes. Using circuit-level noise simulations, including the noise optimized cavity mediated gate, we find promising thresholds of $0.84 \%-0.60 \%$ for the hypergraph product code and psuedo-threshold of $0.3\%-0.4\%$ for the lifted product codes, with cavity cooperativities in the range $C\sim 10^4-10^6$. We propose a compatible tri-layer architectural layout for scheduling stabilizer measurements, enhancing circuit parallelizability.

quant-ph↗

Cavity polariton blockade for non-local entangling gates with trapped atoms

We propose a scheme for realizing multi-qubit entangled W-state and non-local $CZ$ and $C_2Z$ gates via a cavity polariton blockade mechanism with a system of atomic qubits coupled to a common cavity mode. The polariton blockade is achieved by tuning the system, an $N-$qubit register, such that no two atoms are simultaneously excited to the qubit excited state, and there is an effective coupling only between the ground state and a singly-excited W state of the qubit register. The control step requires only an external drive of the cavity mode and a global qubit pulse and no individual qubit addressing. We analytically obtain the state preparation error for an $N-$qubit W state which scales as $\sqrt{(1-1/N)}/\sqrt{C}$ where $C$ is the single particle cooperativity. We additionally show the application of the polariton blockade mechanism in realizing a non-local $CZ$ and $C_2Z$ gate by using a different set of computational qubit states, and characterize the gate errors which scale as $\sim 1/\sqrt{C}$.

quant-ph↗

High-rate quantum LDPC codes for long-range-connected neutral atom registers

High-rate quantum error correcting (QEC) codes with moderate overheads in qubit number and control complexity are highly desirable for achieving fault-tolerant quantum computing. Recently, quantum error correction has experienced significant progress both in code development and experimental realizations, with neutral atom qubit architecture rapidly establishing itself as a leading platform in the field. Scalable quantum computing will require processing with QEC codes that have low qubit overhead and large error suppression, and while such codes do exist, they involve a degree of non-locality that has yet to be integrated into experimental platforms. In this work, we analyze a family of high-rate Low-Density Parity-Check (LDPC) codes with limited long-range interactions and outline a near-term implementation in neutral atom registers. By means of circuit-level simulations, we find that these codes outperform surface codes in all respects when the two-qubit nearest neighbour gate error probability is below $\sim 0.1\%$. By using multiple laser colors, we show how these codes can be natively integrated in two-dimensional static neutral atom qubit architectures with open boundaries, where the desired long-range connectivity can be targeted via the Rydberg blockade interaction.

quant-ph↗

The Quantum Internet (Technical Version)

Following the emergence of quantum computing, the subsequent quantum revolution will be that of interconnecting individual quantum computers at global level. In the same way that classical computers only realised their full potential with the emergence of the internet, a fully realised quantum internet is the next stage of evolution for quantum computation. This work examines in detail how the quantum internet would evolve in practice, focusing not only on the technology itself but also on the implications it will have economically and politically. We present both original ideas, as well as an extensive review of relevant and related background material. This work begins with a description of classical networks before introducing the key concepts behind quantum networks, such as quantum internet protocols, quantum cryptography, and cloud quantum computing. The work is divided into technical sections (requiring only a basic knowledge of the notation of quantum mechanics), for those interested in mathematical details, as well as non-technical sections for those seeking a more general understanding. We target this work very broadly at quantum and classical computer scientists, classical computer systems, software and network engineers, physicists, economists, artists, musicians, and those just generally curious about the future of quantum technologies and what they might bring to humanity.

quant-ph↗