arXiv subjects

Peter L. McMahon

Publications and source records attributed to Peter L. McMahon.

At least 19 recordsLinked to original sources

arXiv2026

Fabrication-free assessment of microwave losses in germanium-based dielectrics and superconductors

We present a flip-chip-based sensing scheme to measure effective microwave losses associated with target materials for quantum technologies, without requiring any device fabrication on the material under test. Using this approach, we quantify the microwave losses of a strain-engineered Ge/SiGe quantum well heterostructure and investigate losses arising from its Ge substrate and intermediate layers. The quality factors of the fabricated microwave resonators agree with the losses of dielectric materials independently extracted from flip-chip sensing measurements. We further study the superconductor platinum silicon germanide (PtSiGe) prepared by thermal reaction with a deposited Pt film, finding high microwave losses that limit the suitability of the films studied here as the sole superconductor for high-quality resonator applications. By coating Pt with Nb prior to the reaction, we observe a substantial reduction in microwave loss and a nearly three-fold enhancement of the transport critical temperature. The temperature dependence of the microwave loss is consistent with gap inhomogeneity in both superconducting films. These results identify constraints on material choices, provide design guidance for microwave circuits on planar Ge heterostructures, and demonstrate a fast-turnaround testing method for new materials for superconducting quantum circuits.

quant-ph↗

arXiv2026

Quantum Computational Sensing

Quantum computing has the potential to deliver large advantages on computational tasks, but advantages for practical tasks are not yet achievable with current hardware. Quantum sensing is an entirely separate quantum technology that can provide its own kind of a quantum advantage. In this Perspective, we explain how the merger of quantum sensing with quantum computing has recently given rise to the notion of quantum computational sensing, and a new kind of quantum advantage: a quantum computational-sensing advantage. This advantage can be realized with far lower hardware requirements than purely computational quantum advantage. We explain how several recent proposals and experiments can be understood as quantum computational sensing, and discuss categorizations of the general architectures that quantum-computational-sensing protocols can have. We conclude with an outlook on open questions and the prospects for quantum computational sensors and quantum computational-sensing advantage.

quant-ph↗

arXiv2026

Quantum computational displacement sensing

Quantum computational sensing (QCS) combines quantum sensing with quantum computing to extract task-relevant information from the physical world. QCS can in principle achieve an accuracy advantage for specific tasks versus the alternative of raw-signal estimation using conventional quantum sensing followed by task-specific classical postprocessing. Here we report the experimental demonstration of quantum computational displacement sensing (QCDS) with a superconducting circuit comprising a qubit coupled to an oscillator. We consider binary classification sensing tasks, where the goal is to predict the class label of a single complex-valued displacement sensed once by the oscillator. Rather than estimating the displacement, our computational-sensing protocol -- using parameterized quantum circuits before and after sensing -- attempts to determine the binary class label using quantum processing and map it onto the ground or excited state of the qubit. A single measurement of the qubit directly outputs the prediction. We implemented circuits with up to 24 entangling gates and 38 free parameters, which were trained in silico. We show that increasing the circuit depth systematically improves expressivity and classification accuracy. We experimentally obtained an accuracy advantage over a suite of protocols that first use conventional quantum sensing to estimate the displacement before using classical postprocessing to perform prediction. For certain tasks, our protocol achieves a 15-percentage-points higher classification accuracy than most conventional approaches considered. Our results establish the feasibility of quantum computational sensing with noisy superconducting hardware and illustrate how integrating quantum computation with quantum sensing can enhance performance when the goal is to estimate a property or function of a signal rather than to estimate the signal.

quant-ph↗

arXiv2026

Quantum sensors that compute: quantum computational magnetic-field sensing using a superconducting qubit

A measurement of a single-qubit quantum sensor reveals at most 1 bit of information about the signal that was sensed. To perform a classification task on the signal, the conventional approach is to repeat a sensing protocol many times, averaging the measurement results to obtain a high-precision estimate of the sensed signal, and then to apply classical postprocessing. Quantum computational sensing (QCS) is an alternative approach that breaks with the paradigm of first obtaining a classical estimate of the signal and then computing a function of the estimated signal in postprocessing. QCS instead combines quantum sensing with quantum computing to concentrate information about the signal relevant to the task into the solitary bit revealed by each measurement. Here, we report on the experimental demonstration of QCS where sensing and computing were both performed by the same single superconducting transmon qubit. We consider various binary classification tasks based on static and oscillating magnetic fields induced by current through a flux line. The fields were sensed through a double-junction superconducting quantum interference device (SQUID) loop that was part of the qubit. We used a protocol based on quantum signal processing to preprocess the sensed signals in the quantum domain prior to measurement. For tasks on static magnetic fields, our protocol outperformed the conventional baseline of Ramsey-based phase estimation by as much as 15 percentage points. For tasks on oscillating magnetic fields, we classified signal amplitude and frequency with up to 20 and 15 percentage points higher accuracy, respectively, compared to the conventional baseline of optimized dynamical-decoupling protocols. Our results illustrate how quantum computing can enhance quantum sensing even with a minimally sized quantum system subject to the practical limitations of decoherence and error-prone operations.

