arXiv subjects

Guus Avis

Publications and source records attributed to Guus Avis.

17 recordsLinked to original sources

arXiv2026

Efficient Graph State Purification with Factorized Graph-Preserving Operations across Local Clifford Orbits

Graph states form a broad class of multipartite entangled states underlying measurement-based quantum computation, quantum networks, and stabilizer codes. However, systematic entanglement distillation for arbitrary graph states remains challenging because the circuit design space grows rapidly with the number of parties. We introduce a group of Clifford operations that we call "factorized graph-preserving". It enables us to efficiently enumerate and optimize graph-state purification circuits at finite size for realistic noisy hardware. These operations map products of graph-basis states to products of graph-basis states, so their action can be represented as permutations of graph-basis labels. Moreover, this useful gate set admits a compact factorized description determined by simple graph-theoretic features. This structure also allows, after some initial cached precomputation, drastically lower computational complexity for simulating a gate. We further organize these operations over local-complementation (LC) orbits using minimum-edge representatives (MERs), which let us design purification circuits that apply to all locally equivalent graph states (up to a basis change). Using this framework, we optimize noisy finite-size multipartite distillation circuits for several graph-state families. Numerical results show that the resulting graph-preserving circuits can outperform standard recurrence-based purification protocols under realistic gate and measurement noise. Our results establish LC-orbit structure and factorized graph-preserving operations as practical tools for scalable, topology-aware and hardware-constrained graph-state distillation protocol design. Our work can also be interpreted as a graph-based heuristic for finding transversal gates.

quant-ph↗

arXiv2026

Requirements for Teleportation in an Intercity Quantum Network

We investigate the hardware requirements for quantum teleportation in an intercity-scale network topology consisting of two metropolitan-scale networks connected via a long-distance backbone link. Specifically, we identify the minimal improvements required beyond the state-of-the-art to achieve an end-to-end expected teleportation fidelity of $2/3$, which represents the classical limit. To this end, we formulate the hardware requirements computation as optimisation problems, where the hardware parameters representing the underlying device capabilities serve as decision variables. Assuming a simplified noise model, we derive closed-form analytical expressions for the teleportation fidelity and rate when the network is realised using heterogeneous quantum hardware, including a quantum repeater chain with a memory cut-off. Our derivations are based on events defined by the order statistics of link generation durations in both the metropolitan networks and the backbone, and the resulting expressions are validated through simulations on the NetSquid platform. The analytical expressions facilitate efficient exploration of the optimisation parameter space without resorting to computationally intensive simulations. We then apply this framework to a representative realisation in which the metropolitan nodes are based on trapped-ion processors and the backbone is composed of ensemble-based quantum memories. Our results suggest that teleportation across metropolitan distances is already achievable with state-of-the-art hardware when the data qubit is prepared after end-to-end entanglement has already been established, whereas extending teleportation to intercity scales requires additional, though plausibly achievable, improvements in hardware performance.

quant-ph↗

arXiv2025

Routing in Non-Isotonic Quantum Networks

Optimal routing in quantum-repeater networks requires finding the best path that connects a pair of end nodes. Most previous work on routing in quantum networks assumes utility functions that are isotonic, meaning that the ordering of two paths does not change when extending both with the same edge. However, we show that utility functions that take into account both the rate and quality of the entanglement generation (e.g., the secret-key rate) are often non-isotonic. This makes pathfinding difficult as classical algorithms such as Dijkstra's become unsuitable, with the state of the art for quantum networks being an exhaustive search over all possible paths. In this work we present improved algorithms. First, we present two best-first-search algorithms that use destination-aware merit functions for faster convergence. One of these provably finds the best path, while the other uses heuristics to achieve an effectively sublinear scaling of the query count in the network size while in practice always finding a close-to-optimal path. Second, we present metaheuristic algorithms (simulated annealing and a genetic algorithm) that enable tuning a tradeoff between path quality and computational overhead. While we focus on swap-ASAP quantum repeaters for concreteness, our algorithms are readily generalized to different repeater schemes and models.

