Searcharxiv⌕ Search

arXiv subjects

William John Munro

Publications and source records attributed to William John Munro.

14 recordsLinked to original sources

Efficient Graph State Generation in Linear Optics

Graph states are central resources for quantum information processing, supporting applications in computation, communication, and error correction. In photonic systems, they are typically assembled from smaller entangled states using probabilistic fusion gates, which demand many photons and suffer from low success rates. We present an optimized scheme for directly generating caterpillar graph states (CGSs)---essential resource states for constructing high-dimensional lattice graph states---using only single-photon sources, linear optics, and heralded measurements. Based on the linear quantum graph (LQG) picture, our method produces CGSs efficiently. For CGSs of length $l\ge 3$, it requires $l-2$ fewer photons and achieves a success rate $2^{l-2}$ times higher than fusion-based approaches. These results demonstrate that the LQG picture provides a powerful and flexible route to generating complex photonic graph states for efficient quantum information processing.

quant-ph↗

Limits on Broadcasting Genuine Multipartite Entanglement in Quantum Networks

We establish operational limits on the broadcasting of genuine multipartite entanglement (GME) in quantum networks. Using a distributed protocol in which each of N parties locally implements optimal 1 $\to$ 2 cloning via beam-splitter interactions, we derive exact expressions for the broadcast fidelity of Greenberger-Horne-Zeilinger (GHZ), W states, and Cluster states in a limited setting. We show that the fidelity decays exponentially with system size as [c(R)]$^N$, providing a quantitative expression of multipartite entanglement monogamy in the broadcasting setting, and that both state families share a universal normalisation factor arising from independent post-selection probabilities. Most significantly, we prove a no-go result for simultaneous GME certification: for all reflectivities and all system sizes, the two broadcast copies cannot be simultaneously certified as genuinely multipartite entangled within the standard framework of fidelity-based witnesses. We further check this behaviour for three- and four-party cluster states, finding consistent results that support the generality of the no-go beyond the GHZ and W families. This obstruction arises from the redistribution of multipartite coherence, which both reduces the achievable fidelity and increases the corresponding certification threshold. Our results reveal a fundamental trade-off between the broadcastability of multipartite entanglement and its operational certifiability, and delineate intrinsic limits on entanglement distribution in quantum networks.

quant-ph↗

Efficient Preparation of Graph States using the Quotient-Augmented Strong Split Tree

Graph states are a key resource for measurement-based quantum computation and quantum networking, but state-preparation costs limit their practical use. Graph states related by local complement (LC) operations are equivalent up to single-qubit Clifford gates; one may reduce entangling resources by preparing a favorable LC-equivalent representative. However, exhaustive optimization over the LC orbit is not scalable. We address this problem using the split decomposition and its quotient-augmented strong split tree (QASST). For several families of distance-hereditary (DH) graphs, we use the QASST to characterize LC orbits and identify representatives with reduced controlled-Z count or preparation circuit depth. We also introduce a split-fuse construction for arbitrary DH graph states, achieving linear scaling with respect to entangling gates, time steps, and auxiliary qubits. Beyond the DH setting, we discuss a generalized divide-and-conquer split-fuse strategy and a simple greedy heuristic for generic graphs based on triangle enumeration. Together, these methods outperform direct implementations on sufficiently large graphs, providing a scalable alternative to brute-force optimization.

quant-ph↗

Quantum Random Features: A Spectral Framework for Quantum Machine Learning

Quantum machine learning (QML) models often require deep, parameterized circuits to capture complex frequency components, limiting their scalability and near-term implementation. We introduce \textit{Quantum Random Features} (QRF) and \textit{Quantum Dynamical Random Features} (QDRF), lightweight quantum reservoir models inspired by classical random Fourier features (RFF) that generate high-dimensional spectral representations without variational optimization. Using $Z$-rotation encoding combined with random permutations or Hamiltonian dynamics, these models achieve $N_f$-dimensional feature maps at preprocessing cost $O(\log(N_f))$. Spectral analysis shows that QRF and QDRF reproduce the behavior of RFF, while simulations on Fashion-MNIST reach up to 89.3\% accuracy-matching or surpassing classical baselines with scalable qubit requirements. By linking spectral theory with experimentally feasible quantum dynamics, this work provides a compact and hardware-compatible route to scalable quantum learning.