quant-ph↗

arXiv2026

Exponential quantum advantage for learning signals with a single qubit

Quantum technology has the potential to transform scientific discovery, but quantum advantages often require processing capabilities well beyond the reach of experimental platforms. We show that coupling a single controllable qubit to an otherwise conventional sensor can exponentially reduce the number of measurements required to learn classical signals. These rigorous quantum advantages apply to fundamental sensing tasks, including learning Fourier coefficients, extracting temporal correlations from time-varying signals, and estimating transformations of physical observables. Using a superconducting cavity--qubit architecture, we experimentally demonstrate $10^7$-fold reductions in the number of measurements required for Fourier-amplitude and time-varying signal learning. Our $\textit{quantum feature sensing}$ algorithms further enable orders-of-magnitude improvements in simulations of weak-signal dark matter detection and wireless communication applications. These quantum advantages are derived from Quantum Phase-Space Inference (Q$Ψ$), a unifying theory of quantum-enhanced experiments that simultaneously converts a set of experimental objectives and constraints into tight lower bounds and optimal quantum-enhanced learning algorithms while producing a certificate of quantum advantage. Q$Ψ$ extends beyond the regimes captured by quantum Fisher information and provides a framework for systematically identifying rigorous quantum advantages in practical experimental tasks. Together, our results establish that near-term quantum technology can exponentially enhance our ability to learn from classical signals.

quant-ph↗

arXiv2026

Quantum optical neural networks using atom-cavity interactions to provide all-optical nonlinearity

Optical neural networks (ONNs) have been developed to enhance processing speed and energy efficiency in machine learning by leveraging optical devices for nonlinear activation and establishing connections among neurons. In this work, we propose a quantum optical neural network (QONN) that utilizes atom-cavity neurons with controllable photon absorption and emission. These quantum neurons are designed to replace the electronic components in ONNs, which typically introduce delays and substantial energy consumption during nonlinear activation. To evaluate the performance of the QONN, we apply it to the MNIST digit classification task, considering the effects of photon absorption duration, random atom-cavity detuning, and stochastic photon loss. Additionally, we introduce a convolutional QONN to facilitate a real-world satellite image classification (SAT-6) task. Due to its compact hardware and low power consumption, the QONN offers a promising solution for real-time satellite sensing, reducing communication bandwidth with ground stations and thereby enhancing data security.

quant-ph↗

arXiv2026

Photonic Ising machines toward and beyond a million spins

Combinatorial optimization problems are central to many challenges in logistics, finance, engineering, and the life sciences, yet they remain among the most computationally demanding. Many of these problems can be mapped onto the Ising model, in which binary spins interact through a network of couplings, and solutions correspond to low-energy, ideally ground-state, spin configurations. Photonic Ising machines have the potential to be fast and energy-efficient heuristic solvers of optimization problems by leveraging the low latency, high bandwidth, and inherent parallelism of optics. However, current photonic implementations remain limited in scalability, connectivity, reconfigurability, and time-to-solution, preventing their use in many practical applications. In this perspective, we examine the current landscape of photonic Ising machines, discuss the challenges and limitations of existing platforms, and identify the scientific and technological advances needed to realize large-scale systems. These developments could establish photonic Ising machines as useful hardware platforms for practical optimization.

physics.optics↗

arXiv2026

Arbitrary control over multimode wave propagation for machine learning

Controlled multimode wave propagation can enable more space-efficient photonic processors than architectures based on discrete components connected by single-mode waveguides. Instead of defining discrete elements, one can sculpt the continuous substrate of a photonic processor to perform computations through multimode interference in two dimensions. Here we designed and demonstrated a device with a refractive index that can be rapidly reprogrammed across space, allowing arbitrary control of wave propagation. The device, a two-dimensional programmable waveguide, uses parallel electro-optic modulation of the refractive index of a slab waveguide with about $10^4$ programmable spatial degrees of freedom. We implemented neural network inference on benchmark tasks with up to $49$-dimensional vectors in a single pass, without digital pre-processing or post-processing. Theoretical and numerical analyses further indicated that two-dimensional programmable waveguides may offer not only a constant-factor reduction in device area but also a scaling benefit, with the area required growing as $N^{1.5}$ rather than $N^2$.