quant-ph↗

arXiv2025

Quantum Network Tomography for General Topology with SPAM Errors

The goal of quantum network tomography (QNT) is the characterization of internal quantum channels in a quantum network from external peripheral operations. Prior research has primarily focused on star networks featuring bit-flip and depolarizing channels, leaving the broader problem -- such as QNT for networks with arbitrary topologies and general Pauli channels -- largely unexplored. Moreover, establishing channel identifiability remains a significant challenge even in simplified quantum star networks. In the first part of this paper, we introduce a novel network tomography method, termed Mergecast, in quantum networks. We demonstrate that Mergecast, together with a progressive etching procedure, enables the unique identification of all internal quantum channels in networks characterized by arbitrary topologies and Pauli channels. As a side contribution, we introduce a subclass of Pauli channels, termed bypassable Pauli channels, and propose a more efficient unicast-based tomography method, called BypassUnicast, for networks exclusively comprising these channels. In the second part, we extend our investigation to a more realistic QNT scenario that incorporates state preparation and measurement (SPAM) errors. We rigorously formulate SPAM errors in QNT, propose estimation protocols for such errors within QNT, and subsequently adapt our Mergecast approaches to handle networks affected by SPAM errors. Lastly, we conduct NetSquid-based simulations to corroborate the effectiveness of our proposed protocols in identifying internal quantum channels and estimating SPAM errors in quantum networks. In particular, we demonstrate that Mergecast maintains good performance under realistic conditions, such as photon loss and quantum memory decoherence.

cs.NI↗

arXiv2025

GHZ-Preserving Gates and Optimized Distillation Circuits

Greenberger-Horne-Zeilinger (GHZ) states play a central role in quantum computing and communication protocols, as a typical multipartite entanglement resource. This work introduces an efficient enumeration and simulation method for circuits that preserve and distill noisy GHZ states, significantly reducing the simulation complexity of a gate on $n$ qubits, from exponential $O(2^n)$ for standard state-vector methods or $O(n)$ for Clifford circuits, to a constant $O(1)$ for the method presented here. This method has profound implications for the design of quantum networks, where preservation and purification of entanglement with minimal resource overhead is critical. In particular, we demonstrate the use of the new method in an optimization procedure enabled by the fast simulation, that discovers GHZ distillation circuits far outperforming the state of the art. Fine-tuning to arbitrary noise models is possible as well. We also show that the method naturally extends to graph states that are local Clifford equivalent to GHZ states.

quant-ph↗

arXiv2025

On the accuracy of twirled approximations in repeater chains

In the performance analysis of quantum networks, it is common to approximate bipartite entangled states as either being Bell-diagonal or Werner states. We refer to these as twirled approximations because it is possible to bring any state to such a form with a twirling map. Although twirled approximations can simplify calculations, they can lead to an inaccuracy in performance estimates. The goal of this work is to quantify this inaccuracy. We consider repeater chains where end-to-end entanglement is achieved by performing an entanglement swap at each repeater in the chain. We consider two scenarios: postselected and non-postselected entanglement swapping, where postselection is performed based on the Bell-state measurement outcomes at the repeaters. We show that, for non-postselected swapping, the Bell-diagonal approximation is exact for the computation of the Bell-diagonal elements of the end-to-end state. We also find that the Werner approximation accurately approximates the end-to-end fidelity when the infidelity of each initial state is small with respect to the number of repeaters in the chain. For postselected swapping, we find bounds on the difference in end-to-end fidelity from what is obtained with the twirled approximation, for initial states with a general noisy form. Finally, for the example of performing quantum key distribution over a repeater chain, we demonstrate how our insights can be used to understand how twirled approximations affect the secret-key rate.

quant-ph↗

arXiv2025

Piecemaker: a resource-efficient entanglement distribution protocol

