arXiv subjects

Joseph Sullivan

Publications and source records attributed to Joseph Sullivan.

18 recordsLinked to original sources

arXiv2026

Two New Extensions of Reider's Theorem on Algebraic Surfaces

Reider's Theorem on the very ampleness of adjoint linear series on a complex projective algebraic surface is extended in two new directions. First, Reider-type inequalities are shown to imply nefness of linear series of the form dH - E on the blow-up of projective space along the embedded surface. This can be thought of as a weak analogy of Saint-Donat's Theorem on the generators of the ideal of a curve embedded by an adjoint linear series. Next, Reider-type inequalities give a sharp estimate for the ample cone of the Hilbert schemes of length d subschemes of the surface. The proofs consist of (a) finding a natural family of objects parametrized by the base (either the blow-up along the surface or the Hilbert scheme) and (b) finding the largest chamber in the stability manifold of the surface where the objects in the family are all Bridgeland semistable. A Theorem of Bayer-Macri then gives nefness of the determinant line bundle on the base of the family.

math.AG↗

arXiv2026

Digital signatures with classical shadows on near-term quantum computers

Quantum mechanics provides cryptographic primitives whose security is grounded in hardness assumptions independent of those underlying classical cryptography. However, existing proposals require low-noise quantum communication and long-lived quantum memory, capabilities which remain challenging to realize in practice. In this work, we introduce a quantum digital signature scheme that operates with only classical communication, using the classical shadows of states produced by random circuits as public keys. We provide theoretical and numerical evidence supporting the conjectured hardness of learning the private key (the circuit) from the public key (the shadow). A key technical ingredient enabling our scheme is an improved state-certification primitive that achieves higher noise tolerance and lower sample complexity than prior methods. We realize this certification by designing a high-rate error-detecting code tailored to our random-circuit ensemble and experimentally generating shadows for 32-qubit states using circuits with $\geq 80$ logical ($\geq 582$ physical) two-qubit gates, attaining 0.90 $\pm$ 0.01 fidelity. With increased number of measurement samples, our hardware-demonstrated primitives realize a proof-of-principle quantum digital signature, demonstrating the near-term feasibility of our scheme.

quant-ph↗

arXiv2025

Compilation Pipeline for Predicting Algorithmic Break-Even in an Early-Fault-Tolerant Surface Code Architecture

Recent experimental progress in realizing surface code on hardware, including demonstrations of break-even logical memory on devices with up to hundreds of physical qubits, has materially advanced the prospects for fault-tolerant quantum computation. This progress creates urgency for the development of compilation workflows that directly target the forthcoming generation of devices with thousands of physical qubits, for which algorithm execution becomes practical. We develop a pipeline for compiling logical algorithms to physical circuits implementing lattice surgery on the surface code, and use this pipeline to identify the requirements for achieving algorithmic break-even -- where quantum error correction improves the performance of a quantum algorithm -- for two prominent quantum algorithms: the quantum approximate optimization algorithm (QAOA) and quantum phase estimation (QPE). Our pipeline integrates several open-source software tools, and leverages recent advances in error-aware unitary gate synthesis, high-fidelity magic state production, and the calculation of correlation surfaces in the surface code. We perform classical simulations of physical Clifford proxy circuits produced by our pipeline, and find that both 5-qubit QAOA and QPE can reach algorithmic break-even with 2517 physical qubits (surface code distance $d=11$) at physical error rates of $p=10^{-3}$, or 1737 physical qubits ($d=9$) at $p=5\times 10^{-4}$. Our work thereby identifies conditions for achieving algorithmic break-even with near-term quantum hardware and paves the way towards an end-to-end compiler for early-fault-tolerant surface code architectures.

quant-ph↗

arXiv2025

Certified randomness amplification by dynamically probing remote random quantum states

Cryptography depends on truly unpredictable numbers, but physical sources emit biased or correlated bits. Quantum mechanics enables the amplification of imperfect randomness into nearly perfect randomness, but prior demonstrations have required physically co-located, loophole-free Bell tests, constraining the feasibility of remote operation. Here we realize certified randomness amplification across a network by dynamically probing large, entangled quantum states on Quantinuum's 98-qubit Helios trapped-ion quantum processor. Our protocol is secure even if the remote device acts maliciously or is compromised by an intercepting adversary, provided the samples are generated quickly enough to preclude classical simulation of the quantum circuits. We stream quantum gates in real time to the quantum processor, maintain quantum state coherence for $\approx 0.9$ seconds, and then reveal the measurement bases to the quantum processor only milliseconds before measurement. This limits the time for classical spoofing to 30 ms and constrains the location of hypothetical adversaries to a $4{,}500$ km radius. We achieve a fidelity of 0.586 on random circuits with 64 qubits and 276 two-qubit gates, enabling the amplification of realistic imperfect randomness with a low entropy rate into nearly perfect randomness.