quant-ph↗

A three-dimensional multimode lumped-element resonator for collective spin manipulation and dispersive readout

We report a three-dimensional lumped-element multimode microwave resonator that enables homogeneous collective manipulation and dispersive readout of a macroscopic spin ensemble. By exploiting geometric symmetry, two antisymmetric modes with strongly suppressed cross-talk are engineered to spatially overlap and couple to the same ensemble at distinct frequencies. Using negatively charged nitrogen-vacancy centers in diamond at 28 mK, we observe collective strong coupling with a coupling strength of 5.0 MHz and demonstrate non-destructive dispersive readout via a detuned mode. The compact design, tunable coupling, and high field homogeneity make this resonator a versatile device for hybrid spin-photon systems and multimode solid-state quantum technologies.

quant-ph↗

Modular quantum extreme reservoir computing

Quantum reservoir computing employs fixed quantum dynamics as a feature map for machine learning. Integrating multiple quantum reservoirs, however, raises a key question: how few inter-module connections are sufficient to match the performance of a single reservoir? To address this, we explicitly separate intra-module dynamics from inter-module couplings and systematically examine different connectivity schemes. We find that even a small number of well-placed connections between two modules can match single-reservoir accuracy, with simple one-to-one connections proving highly effective. Performance generally improves with increasing inter-module entanglement, and these correlations persist for both $ZZ$-coupled and random modular reservoirs. Extensions to three modules and evaluations across multiple datasets (MNIST, Fashion-MNIST, CIFAR-10) suggest that the modular architecture can be applied to diverse reservoir types and image-classification datasets. These results motivate modular quantum reservoir designs that align naturally with realistic hardware, such as two-dimensional quantum-chip layouts or networks of small integrated quantum systems.

quant-ph↗

Simple Hamiltonian dynamics is a powerful quantum processing resource

A quadrillion dimensional Hilbert space hosted by a quantum processor with over 50 physical qubits has been expected to be powerful enough to perform computational tasks ranging from simulations of many-body physics to complex financial modeling. Despite few examples and demonstrations, it is still not clear how we can utilize such a large Hilbert space as a computational resource; in particular, how a simple and small quantum system could solve non-trivial computational tasks. In this paper, we show a simple Ising model capable of performing such non-trivial computational tasks in a quantum neural network model. An Ising spin chain as small as ten qubits can solve a practical image classification task with high accuracy. To evaluate the mechanism of its computation, we examine how the symmetries of the Hamiltonian would affect its computational power. We show how the interplay between complexity and integrability/symmetries of the quantum system dictates the performance as quantum neural network.

quant-ph↗

Multiplexed Quantum Communication with Surface and Hypergraph Product Codes

Connecting multiple processors via quantum interconnect technologies could help overcome scalability issues in single-processor quantum computers. Transmission via these interconnects can be performed more efficiently using quantum multiplexing, where information is encoded in high-dimensional photonic degrees of freedom. We explore the effects of multiplexing on logical error rates in surface codes and hypergraph product codes. We show that, although multiplexing makes loss errors more damaging, assigning qubits to photons in an intelligent manner can minimize these effects, and the ability to encode higher-distance codes in a smaller number of photons can result in overall lower logical error rates. This multiplexing technique can also be adapted to quantum communication and multimode quantum memory with high-dimensional qudit systems.

quant-ph↗

Threshold (Q, P) Quantum Distillation

Quantum distillation is the task of concentrating quantum correlations present in 'N' imperfect copies using free operations by involving all 'P' parties sharing the quantum correlations. We present a threshold quantum distillation task where the same objective is achieved but using fewer parties 'Q'. In particular, we give exact local filtering operations by the participating parties sharing a high-dimension multipartite GHZ or W state to distil the perfect quantum correlation. Specifically, an arbitrary GHZ state can be distilled using just one party in the network, as both the success probability of the distillation protocol and the fidelity after the distillation are independent of the number of parties. However, for a general W-state, at least 'P-1' parties are required for the distillation, indicating a strong relationship between the distillation and the separability of such states. Further, we connect threshold entanglement distillation and quantum steering distillation.