We introduce multipartite entanglement distribution protocols that use a quantum switch to deliver stabilizer states to a number of remote end users. As in existing schemes, the first step in our protocols involves Bell pair generation between the switch and each end user. However, unlike existing schemes that wait for all Bell pairs to be established before distributing the desired state -- for example, via a projective measurement -- our approach stores only a minimal subset of Bell pairs while processing every subsequent Bell pair immediately. In doing so, our protocols reduce the average Bell pair storage time compared to existing schemes, resulting in less cumulative noise as a direct consequence. On the theoretical side, our protocol design is grounded in the structure of vertex covers in graph states up to local complementation. Through a comprehensive numerical evaluation, we compare the fidelities of delivered states with those of a baseline scheme, for state sizes up to n = 50 qubits. Simulations also show that our protocols can achieve the critical fidelity threshold of 1/2 for multipartite entanglement in a wider range of depolarization rates and success probabilities of Bell-pair generation. Overall, our protocols always achieve an equal or higher fidelity of the distributed state, and can reduce infidelity by up to 45%.

quant-ph↗

arXiv2025

Optimization of Quantum-Repeater Networks using Stochastic Automatic Differentiation

Quantum repeaters are envisioned to enable long-distance entanglement distribution. Analysis of quantum-repeater networks could hasten their realization by informing design decisions and research priorities. Determining derivatives of network properties is crucial towards that end, facilitating optimizations and revealing parameter sensitivity. Doing so, however, is difficult because the networks are discretely random. Here we use a recently developed technique, stochastic automatic differentiation, to automatically extract derivatives from discrete Monte Carlo simulations of repeater networks. With these derivatives, we optimize rate-fidelity tradeoffs in a repeater chain, determine the chain's sensitivity with respect to the coherence times of different nodes, and finally choose the locations of quantum repeaters in a two-dimensional plane to optimize the guaranteed quality of service between four end nodes. In particular, the technique enabled us to discover how the best achievable quality of service, the minimal number of repeaters required to improve a network, and the number of repeaters required to saturate the network scale with the physical size of the network.

quant-ph↗

arXiv2024

Hardware requirements for trapped-ion based verifiable blind quantum computing with a measurement-only client

In blind quantum computing, a user with a simple client device can perform a quantum computation on a remote quantum server such that the server cannot gain knowledge about the computation. Here, we numerically investigate hardware requirements for verifiable blind quantum computing using an ion trap as server and a distant measurement-only client. While the client has no direct access to quantum-computing resources, it can remotely execute quantum programs on the server by measuring photons emitted by the trapped ion. We introduce a numerical model for trapped-ion quantum devices in NetSquid, a discrete-event simulator for quantum networks. Using this, we determine the minimal hardware requirements on a per-parameter basis to perform the verifiable blind quantum computing protocol. We benchmark these for a five-qubit linear graph state, with which any single-qubit rotation can be performed, where client and server are separated by 50 km. Current state-of-the-art ion traps satisfy the minimal requirements on a per-parameter basis, but all current imperfections combined make it impossible to perform the blind computation securely over 50 km using existing technology. Using a genetic algorithm, we determine the set of hardware parameters that minimises the total improvements required, finding directions along which to improve hardware to reach our threshold error probability that would enable experimental demonstration. In this way, we lay a path for the near-term experimental progress required to realise the implementation of verifiable blind quantum computing over a 50 km distance.

quant-ph↗

arXiv2023

Co-Designed Superconducting Architecture for Lattice Surgery of Surface Codes with Quantum Interface Routing Card