quant-ph↗

arXiv2025

End-to-end quantum algorithms for tensor problems

We present a comprehensive end-to-end quantum algorithm for tensor problems, including tensor PCA and planted kXOR, that achieves potential superquadratic quantum speedups over classical methods. We build upon prior works by Hastings~(\textit{Quantum}, 2020) and Schmidhuber~\textit{et al.}~(\textit{Phys.~Rev.~X.}, 2025), we address key limitations by introducing a native qubit-based encoding for the Kikuchi method, enabling explicit quantum circuit constructions and non-asymptotic resource estimation. Our approach substantially reduces constant overheads through a novel guiding state preparation technique as well as circuit optimizations, reducing the threshold for a quantum advantage. We further extend the algorithmic framework to support recovery in sparse tensor PCA and tensor completion, and generalize detection to asymmetric tensors, demonstrating that the quantum advantage persists in these broader settings. Detailed resource estimates show that 900 logical qubits, $\sim 10^{15}$ gates and $\sim 10^{12}$ gate depth suffice for a problem that classically requires $\sim 10^{23}$ FLOPs. The gate count and depth for the same problem without the improvements presented in this paper would be at least $10^{19}$ and $10^{18}$ respectively. These advances position tensor problems as a candidate for quantum advantage whose resource requirements benefit significantly from algorithmic and compilation improvements; the magnitude of the improvements suggest that further enhancements are possible, which would make the algorithm viable for upcoming fault-tolerant quantum hardware.

quant-ph↗

arXiv2025

Spring-Brake! Handed Shearing Auxetics Improve Efficiency of Hopping and Standing

Energy efficiency is critical to the success of legged robotics. Efficiency is lost through wasted energy during locomotion and standing. Including elastic elements has been shown to reduce movement costs, while including breaks can reduce standing costs. However, adding separate elements for each increases the mass and complexity of a leg, reducing overall system performance. Here we present a novel compliant mechanism using a Handed Shearing Auxetic (HSA) that acts as a spring and break in a monopod hopping robot. The HSA acts as a parallel elastic actuator, reducing electrical power for dynamic hopping and matching the efficiency of state-of-the-art compliant hoppers. The HSA\u2019s auxetic behavior enables dual functionality. During static tasks, it locks under large forces with minimal input power by blocking deformation, creating high friction similar to a capstan mechanism. This allows the leg to support heavy loads without motor torque, addressing thermal inefficiency. The multi-functional design enhances both dynamic and static performance, offering a versatile solution for robotic applications.

cs.RO↗

arXiv2025

Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm

Optimization is often cited as a promising application of quantum computers. However, the low degree of provable quantum speedups has led prior rigorous end-to-end resource analyses to conclude that a quantum computer is unlikely to surpass classical state-of-the-art on optimization problems under realistic assumptions. In this work, we compile and analyze the Quantum Approximate Optimization Algorithm (QAOA) combined with Amplitude Amplification (AA) applied to random 8-SAT at the satisfiability threshold. Our compilation involves careful optimization of circuits for Hamiltonian simulation, which may be of independent interest. We use the analytical scaling of the time-to-solution for QAOA identified by PRX Quantum 5, 030348 (2024) and find that with QAOA depth $p=623$, QAOA+AA achieves a crossover with state-of-the-art classical heuristics at 179 variables and 14.99 hours of runtime when executed on a surface-code-based fault-tolerant quantum computer with 73.91 million physical qubits, a physical error rate of $10^{-3}$, and a $1~\mu$s code cycle time. Notably, we allow the classical solver to be parallelized as long as its total energy consumption is equal to that required for decoding in the surface code. We further show that this restriction on classical solver energy consumption can be relaxed given optimistic but plausible reductions in physical error rates and fault-tolerance overheads, enabling a crossover of 2.94 hours using 8.88 million physical qubits against a classical solver running on a supercomputer with $725,760$ CPU cores. These findings support the hypothesis that large-scale fault-tolerant quantum computers will be useful for optimization.

quant-ph↗

arXiv2023

Engineering 3D Floquet codes by rewinding