quant-ph↗

Coherent response of inhomogeneously broadened and spatially localized emitter ensembles in waveguide QED

Spectrally and spatially varying ensembles of emitters embedded into waveguides are ever-present in both well-established and emerging technologies. If control of collective excitations can be attained, a plethora of coherent quantum dynamics and applications may be realized on-chip in the scalable paradigm of waveguide quantum electrodynamics (WQED).Here, we investigate inhomogeneously broadened ensembles embedded with subwavelength spatial extent into waveguides employed as single effective and coherent emitters. We develop a method permitting the approximate analysis and simulation of such mesoscopic systems featuring many emitters, and show how collective resonances are observable within the waveguide transmission spectrum once their linewidth exceeds the inhomogeneous line. In particular, this allows for near-unity and tailorable non-Lorentzian extinction of waveguide photons overcoming large inhomogeneous broadening present in current state-of-the-art. As a particular illustration possible in such existing experiments, we consider the classic emulation of the cavity QED (CQED) paradigm here using ensembles of rare-earth ions as coherent mirrors and qubits and demonstrate the possibility of strong coupling given existing restrictions on inhomogeneous broadening and ensemble spatial extent. This work introduces coherent ensemble dynamics in the solid-state to WQED and extends the realm to spectrally tailorable emitters.

quant-ph↗

Resource Reduction in Multiplexed High-Dimensional Quantum Reed-Solomon Codes

Quantum communication technologies will play an important role in quantum information processing in the near future as we network devices together. However, their implementation is still a challenging task due to both loss and gate errors. Quantum error correction codes are one important technique to address this issue. In particular, the Quantum Reed-Solomon codes are known to be quite efficient for quantum communication tasks. The high degree of physical resources required, however, makes such a code difficult to use in practice. A recent technique called quantum multiplexing has been shown to reduce resources by using multiple degrees of freedom of a photon. In this work, we propose a method to decompose multi-controlled gates using fewer $\rm{CX}$ gates via this quantum multiplexing technique. We show that our method can significantly reduce the required number of $\rm{CX}$ gates needed in the encoding circuits for the quantum Reed-Solomon code. Our approach is also applicable to many other quantum error correction codes and quantum algorithms, including Grovers and quantum walks.

quant-ph↗

Generation of entangled photons using an arrayed waveguide grating

We propose an on-chip source of entangled photon pairs that uses an arrayed-waveguide grating (AWG) with multiple nonlinear input waveguides as correlated photon pair sources. The AWG wavelength-demultiplexes photon pairs created in input waveguides and simultaneously produces a high-dimensional entangled state encoded in the optical path. We implemented the device with a monolithic silicon-silica waveguide integration platform and demonstrated the entanglement of two dimensions in a proof-of-principle experiment.

quant-ph↗

Power dependence of electric dipole spin resonance

We develop a formalism of electric dipole spin resonance (EDSR) based on slanting magnetic field, where we especially investigate the microwave amplitude dependence. With increasing microwave amplitude, the Rabi frequency increases linearly for a spin confined in a harmonic potential. How- ever, when the spin is confined in the double-well potential, the Rabi frequency shows sub-linear dependence with increasing the microwave amplitude.

cond-mat.mes-hall↗

A monolithically integrated polarization entangled photon pair source on a silicon chip

Integrated photonic circuits are one of the most promising platforms for large-scale photonic quantum information systems due to their small physical size and stable interferometers with near-perfect lateral-mode overlaps. Since many quantum information protocols are based on qubits defined by the polarization of photons, we must develop integrated building blocks to generate, manipulate, and measure the polarization-encoded quantum state on a chip. The generation unit is particularly important. Here we show the first integrated polarization-entangled photon pair source on a chip. We have implemented the source as a simple and stable silicon-on-insulator photonic circuit that generates an entangled state with 91 \pm 2% fidelity. The source is equipped with versatile interfaces for silica-on-silicon or other types of waveguide platforms that accommodate the polarization manipulation and projection devices as well as pump light sources. Therefore, we are ready for the full-scale implementation of photonic quantum information systems on a chip.

quant-ph↗