physics.optics↗

arXiv2026

Measurement-Adapted Eigentask Representations for Photon-Limited Optical Readout

Optical readout in low-light imaging is fundamentally limited by measurement noise, including photon shot noise, detector noise, and quantization error. In this regime, downstream inference depends not only on the optical front end, but also on how noisy high-dimensional sensor measurements are represented before classification or decision-making. Here we show that eigentasks provide a measurement-adapted representation for optical sensor outputs by ordering readout features according to their resolvability under noise. Using experimental data from a lens-based optical imaging system and a reanalysis of published data from a single-photon-detection neural network, we find that eigentask representations frequently outperform standard baselines including principal component analysis and filtering-based compression. The advantage is most pronounced in photon-limited, few-shot, and higher-difficulty classification regimes. In few-shot MPEG-7 classification, for example, the advantage over other methods reaches about 10 percentage points as the number of classes increases. In these settings, eigentasks yield more informative low-dimensional features and improve sample-efficient downstream learning. These results identify measurement-adapted representation as a promising strategy for optical inference when photon budget, acquisition time, and task complexity are constrained.

physics.optics↗

arXiv2026

Physical Foundation Models: Fixed hardware implementations of large-scale neural networks

Foundation models are deep neural networks (such as GPT-5, Gemini~3, and Opus~4) trained on large datasets that can perform diverse downstream tasks -- text and code generation, question answering, summarization, image classification, and so on. The philosophy of foundation models is to put effort into a single, large (${\sim}10^{12}$-parameter) general-purpose model that can be adapted to many downstream tasks with no or minimal additional training. We argue that the rise of foundation models presents an opportunity for hardware engineers: in contrast to when different models were used for different tasks, it now makes sense to build special-purpose, fixed hardware implementations of neural networks, manufactured and released at the roughly 1-year cadence of major new foundation-model versions. Beyond conventional digital-electronic inference hardware with read-only weight memory, we advocate a more radical re-thinking: hardware in which the neural network is realized directly at the level of the physical design and operates via the hardware's natural physical dynamics -- \textit{Physical Foundation Models} (PFMs). PFMs could enable orders-of-magnitude advantages in energy efficiency, speed, and parameter density. For ${\sim}10^{12}$-parameter models, this would both reduce the high energy burden of AI in datacenters and enable AI in edge devices that today are power-constrained to far smaller models. PFMs could also enable inference hardware for models much larger than current ones: $10^{15}$- or even $10^{18}$-parameter PFMs seem plausible by some measures. We present back-of-the-envelope calculations illustrating PFM scaling using an optical example -- a 3D nanostructured glass medium -- and discuss prospects in nanoelectronics and other physical platforms. We conclude with the major research challenges that must be resolved for trillion-parameter PFMs and beyond to become reality.

cs.LG↗

arXiv2026

TRON: Trainable, architecture-reconfigurable random optical neural networks

Deep learning has triggered explosive growth in the demand for specialized hardware processors, thus motivating the development of scalable and reconfigurable computing substrates. Optical processors offer a fundamentally different computing paradigm, combining massive parallelism and ultrahigh bandwidth with the potential for substantial energy savings. However, progress has been constrained by the absence of scalable and reconfigurable architectures that can implement a broad class of network architectures. Here, we introduce TRON, a scalable and trainable optoelectronic deep optical neural network that exploits a multi-scattering medium and a DMD as a learnable, high-dimensional dense optical matrix multiplier, processing with fixed and tunable optical operations. We perform in-situ optimization of the optical parameters involved in the scattering process, together with automated neural architecture search (NAS) and optimization directly on optics. The experimental results demonstrate that in-situ NAS is essential to discover architectures that adapt to both the task and hardware constraints, establishing a viable path towards large-scale optical processors for next-generation machine learning and data-intensive computing.

physics.optics↗

arXiv2026

A fully parallel densely connected probabilistic Ising machine with inertia for real-time applications