Floquet codes are a novel class of quantum error-correcting codes with dynamically generated logical qubits arising from a periodic schedule of non-commuting measurements. We utilize the interpretation of measurements in terms of condensation of topological excitations and the rewinding of measurement sequences to engineer new examples of Floquet codes. In particular, rewinding is advantageous for obtaining a desired set of instantaneous stabilizer groups on both toric and planar layouts. Our first example is a Floquet code with instantaneous stabilizer codes that have the same topological order as 3D toric code(s). This Floquet code also exhibits a splitting of the topological order of the 3D toric code under the associated sequence of measurements, i.e., an instantaneous stabilizer group of a single copy of 3D toric code in one round transforms into an instantaneous stabilizer group of two copies of 3D toric codes up to nonlocal stabilizers in the following round. We further construct boundaries for this 3D code and argue that stacking it with two copies of 3D subsystem toric code allows for a transversal implementation of the logical non-Clifford $CCZ$ gate. We also show that the coupled-layer construction of the X-cube Floquet code can be modified by a rewinding schedule such that each of the instantaneous stabilizer codes is finite-depth-equivalent to the X-cube model up to toric codes; the X-cube Floquet code exhibits a splitting of the X-cube model into a copy of the X-cube model and toric codes under the measurement sequence. Our final 3D example is a generalization of the 2D Floquet toric code on the honeycomb lattice to 3D, which has instantaneous stabilizer codes with the same topological order as the 3D fermionic toric code.

quant-ph↗

arXiv2023

Floquet codes with a twist

We describe a method for creating twist defects in the honeycomb Floquet code of Hastings and Haah. In particular, we construct twist defects at the endpoints of condensation defects, which are built by condensing emergent fermions along one-dimensional paths. We argue that the twist defects can be used to store and process quantum information fault tolerantly, and demonstrate that, by preparing twist defects on a system with a boundary, we obtain a planar variant of the $\mathbb{Z}_2$ Floquet code. Importantly, our construction of twist defects maintains the connectivity of the hexagonal lattice, requires only 2-body measurements, and preserves the three-round period of the measurement schedule. We furthermore generalize the twist defects to $\mathbb{Z}_N$ Floquet codes defined on $N$-dimensional qudits. As an aside, we use the $\mathbb{Z}_N$ Floquet codes and condensation defects to define Floquet codes whose instantaneous stabilizer groups are characterized by the topological order of certain Abelian twisted quantum doubles.

quant-ph↗

arXiv2023

Floquet codes and phases in twist-defect networks

We introduce a class of models, dubbed paired twist-defect networks, that generalize the structure of Kitaev's honeycomb model for which there is a direct equivalence between: i) Floquet codes (FCs), ii) adiabatic loops of gapped Hamiltonians, and iii) unitary loops or Floquet-enriched topological orders (FETs) many-body localized phases. This formalism allows one to apply well-characterized topological index theorems for FETs to understand the dynamics of FCs, and to rapidly assess the code properties of many FC models. As an application, we show that the Honeycomb Floquet code of Haah and Hastings is governed by an irrational value of the chiral Floquet index, which implies a topological obstruction to forming a simple, logical boundary with the same periodicity as the bulk measurement schedule. In addition, we construct generalizations of the Honeycomb Floquet code exhibiting arbitrary anyon-automorphism dynamics for general types of Abelian topological order.

quant-ph↗

arXiv2022

Solving the n-color ice model

Given an arbitrary choice of two sets of nonzero Boltzmann weights for $n$-color lattice models, we provide explicit algebraic conditions on these Boltzmann weights which guarantee a solution (i.e., a third set of weights) to the Yang-Baxter equation. Furthermore we provide an explicit one-dimensional parametrization of all solutions in this case. These $n$-color lattice models are so named because their admissible vertices have adjacent edges labeled by one of $n$ colors with additional restrictions. The two-colored case specializes to the six-vertex model, in which case our results recover the familiar quadric condition of Baxter for solvability. The general $n$-color case includes important solutions to the Yang-Baxter equation like the evaluation modules for the quantum affine Lie algebra $U_q(\hat{\mathfrak{sl}}_n)$. Finally, we demonstrate the invariance of this class of solutions under natural transformations, including those associated with Drinfeld twisting.

math-ph↗

arXiv2021

Weak symmetry breaking and topological order in a 3D compressible quantum liquid

We introduce a new type of 3D compressible quantum phase, in which the U(1) charge conservation symmetry is weakly broken by a rigid string-like order parameter, and no local order parameter exists. We show that this gapless phase is completely stable and described at low energy by an infinite-component Chern-Simons-Maxwell theory. We determine the emergent symmetry group, which contains U(1) 0-form planar symmetries and an unusual subgroup of the dual U(1) 1-form symmetry supported on cylindrical surfaces. Through the associated 't Hooft anomaly, we examine how the filling condition is fulfilled in the low-energy theory. We also demonstrate that the phase exhibits a kind of fractonic topological order, signified by extensively many different types of topologically nontrivial quasiparticles formed out of vortices of the weak superfluid. A microscopic model realizing the weak superfluid phase is constructed using an array of strongly coupled Luttinger liquid wires, and the connection to the field theory is established through boson-vortex duality.

