arXiv subjects

Love A. Pettersson

Publications and source records attributed to Love A. Pettersson.

7 recordsLinked to original sources

arXiv2026

Photon Sorting with a Quantum Emitter

High-quality photonic Bell state measurements (BSMs) enable scalable universal quantum computing and long distance quantum communication. However, when implemented with linear optics, BSMs are fundamentally probabilistic, introducing substantial hardware overheads and limiting noise tolerance in photonic quantum computing architectures. Nonlinear interactions at the single-photon level can overcome these limitations by enabling near-deterministic photon-photon gates. Here, we demonstrate a passive photon-sorting circuit based on the induced nonlinearity arising from photon scattering in a solid-state quantum emitter. The scattering is implemented in a directional waveguide-emitter coupling interface and embedded on-chip into a linear optical circuit, through which we demonstrate sorting of one- and two-photon components with a success probability of 62%. We find that the current system can enable BSMs with a 57% post-selected success probability without ancillary photons, exceeding the linear-optical limit of 50%, and can be readily improved to >65% with design optimisations.

quant-ph↗

arXiv2026

High fidelity photon-photon gates by scattering off a two-level quantum emitter

We present a scheme for implementing a high-fidelity non-linear phase shift on a photonic state. The scheme is based on repeated scattering off a two-level quantum emitter embedded in a chiral or one-sided waveguide. The waveguide is equipped with elements inducing second-order dispersion and temporal phase shifts, which effectively form a harmonic trap and confine the photon pulses to a Gaussian shape. The same quantum emitter can be used for each scattering, and thus, only one quantum emitter is needed in this scheme. To illustrate the application of our scheme for photonic quantum computing and quantum communication, we analyze the implementation of a control-Z gate and a deterministic Bell-state analyzer for photonic qubits. Through numerical optimization, we show that we can reach a control-Z gate fidelity of $\mathcal{F} \sim 99.2\%$ ($\mathcal{F} \sim 96\%$) and a success probability of $P_s \sim 99.6 \%$ ($P_s\sim 98 \%$) for a Bell-state measurement with $N=17$ ($N=5$) scatterings.

quant-ph↗

arXiv2025

Transforming graph states via Bell state measurements

Graph states are key resources for measurement-based quantum computing, which is particularly promising for photonic systems. Fusions are probabilistic Bell state measurements, measuring pairs of parity operators of two qubits. Fusions can be used to connect/entangle different graph states, making them a powerful resource for measurement-based and related fusion-based quantum computing. There are several different graph structures and types of Bell state measurements, yet the associated graph transformations have only been analyzed for specific cases. Here, we provide a full set of graph transformation rules and give an intuitive visualization based on Venn diagrams of local neighborhoods of graph nodes. We derive these graph transformations for all types of rotated type-II fusion, showing that there are five different fusion success cases. Finally, we give application examples of the derived graph transformation rules and show that they can be used to construct graph codes or simulate fusion networks.

quant-ph↗

arXiv2025

Tailoring fusion-based photonic quantum computing schemes to quantum emitters

Fusion-based quantum computation is a promising quantum computing model where small-sized photonic resource states are simultaneously entangled and measured by fusion gates. Such operations can be readily implemented with scalable photonic hardware: resource states can be deterministically generated by quantum emitters and fusions require only shallow linear-optical circuits. Here, we propose fusion-based architectures tailored to the capabilities and noise models in quantum emitters. We show that high tolerance to dominant physical error mechanisms can be achieved, with fault-tolerance thresholds of 8% for photon loss, 4% for photon distinguishability between emitters, and spin noise thresholds well above memory-induced errors for typical spin-photon interfaces. Our construction and analysis provide guidelines for the development of photonic quantum hardware targeting fault-tolerant applications with quantum emitters.

quant-ph↗

arXiv2025

Generating graph states with a single quantum emitter and the minimum number of fusions

Graph states are the key resources for measurement- and fusion-based quantum computing with photons, yet their creation is experimentally challenging. We optimize a hybrid graph-state generation scheme using a single quantum emitter and linear optics Bell-state measurements called fusions. We first generate a restricted class of states from a single quantum emitter and then apply fusions to create a target graph state, where we use a dynamic programming approach to find the construction that requires the lowest possible number of fusions. Our analysis yields a lookup table for constructing $\sim 2.8\times 10^7$ non-isomorphic graph states with the minimum number of fusions. The lookup table covers all graph states with up to eight qubits and several other ones with up to 14 qubits. We present construction protocols of selected graph states and provide the lookup table. For large graph states that are not in the lookup table, we derive bounds for the required number of fusions using graph-theoretic properties. Finally, we use the lookup table to search for the best graph codes for loss-tolerant encodings, given a fixed number of fusions for their construction.

quant-ph↗

arXiv2024

Deterministic generation of concatenated graph codes from quantum emitters

Photon loss is the dominant noise mechanism in photonic quantum technologies. Designing fault-tolerant schemes with high tolerance to loss is thus a central challenge in scaling photonic quantum information processors. Concatenation of a fault-tolerant construction with a code able to efficiently correct loss is a promising approach to achieve this, but practical ways to implement code concatenation with photons have been lacking. We propose schemes for generating concatenated graph codes using multi-photon emission from two quantum emitters or a single quantum emitter coupled to a memory; capabilities available in several photonic platforms. We show that these schemes enable fault-tolerant fusion-based quantum computation in practical regimes with high photon loss and standard fusion gates without the need for auxiliary photons.

quant-ph↗

arXiv2022

Optimising graph codes for measurement-based loss tolerance

Graph codes play an important role in photonic quantum technologies as they provide significant protection against qubit loss, a dominant noise mechanism. Here, we develop methods to analyse and optimise measurement-based tolerance to qubit loss and computational errors for arbitrary graph codes. Using these tools we identify optimised codes with up to 12 qubits and asymptotically-large modular constructions. The developed methods enable significant benefits for various photonic quantum technologies, as we illustrate with novel all-photonic quantum repeater states for quantum communication and high-threshold fusion-based schemes for fault-tolerant quantum computing.

quant-ph↗