Ising machines -- special-purpose hardware for heuristically solving Ising optimization problems -- based on probabilistic bits (p-bits) have been established as a promising alternative to heuristic optimization algorithms run on conventional computers. However, it has -- until now -- been thought that Ising spins that are connected in probabilistic Ising machines cannot be updated in parallel without ruining the machine's solving ability. This has been a major challenge for using probabilistic Ising machines as fast solvers for densely connected problems. Here, we circumvent this by introducing a modified Ising spin dynamics with an added inertia term, and verify in algorithm simulations, FPGA hardware emulation, and FPGA experiments that it enables fully parallel, synchronous updates while improving rather than degrading success probability. We evaluated on various types of abstract (Max-Cut and Sherrington-Kirkpatrick-model) and application-derived (MIMO, wireless detection) dense Ising benchmark instances. Performing fully parallel updates results in a speed advantage that grows faster than linearly with the number of spins, giving rise to large time-to-solution increases for practical problem sizes. For both Max-Cut and the SK-1 model at a problem size of 200, our approach achieved an average speedup of $\approx 35\times$, with the best single-instance speedup reaching $150\times$. As an example of the practical utility of our approach in an application where speed is critical, we further show by co-designing the algorithm dynamics with the hardware implementation -- co-optimizing for solver ability and silicon resource usage -- that probabilistic Ising machines based on our approach satisfy the stringent solution quality and latency/throughput requirements for real-time MIMO detection in modern 5G cellular wireless networks while using a practically reasonable silicon area.

cs.ET↗

arXiv2026

Ultra-low-light computer vision using trained photon correlations

Illumination using correlated photon sources has been established as an approach to allowing high-fidelity images to be reconstructed from noisy camera frames by taking advantage of the knowledge that signal photons are spatially correlated whereas detector clicks due to noise are uncorrelated. However, in computer-vision tasks, the goal is often not ultimately to reconstruct an image, but to make inferences about a scene -- such as what object is present. Here we show how correlated-photon illumination can be used to gain an advantage in a hybrid optical-electronic computer-vision pipeline for object recognition. We demonstrate correlation-aware training (CAT): end-to-end optimization of a trainable correlated-photon illumination source and a Transformer backend in a way that the Transformer can learn to benefit from the correlations, using a small number (<= 100) of shots. We show a classification accuracy enhancement of up to 15 percentage points over conventional, uncorrelated-illumination-based computer vision in ultra-low-light and noisy imaging conditions, as well as an improvement over using untrained correlated-photon illumination. Our work illustrates how specializing to a computer-vision task -- object recognition -- and training the pattern of photon correlations in conjunction with a digital backend allows us to push the limits of accuracy in highly photon-budget-constrained scenarios beyond existing methods focused on image reconstruction.

cs.CV↗

arXiv2026

Machine vision with small numbers of detected photons per inference

Machine vision, including object recognition and image reconstruction, is a central technology in many consumer devices and scientific instruments. The design of machine-vision systems has been revolutionized by the adoption of end-to-end optimization, in which the optical front end and the post-processing back end are jointly optimized. However, while machine vision currently works extremely well in moderate-light or bright-light situations -- where a camera may detect thousands of photons per pixel and billions of photons per frame -- it is far more challenging in very low-light situations. We introduce photon-aware neuromorphic sensing (PANS), an approach for end-to-end optimization in highly photon-starved scenarios. The training incorporates knowledge of the low photon budget and the stochastic nature of light detection when the average number of photons per pixel is near or less than 1. We report a proof-of-principle experimental demonstration in which we performed low-light image classification using PANS, achieving 73% (82%) accuracy on FashionMNIST with an average of only 4.9 (17) detected photons in total per inference, and 86% (97%) on MNIST with 8.6 (29) detected photons -- orders of magnitude more photon-efficient than conventional approaches. We also report simulation studies showing how PANS could be applied to other classification, event-detection, and image-reconstruction tasks. By taking into account the statistics of measurement results for non-classical states or alternative sensing hardware, PANS could in principle be adapted to enable high-accuracy results in quantum and other photon-starved setups.

physics.optics↗

arXiv2025

Exponential advantage in quantum sensing of correlated parameters

Conventionally in quantum sensing, the goal is to estimate one or more unknown parameters that are assumed to be deterministic - that is, they do not change between shots of the quantum-sensing protocol. We instead consider the setting where the parameters are stochastic: each shot of the quantum-sensing protocol senses parameter values that come from independent random draws. In this work, we explore three examples where the stochastic parameters are correlated and show how using entanglement provides a benefit in classification or estimation tasks: (1) a two-parameter classification task, for which there is an advantage in the low-shot regime; (2) an $N$-parameter estimation task and a classification variant of it, for which an entangled sensor requires just a constant number (independent of $N$) shots to achieve the same accuracy as an unentangled sensor using exponentially many (${\sim}2^N$) shots; (3) classifying the magnetization of a spin chain in thermal equilibrium, where the individual spins fluctuate but the total spin in one direction is conserved - this gives a practical setting in which stochastic parameters are correlated in a way that an entangled sensor can be designed to exploit. We also present a theoretical framework for assessing, for a given choice of entangled sensing protocol and distributions to discriminate between, how much advantage the entangled sensor would have over an unentangled sensor. Our work motivates the further study of sensing correlated stochastic parameters using entangled quantum sensors - and since classical sensors by definition cannot be entangled, our work shows the possibility for entangled quantum sensors to achieve an exponential advantage in sample complexity over classical sensors, in contrast to the typical quadratic advantage.