cond-mat.str-el↗

arXiv2020

Planar p-String Condensation: Chiral Fracton Phases from Fractional Quantum Hall Layers and Beyond

We present a coupled-wire construction of a model with chiral fracton topological order. The model combines the known construction of $\nu=1/m$ Laughlin fractional quantum Hall states with a planar p-string condensation mechanism. The bulk of the model supports gapped immobile fracton excitations that generate a hierarchy of mobile composite excitations. Open boundaries of the model are chiral and gapless, and can be used to demonstrate a fractional quantized Hall conductance where fracton composites act as charge carriers in the bulk. The planar p-string mechanism used to construct and analyze the model generalizes to a wide class of models including those based on layers supporting non-Abelian topological order. We describe this generalization and additionally provide concrete lattice-model realizations of the mechanism.

cond-mat.str-el↗

arXiv2020

Fractonic topological phases from coupled wires

In three dimensions, gapped phases can support "fractonic" quasiparticle excitations, which are either completely immobile or can only move within a low-dimensional submanifold, a peculiar topological phenomenon going beyond the conventional framework of topological quantum field theory. In this work we explore fractonic topological phases using three-dimensional coupled wire constructions, which have proven to be a successful tool to realize and characterize topological phases in two dimensions. We find that both gapped and gapless phases with fractonic excitations can emerge from the models. In the gapped case, we argue that fractonic excitations are mobile along the wire direction, but their mobility in the transverse plane is generally reduced. We show that the excitations in general have infinite-order fusion structure, distinct from previously known gapped fracton models. Like the 2D coupled wire constructions, many models exhibit gapless (or even chiral) surface states, which can be described by infinite-component Luttinger liquids. However, the universality class of the surface theory strongly depends on the surface orientation, thus revealing a new type of bulk-boundary correspondence unique to fracton phases.

cond-mat.str-el↗

arXiv2019

Interacting Edge States of Fermionic Symmetry-Protected Topological Phases in Two Dimensions

Recently, it has been found that there exist symmetry-protected topological phases of fermions, which have no realizations in non-interacting fermionic systems or bosonic models. We study the edge states of such an intrinsically interacting fermionic SPT phase in two spatial dimensions, protected by $\mathbb{Z}_4\times\mathbb{Z}_2^T$ symmetry. We model the edge Hilbert space by replacing the internal $\mathbb{Z}_4$ symmetry with a spatial translation symmetry, and design an exactly solvable Hamiltonian for the edge model. We show that at low-energy the edge can be described by a two-component Luttinger liquid, with nontrivial symmetry transformations that can only be realized in strongly interacting systems. We further demonstrate the symmetry-protected gaplessness under various perturbations, and the bulk-edge correspondence in the theory.

cond-mat.str-el↗

arXiv2017

Density of Gabor Systems Via the Short Time Fourier Transform

We apply a new approach to the study of the density of Gabor systems, and obtain a simple and straightforward proof of Ramanathan and Steger's well known result regarding the density of Gabor frames and Gabor Riesz sequences. Moreover, this point of view allows us to extend this result in several directions. The approach we use was first observed by A. Olevskii and the third author in their study of exponential systems, here we develop and simplify it further.

math.CA↗

arXiv2017

The Superradiant Instability in AdS

We consider the intermediate and end state behavior of the superradiantly perturbed Kerr black hole. Superradiant scattering in an asymptotically flat background is considered first. The case of a Kerr black hole in an Anti de-Sitter background is then discussed. Specifically we review what is known about the superradiant instability arising in AdS and its possible end state behavior.

gr-qc↗

arXiv2014

Ray-tracing for coordinate knowledge in the JWST Integrated Science Instrument Module

Optical alignment and testing of the Integrated Science Instrument Module of the James Webb Space Telescope is underway. We describe the Optical Telescope Element Simulator used to feed the science instruments with point images of precisely known location and chief ray pointing, at appropriate wavelengths and flux levels, in vacuum and at operating temperature. The simulator's capabilities include a number of devices for in situ monitoring of source flux, wavefront error, pupil illumination, image position and chief ray angle. Taken together, these functions become a fascinating example of how the first order properties and constructs of an optical design (coordinate systems, image surface and pupil location) acquire measurable meaning in a real system. We illustrate these functions with experimental data, and describe the ray tracing system used to provide both pointing control during operation and analysis support subsequently. Prescription management takes the form of optimization and fitting. Our core tools employ a matrix/vector ray tracing model which proves broadly useful in optical engineering problems. We spell out its mathematical basis, and illustrate its use in ray tracing plane mirror systems relevant to optical metrology such as a pentaprism and corner cube.

astro-ph.IM↗