Facilitating the ability to achieve logical qubit error rates below physical qubit error rates, error correction is anticipated to play an important role in scaling quantum computers. While many algorithms require millions of physical qubits to be executed with error correction, current superconducting qubit systems contain only hundreds of physical qubits. One of the most promising codes on the superconducting qubit platform is the surface code, requiring a realistically attainable error threshold and the ability to perform universal fault-tolerant quantum computing with local operations via lattice surgery and magic state injection. Surface code architectures easily generalize to single-chip planar layouts, however space and control hardware constraints point to limits on the number of qubits that can fit on one chip. Additionally, the planar routing on single-chip architectures leads to serialization of commuting gates and strain on classical decoding caused by large ancilla patches. A distributed multi-chip architecture utilizing the surface code can potentially solve these problems if one can optimize inter-chip gates, manage collisions in networking between chips, and minimize routing hardware costs. We propose QuIRC, a superconducting Quantum Interface Routing Card for Lattice Surgery between surface code modules inside of a single dilution refrigerator. QuIRC improves scaling by allowing connection of many modules, increases ancilla connectivity of surface code lattices, and offers improved transpilation of Pauli-based surface code circuits. QuIRC employs in-situ Entangled Pair (EP) generation protocols for communication. We explore potential topological layouts of QuIRC based on superconducting hardware fabrication constraints, and demonstrate reductions in ancilla patch size by up to 77.8%, and in layer transpilation size by 51.9% when compared to the single-chip case.

quant-ph↗

arXiv2023

Resource-efficient fault-tolerant one-way quantum repeater with code concatenation

One-way quantum repeaters where loss and operational errors are counteracted by quantum error correcting codes can ensure fast and reliable qubit transmission in quantum networks. It is crucial that the resource requirements of such repeaters, for example, the number of qubits per repeater node and the complexity of the quantum error correcting operations are kept to a minimum to allow for near-future implementations. To this end, we propose a one-way quantum repeater that targets both the loss and operational error rates in a communication channel in a resource-efficient manner using code concatenation. Specifically, we consider a tree-cluster code as an inner loss-tolerant code concatenated with an outer 5-qubit code for protection against Pauli errors. Adopting flag-based stabilizer measurements, we show that intercontinental distances of up to 10,000 km can be bridged with a minimal resource overhead by interspersing repeater nodes that each specializes in suppressing either loss or operational errors. Our work demonstrates how tailored error-correcting codes can significantly lower the experimental requirements for long-distance quantum communication.

quant-ph↗

arXiv2023

Asymmetric node placement in fiber-based quantum networks

Restrictions imposed by existing infrastructure can make it hard to ensure an even spacing between the nodes of future fiber-based quantum networks. We here investigate the negative effects of asymmetric node placement by considering separately the placement of midpoint stations required for heralded entanglement generation, as well as of processing-node quantum repeaters in a chain. For midpoint stations, we describe the effect asymmetry has on the time required to perform one entangling attempt, the success probability of such attempts, and the fidelity of the entangled states created. This includes accounting for the effects of chromatic dispersion on photon indistinguishability. For quantum-repeater chains we numerically investigate how uneven spacing between repeater nodes leads to bottlenecks, thereby increasing both the waiting time and the time states are stored in noisy quantum memory. We find that while the time required to perform one entangling attempt may increase linearly with the midpoint's asymmetry, the success probability and fidelity of heralded entanglement generation and the distribution time and error rate for repeater chains all have vanishing first derivatives with respect to the amount of asymmetry. This suggests resilience of quantum-network performance against small amounts of asymmetry.

quant-ph↗

arXiv2023

Requirements for upgrading trusted nodes to a repeater chain over 900 km of optical fiber

We perform a numerical study of the distribution of entanglement on a real-world fiber grid connecting the German cities of Bonn and Berlin. The connection is realized using a chain of processing-node quantum repeaters spanning roughly 900 kilometers. We investigate how minimal hardware requirements depend on the target application, as well as on the number of repeaters in the chain. We find that requirements for blind quantum computing are markedly different than those for quantum key distribution, with the required coherence time being around two and a half times larger for the former. Further, we observe a trade-off regarding how target secret-key rates are achieved when using different numbers of repeaters: comparatively low-quality entangled states generated at a high rate are preferred for higher numbers of repeaters, whereas comparatively high-quality states generated at a lower rate are favored for lower numbers of repeaters. To obtain our results we employ an extensive simulation framework implemented using NetSquid, a discrete-event simulator for quantum networks. These are combined with an optimization methodology based on genetic algorithms to determine minimal hardware requirements.

