arXiv subjects

William J. Munro

Publications and source records attributed to William J. Munro.

At least 37 records · Page 2Linked to original sources

arXiv2025

Quantum phase transitions in the multiphoton Jaynes-Cummings-Hubbard model

We explore quantum phase transitions in the multiphoton Jaynes-Cummings-Hubbard model (JCHM). Using the mean-field approximation, we demonstrate that the multiphoton JCHM exhibits quantum phase transitions between the Mott insulator (MI) phase, the superfluid phase, and an additional phase we refer to as the forbidden phase. The multiphoton JCHM MI phases are classified according to a conserved quantity associated with the total number of excited atoms and photons. When this conserved quantity diverges toward positive infinity, this system enters the forbidden phase. By analyzing the system, we observe MI, superfluid, and forbidden phases in both the single- and two-photon JCHMs, although the MI phases in the two-photon case are confined to subspaces with small values of the conserved quantity. In contrast, only the superfluid and forbidden phases appear in the three- and four-photon JCHMs, with no MI phase observed.

quant-ph↗

arXiv2025

Self-Induced Superradiant Masing

In cavity quantum electrodynamics (cQED) and particularly superradiance, emitters are typically assumed to be independent, interacting only through light shared via a common mode. While such photon-mediated interactions lead to a rich spectrum of collective optical effects, direct dipole-dipole interactions within the emitter ensemble are generally viewed as a source of decoherence. Here, we uncover a new role for direct spin-spin interactions as a drive for the superradiant dynamics of a hybrid system of nitrogen-vacancy center spins in diamond coupled to a superconducting microwave cavity. After an initial fast superradiant burst, we observe an unexpected train of subsequent emission pulses followed by quasi-continuous masing for up to one millisecond. We show that this surprising behavior arises from spectral hole refilling, where spin inversion is redistributed into the superradiant window of spins resonant with the cavity. We report measurements that clearly exclude other cQED-related effects, and performed microscopic simulations of up to one million spins, which demonstrate that the observed self-induced masing is indeed driven by dipole-dipole interactions between the spins. These findings open new pathways for exploring complex spin-spin interactions in dense disordered systems and offer possibilities for ultra-narrow linewidth solid-state superradiant masers powered purely by microwave-driven spin control.

quant-ph↗

arXiv2025

Quality of Service in aggregated quantum networks

Future quantum networks will enable the interconnection of multiple users distributed across vast geographic distances. Due to these large separations and limited physical resources, communication will often rely on multi-path routing strategies, where physical resources are distributed across channels of varying lengths and delivered to end users. Efficient long-distance quantum communication therefore requires optimizing the allocation of these resources across available paths. In this work, we introduce a performance-oriented approach to quantum network routing by extending the classical concept of Quality of Service (QoS) to the context of multi-path quantum resources distribution. Unlike prior models that consider entanglement generation or quantum memory coherence in isolation, we investigate the interplay between path assignment strategies, coherence time constraints, and quantum error correction (QEC), and how they jointly impact end-to-end communication fidelity. We analyze both unencoded and encoded transmissions over aggregated network paths, quantifying the effects of resource allocation on transmission success. Our findings show that fidelity cannot be optimized independently of memory lifetimes, and that while QEC can enhance performance under specific conditions, it also imposes additional constraints depending on network topology and path-length asymmetries. This work provides a foundation for developing QoS-aware quantum routing protocols that balance fidelity, throughput, and memory utilization -- key considerations for near-term quantum repeater networks.

quant-ph↗

arXiv2025

Fractal Path Strategies for Efficient 2D DMRG Simulations

Numerical simulations of quantum magnetism in two spatial dimensions are often constrained by the area law of entanglement entropy, which heavily limits the accessible system sizes in tensor network methods. In this work, we investigate how the choice of mapping from a two-dimensional lattice to a one-dimensional path affects the accuracy of the two-dimensional Density Matrix Renormalization Group algorithm. We systematically evaluate all mappings corresponding to a subset of the Hamiltonian paths of the $N \cross N$ grid graphs up to $N=8$ and demonstrate that the fractal space-filling curves generally lead to faster convergence in ground state searches compared to the commonly used ``snake" path. To explain this performance gain, we analyze various locality metrics and propose a scalable method for constructing high-performing paths on larger lattices by tiling smaller optimal paths. Our results show that such paths consistently improve simulation convergence, with the advantage increasing with system size.

cond-mat.str-el↗

arXiv2025

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↗

arXiv2024

Continuous-Variable Multiplexed Quantum Repeater Networks

Continuous-variable (CV) codes and their application in quantum communication have attracted increasing attention. In particular, one typical CV codes, cat-codes, has already been experimentally created using trapped atoms in cavities with relatively high fidelities. However, when these codes are used in a repeater protocol, the secret key rate (SKR) that can be extracted between two remote users is extremely low. Here we propose a quantum repeater protocol based on cat codes with a few quantum memories or graph states as additional resources. This allows us to considerably increase the secret key rate by several orders of magnitude. Our findings provide valuable insights for designing efficient quantum repeater systems, advancing the feasibility and performance of quantum communication over long distances.