quant-ph↗

arXiv2025

Quantum computational sensing using quantum signal processing, quantum neural networks, and Hamiltonian engineering

Combining quantum sensing with quantum computing can lead to quantum computational sensors that are able to more efficiently extract task-specific information from physical signals than is possible otherwise. Early examples of quantum computational sensing (QCS) have largely focused on protocols where only a single sensing operation appears before measurement -- with an exception being the recent application of Grover's algorithm to signal detection. In this paper we present, in theory and numerical simulations, the application of two quantum algorithms -- quantum signal processing and quantum neural networks -- to various binary and multiclass machine-learning classification tasks in sensing. Here sensing operations are interleaved with computing operations, giving rise to nonlinear functions of the sensed signals. We have evaluated tasks based on static and time-varying signals, including spatiotemporal signals. Our approach to optimizing the circuit parameters in a QCS protocol takes into account quantum sampling noise and allows us to engineer protocols that can yield accurate results with as few as just a single measurement shot. In all cases, we have been able to show a regime of operation where a quantum computational sensor can achieve higher accuracy than a conventional quantum sensor, with a simulated accuracy advantage of $>$20 percentage points for some tasks. We also present protocols for performing nonlinear tasks using Hamiltonian-engineered bosonic systems and quantum signal processing with hybrid qubit-bosonic systems. Overall, we have shown that substantial quantum computational-sensing advantages can be obtained even if the quantum system is small, including few-qubit systems, systems comprising a single qubit and a single bosonic mode, and even just a single qubit alone -- raising the prospects for experimental proof-of-principle and practical realizations.

quant-ph↗

arXiv2025

Solving the compute crisis with physics-based ASICs

Escalating artificial intelligence (AI) demands expose a critical "compute crisis" characterized by unsustainable energy consumption, prohibitive training costs, and the approaching limits of conventional CMOS scaling. Physics-based Application-Specific Integrated Circuits (ASICs) present a transformative paradigm by directly harnessing intrinsic physical dynamics for computation rather than expending resources to enforce idealized digital abstractions. By relaxing the constraints needed for traditional ASICs, like enforced statelessness, unidirectionality, determinism, and synchronization, these devices aim to operate as exact realizations of physical processes, offering substantial gains in energy efficiency and computational throughput. This approach enables novel co-design strategies, aligning algorithmic requirements with the inherent computational primitives of physical systems. Physics-based ASICs could accelerate critical AI applications like diffusion models, sampling, optimization, and neural network inference as well as traditional computational workloads like scientific simulation of materials and molecules. Ultimately, this vision points towards a future of heterogeneous, highly-specialized computing platforms capable of overcoming current scaling bottlenecks and unlocking new frontiers in computational power and efficiency.

cs.ET↗

arXiv2025

Large-scale quantum reservoir computing using a Gaussian Boson Sampler

A Gaussian boson sampler (GBS) is a special-purpose quantum computer that can be practically realized at large scale in optics. Here we report on experiments in which we used a frequency-multiplexed GBS with $>400$ modes as the reservoir in the quantum-machine-learning approach of quantum reservoir computing. We evaluated the accuracy of our GBS-based reservoir computer on a variety of benchmark tasks, including spoken-vowels classification and MNIST handwritten-digit classification. We found that when the reservoir computer was given access to the correlations between measured modes of the GBS, the achieved accuracies were the same or higher than when it was only given access to the mean photon number in each mode -- and in several cases the advantage in accuracy from using the correlations was greater than 20 percentage points. This provides experimental evidence in support of theoretical predictions that access to correlations enhances the power of quantum reservoir computers. We also tested our reservoir computer when operating the reservoir with various sources of classical rather than squeezed (quantum) light and found that using squeezed light consistently resulted in the highest (or tied highest, for simple tasks) accuracies. Our work experimentally establishes that a GBS can be an effective reservoir for quantum reservoir computing and provides a practical platform for experimentally exploring the role of quantumness and correlations in quantum machine learning at very large system sizes.

quant-ph↗