quant-ph↗

arXiv2022

Requirements for a processing-node quantum repeater on a real-world fiber grid

We numerically study the distribution of entanglement between the Dutch cities of Delft and Eindhoven realized with a processing-node quantum repeater and determine minimal hardware requirements for verifiable blind quantum computation using color centers and trapped ions. Our results are obtained considering restrictions imposed by a real-world fiber grid and using detailed hardware-specific models. By comparing our results to those we would obtain in idealized settings we show that simplifications lead to a distorted picture of hardware demands, particularly on memory coherence and photon collection. We develop general machinery suitable for studying arbitrary processing-node repeater chains using NetSquid, a discrete-event simulator for quantum networks. This enables us to include time-dependent noise models and simulate repeater protocols with cut-offs, including the required classical control communication. We find minimal hardware requirements by solving an optimization problem using genetic algorithms on a high-performance-computing cluster. Our work provides guidance for further experimental progress, and showcases limitations of studying quantum-repeater requirements in idealized situations.

quant-ph↗

arXiv2022

Analysis of Multipartite Entanglement Distribution using a Central Quantum-Network Node

We study the performance (rate and fidelity) of distributing multipartite entangled states in a quantum network through the use of a central node. Specifically, we consider the scenario where the multipartite entangled state is first prepared locally at a central node, and then transmitted to the end nodes of the network through quantum teleportation. As our first result, we present leading-order analytical expressions and lower bounds for both the rate and fidelity at which a specific class of multipartite entangled states, namely Greenberger-Horne-Zeilinger (GHZ) states, are distributed. Our analytical expressions for the fidelity accurately account for time-dependent depolarizing noise encountered by individual quantum bits while stored in quantum memory, as verified using Monte Carlo simulations. As our second result, we compare the performance to the case where the central node is an entanglement switch and the GHZ state is created by the end nodes in a distributed fashion. Apart from these two results, we outline how the teleportation-based scheme could be physically implemented using trapped ions or nitrogen-vacancy centers in diamond.

quant-ph↗

arXiv2020

Designing Quantum Networks Using Preexisting Infrastructure

We consider the problem of deploying a quantum network on an existing fiber infrastructure, where quantum repeaters and end nodes can only be housed at specific locations. We propose a method based on integer linear programming (ILP) to place the minimal number of repeaters on such an existing network topology, such that requirements on end-to-end entanglement-generation rate and fidelity between any pair of end-nodes are satisfied. While ILPs are generally difficult to solve, we show that our method performs well in practice for networks of up to 100 nodes. We illustrate the behavior of our method both on randomly-generated network topologies, as well as on a real-world fiber topology deployed in the Netherlands.

quant-ph↗

arXiv2019

Spatial Curvature at the Sound Horizon

The effect of spatial curvature on primordial perturbations is controlled by $ Ω_{K,0}/c_{s}^{2} $, where $ Ω_{K,0} $ is today's fractional density of spatial curvature and $ c_{s} $ is the speed of sound during inflation. Here we study these effects in the limit $ c_{s}\ll 1 $. First, we show that the standard cosmological soft theorems in flat universes are violated in curved universes and the soft limits of correlators can have non-universal contributions even in single-clock inflation. This is a consequence of the fact that, in the presence of spatial curvature, there is a gap between the spectrum of residual diffeomorphisms and that of physical modes. Second, there are curvature corrections to primordial correlators, which are not scale invariant. We provide explicit formulae for these corrections to the power spectrum and the bispectrum to linear order in curvature in single-clock inflation. We show that the large-scale CMB anisotropies could provide interesting new constraints on these curvature effects, and therefore on $ Ω_{K,0}/c_{s}^{2} $, but it is necessary to go beyond our linear-order treatment.

astro-ph.CO↗