quant-ph↗

arXiv2024

Efficient charging of multiple open quantum batteries through dissipation and pumping

We explore a protocol that efficiently charges multiple open quantum batteries in parallel using a single charger. This protocol shows super-extensive charging through collective coupling of the charger and the battery to the same thermal reservoir. When applied to multiple quantum batteries, each coupled to different thermal reservoirs, the energy cannot be efficiently transferred from the charger to the battery via collective dissipation alone. We show that the counter-intuitive act of incorporating both dissipation and incoherent collective pumping on the charger enables efficient parallel charging of many quantum batteries.

quant-ph↗

arXiv2024

A Quantum-Resistant Photonic Hash Function

We propose a quantum hash function based on Gaussian boson sampling on a photonic quantum computer, aiming to provide quantum-resistant security. Extensive simulations demonstrate that this hash function exhibits strong properties of preimage, second preimage, and collision resistance, which are essential for cryptographic applications. Notably, the estimated number of attempts required for a successful collision attack increases exponentially with the mode counts of the photonic quantum computer, suggesting robust resistance against birthday attacks. We also analyze the sampling cost for physical implementation and discuss potential applications to blockchain technologies, where the inherent quantum nature of the hash computation could provide quantum-resistant security. The high dimensionality of the quantum state space involved in the hashing process poses significant challenges for quantum attacks, indicating a path towards quantum security. Our work lays the foundation for a new paradigm of quantum-resistant hashing with applications in emerging quantum-era information systems.

quant-ph↗

arXiv2024

Impact of the form of weighted networks on the quantum extreme reservoir computation

The quantum extreme reservoir computation (QERC) is a versatile quantum neural network model that combines the concepts of extreme machine learning with quantum reservoir computation. Key to QERC is the generation of a complex quantum reservoir (feature space) that does not need to be optimized for different problem instances. Originally, a periodically-driven system Hamiltonian dynamics was employed as the quantum feature map. In this work we capture how the quantum feature map is generated as the number of time-steps of the dynamics increases by a method to characterize unitary matrices in the form of weighted networks. Furthermore, to identify the key properties of the feature map that has sufficiently grown, we evaluate it with various weighted network models that could be used for the quantum reservoir in image classification situations. At last, we show how a simple Hamiltonian model based on a disordered discrete time crystal with its simple implementation route provides nearly-optimal performance while removing the necessity of programming of the quantum processor gate by gate.

quant-ph↗

arXiv2024

Heralded single-photon source based on superpositions of squeezed states

We propose a heralded single-photon source based on injecting a superposition of oppositely squeezed states onto a beam splitter. Our superposition of squeezed states is composed of only even photon number states (the number of photons is equal to $2,6,10,...$) meaning the probability for an emitted single photon given as a heralded single-photon event is higher than what one can achieve from the usual two-mode squeezed state. This enables one to realize an enhanced heralded single-photon source. We discuss how to create this superposition of squeezed states utilizing a single-mode squeezed state and the cross-Kerr nonlinearity. Our proposed method significantly improves the probability of emitting the heralded single photon compared to spontaneous parametric down-conversion.

quant-ph↗

arXiv2024

Tensor-Networks-based Learning of Probabilistic Cellular Automata Dynamics

Algorithms developed to solve many-body quantum problems, like tensor networks, can turn into powerful quantum-inspired tools to tackle problems in the classical domain. In this work, we focus on matrix product operators, a prominent numerical technique to study many-body quantum systems, especially in one dimension. It has been previously shown that such a tool can be used for classification, learning of deterministic sequence-to-sequence processes and of generic quantum processes. We further develop a matrix product operator algorithm to learn probabilistic sequence-to-sequence processes and apply this algorithm to probabilistic cellular automata. This new approach can accurately learn probabilistic cellular automata processes in different conditions, even when the process is a probabilistic mixture of different chaotic rules. In addition, we find that the ability to learn these dynamics is a function of the bit-wise difference between the rules and whether one is much more likely than the other.

cond-mat.stat-mech↗

arXiv2024

Quantum aggregation with temporal delay

Advanced quantum networking systems rely on efficient quantum error correction codes for their optimal realization. The rate at which the encoded information is transmitted is a fundamental limit that affects the performance of such systems. Quantum aggregation allows one to increase the transmission rate by adding multiple paths connecting two distant users. Aggregating channels of different paths allows more users to simultaneously exchange the encoded information. Recent work has shown that quantum aggregation can also reduce the number of physical resources of an error correction code when it is combined with the quantum multiplexing technique. However, the different channel lengths across the various paths means some of the encoded quantum information will arrive earlier than others and it must be stored in quantum memories. The information stored will then deteriorate due to decoherence processes leading to detrimental effects for the fidelity of the final quantum state. Here, we explore the effects of a depolarization channel that occurs for the quantum Reed-Solomon code when quantum aggregation involving different channel lengths is used. We determine the best distribution of resources among the various channels connecting two remote users. Further we estimate the coherence time required to achieve a certain fidelity. Our results will have a significant impact on the ways physical resources are distributed across a quantum network.

quant-ph↗

arXiv2023

Entanglement generation between distant spins via quasilocal reservoir engineering

The generation and preservation of entanglement is a central goal in quantum technology. Traditionally, dissipation in quantum systems is thought to be detrimental to entanglement, however dissipation can also be utilised as a means of generating entanglement between quantum spins that are not directly interacting. In particular entanglement can be generated between two qubits, or multi qubit systems via a collective coupling to a reservoir. In this work, we explore multiple spin domains pairwise coupled to different reservoirs and show that entanglement can be generated between spins which are not coupled to each other, or even coupled to the same reservoir.

quant-ph↗

arXiv2023

Performance of Rotation-Symmetric Bosonic Codes in a Quantum Repeater Network

Quantum error correction codes based on continuous variables play an important role for the implementation of quantum communication systems. A natural application of such codes occurs within quantum repeater systems which are used to combat severe channel losses and local gate errors. In particular, channel loss drastically reduces the distance of communication between remote users. Here we consider a cavity-QED based repeater scheme to address the losses in the quantum channel. This repeater scheme relies on the transmission of a specific class of rotationally invariant error-correcting codes. We compare several rotation-symmetric bosonic codes (RSBCs) being used to encode the initial states of two remote users connected by a quantum repeater network against the convention of the cat codes and we quantify the performance of the system using the secret key rate. In particular, we determine the number of stations required to exchange a secret key over a fixed distance and establish the resource overhead.

quant-ph↗

arXiv2023

A quantum ticking self-oscillator using delayed feedback

Self-sustained oscillators (SSOs) is a commonly used method to generate classical clock signals and SSOs using delayed feedback have been developed commercially which possess ultra-low phase noise and drift. Research into the development of quantum self-oscillation, where one can also have a periodic and regular output {\em tick}, that can be used to control quantum and classical devices has received much interest and quantum SSOs so far studied suffer from phase diffusion which leads to the smearing out of the quantum oscillator over the entire limit cycle in phase space seriously degrading the system's ability to perform as a self-oscillation. In this paper, we explore quantum versions of time-delayed SSOs, which has the potentials to develop a ticking quantum clock. We first design a linear quantum SSO which exhibits perfect oscillation without phase diffusion. We then explore a nonlinear delayed quantum SSO but find it exhibits dephasing similar to previously studied non-delayed systems.

quant-ph↗

arXiv2023

Quantum signal processing with continuous variables

Quantum singular value transformation (QSVT) enables the application of polynomial functions to the singular values of near arbitrary linear operators embedded in unitary transforms, and has been used to unify, simplify, and improve most quantum algorithms. QSVT depends on precise results in representation theory, with the desired polynomial functions acting simultaneously within invariant two-dimensional subspaces of a larger Hilbert space. These two-dimensional transformations are largely determined by the related theory of quantum signal processing (QSP). While QSP appears to rely on properties specific to the compact Lie group SU(2), many other Lie groups appear naturally in physical systems relevant to quantum information. This work considers settings in which SU(1,1) describes system dynamics and finds that, surprisingly, despite the non-compactness of SU(1,1), one can recover a QSP-type ansatz, and show its ability to approximate near arbitrary polynomial transformations. We discuss various experimental uses of this construction, as well as prospects for expanded relevance of QSP-like ansätze to other Lie groups.

quant-ph↗

arXiv2023

Generation of a time-bin Greenberger--Horne--Zeilinger state with an optical switch

Multipartite entanglement is a critical resource in quantum information processing that exhibits much richer phenomenon and stronger correlations than in bipartite systems. This advantage is also reflected in its multi-user applications. Although many demonstrations have used photonic polarization qubits, polarization-mode dispersion confines the transmission of photonic polarization qubits through an optical fiber. Consequently, time-bin qubits have a particularly important role to play in quantum communication systems. Here, we generate a three-photon time-bin Greenberger-Horne-Zeilinger (GHZ) state using a 2 x 2 optical switch as a time-dependent beam splitter to entangle time-bin Bell states from a spontaneous parametric down-conversion source and a weak coherent pulse. To characterize the three-photon time-bin GHZ state, we performed measurement estimation, showed a violation of the Mermin inequality, and used quantum state tomography to fully reconstruct a density matrix, which shows a state fidelity exceeding 70%. We expect that our three-photon time-bin GHZ state can be used for long-distance multi-user quantum communication.

quant-ph↗

arXiv2023

Power of sequential protocols in hidden quantum channel discrimination

In many natural and engineered systems, unknown quantum channels act on a subsystem that cannot be directly controlled and measured, but is instead learned through a controllable subsystem that weakly interacts with it. We study quantum channel discrimination (QCD) under these restrictions, which we call hidden system QCD (HQCD). We find that sequential protocols achieve perfect discrimination and saturate the Heisenberg limit. In contrast, depth-1 parallel and multi-shot protocols cannot solve HQCD. This suggests that sequential protocols are superior in experimentally realistic situations.

quant-ph↗