arXiv subjects

Wolfgang Dür

Publications and source records attributed to Wolfgang Dür.

At least 19 recordsLinked to original sources

arXiv2026

Flexible Qubit Allocation of Network Resource States

The Quantum Internet is still in its infancy, yet identifying scalable and resilient quantum network resource states is an essential task for realizing it. We explore the use of graph states with flexible, non-trivial qubit-to-node assignments. This flexibility enables adaptable engineering of the entanglement topology of an arbitrary quantum network. In particular, we focus on cluster states with arbitrary allocation as network resource states and as a promising candidate for a \textit{network core}-level entangled resource, due to its intrinsic flexible connectivity properties and resilience to particle losses. We introduce a modeling framework for overlaying entanglement topologies on physical networks and demonstrate how optimized and even random qubit assignment creates shortcuts and improves robustness and memory savings, while reducing the worst-case hop distance between remote network nodes, when compared to conventional approaches.

quant-ph↗

arXiv2026

Limitations of Error Model Approximations in Quantum Network Simulation

Efficient classical simulation of large-scale quantum networks frequently relies on noise approximations, which consider a restricted set of operators to describe noisy channels and operations. In this work, we demonstrate how such simplified error models, such as Pauli twirling or reset channels, can lead to severe quantitative and qualitative discrepancies in protocol performance predictions. We analyze, in particular, how small differences can accumulate in iterative and sequential protocols such as entanglement purification, entanglement swapping, and repeater chains. Our results reveal that neglected error contributions can lead to important performance under- and over-estimations, measurement-outcome dependency, and oscillations in the fidelity, which are entirely overlooked by the simplified error model approximations. These results show that rigorous validation of complete noise architectures is indispensable for accurately predicting operational thresholds in future quantum technologies.

quant-ph↗

arXiv2026

Enhancing quantum processor capabilities during idle times

We advocate an alternative paradigm to operate quantum computers that utilizes multipartite entanglement generated in dedicated auxiliary systems during idle times. This stored entanglement enhances the future capabilities of the quantum processor, as it can be flexibly used to assist and speed-up computations when needed. We identify classes of multipartite entangled resource states whose computational power are related to their entanglement features, and in turn to the complexity to generate them. During idle times, one can thus continuously work towards generating more and more powerful auxiliary multipartite entangled states. Idle times include both times prior to the start of a computation, but also any step during the execution of an algorithm where parts of the processor are not actively involved. To illustrate our approach, we consider architectures with limited connectivity, e.g. corresponding to a 1D geometry. We show that $d$-dimensional cluster states allow one to flexibly perform multiple long-distance two-qubit gates in parallel, where both the complexity to generate them, as well as the number of achievable gates increases with $d$.

quant-ph↗

arXiv2026

Analytical and Compressed Simulation of Noisy Stabilizer Circuits

We develop analytical and algorithmic techniques that enable efficient simulation of a broad class of noisy stabilizer circuits. We derive closed-form expressions of expectation values for tensor product of Paulis in circuits with non-deterministic Pauli measurements, yielding an efficient strong simulation method that avoids explicit density matrix construction and enables direct noise parameter sweeps. We introduce a circuit compression framework that reduces the per-sample cost of weak simulation in general noisy stabilizer circuits, including deterministic measurements, by separating parameter-independent preprocessing from sampling. Finally, we extend the analytical framework beyond its standard domain to include a small number of deterministic measurements, general rotations, and non-diagonal noise channels. Our results provide a unified framework for both strong and weak simulation of noisy stabilizer circuits and corresponds to an extension of the noisy stabilizer formalism introduced in \cite{PhysRevA.107.032424}. They offer applications ranging from calculation of the expectation values of entanglement witnesses, determination of reduced states, to energy evaluation.

quant-ph↗

arXiv2026

Localized Entanglement Purification

Entanglement purification protocols are fundamental primitives in quantum communication, enabling the distillation of high-quality entanglement using only local operations and classical communication. For large multipartite states, however, existing purification schemes typically require substantial resources and become progressively inefficient as system size increases. We introduce a new type of multipartite entanglement purification, Localized Entanglement Purification (LEP), a family of protocols that purify entanglement at the level of network regions rather than globally. By exploiting spatial noise asymmetries, LEP reduces resource consumption and enables scalable purification strategies for larger quantum systems.

quant-ph↗

arXiv2026

Blind quantum computing with different qudit resource state architectures

We discuss how blind quantum computing generalizes to multi-level quantum systems (qudits), which offers advantages compared to the qubit approach. Here, a quantum computing task is delegated to an untrusted server while simultaneously preventing the server from retrieving information about the computation it performs, the input, and the output, enabling secure cloud-based quantum computing. In the standard approach with qubits, measurement-based quantum computing is used: single-qubit measurements on cluster or brickwork states implement the computation, while random rotations of the resource qubits hide the computation from the server. We generalize finite-sized approximately universal gate sets to prime-power-dimensional qudits and show that qudit versions of the cluster and brickwork states enable a similar server-blind execution of quantum algorithms. Furthermore, we compare the overheads of different resource state architectures and discuss which hiding strategies apply to alternative qudit resource states beyond graph states.

quant-ph↗

arXiv2026

Flexible quantum data bus for quantum networks

We consider multi-path routing of entanglement in quantum networks, where a pre-prepared multipartite entangled 2D cluster state serves as a resource to perform different tasks on demand. We show how to achieve parallel connections between multiple, freely chosen groups of parties by performing appropriate local measurements among diagonal paths, which preserves the entanglement structure of the remaining state. We demonstrate how to route multiple Bell-states along parallel lines via crossings, turns and fade-in/-outs, analogously to a data bus. The results apply to networks at any scale.

quant-ph↗

arXiv2026

Universal Nested Quantum Switch

The quantum switch is a basic network primitive that allows one to connect multiple nodes in a quantum network via a central node. We show that the same functionality can be achieved with a different geometry that does not rely on a powerful and large central unit, but instead utilizes evenly distributed resources. This approach is resilient against node failures. We provide a nested construction with logarithmically many qubits per node and a total of $O(n\log n)$ Bell pairs, in contrast to other distributed approaches based on pre-shared entanglement that scale as $O(n^2)$. The construction achieves fully flexible pairwise connectivity, where the shared resource state can be locally transformed into $n/2$ arbitrarily distributed Bell states. We also present a graph state variant with just one qubit per node, which allows one to generate $O(n/\log^2 n)$ Bell pairs.

quant-ph↗

arXiv2026

Measurement-based quantum computing with qudit stabilizer states

We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Estimating overheads for gate decomposition, we find that generalizing standard qubit measurement patterns to the qudit cluster state is suboptimal in most dimensions, so that alternative qudit resource states could enable enhanced computational efficiency. In these resources, the entangling interaction is a block-diagonal Clifford operation rather than the usual controlled-phase gate for cluster states. This simple change has remarkable consequences: the applied entangling operation determines an intrinsic single-qudit gate associated with the resource that drives the quantum computation when performing single-qudit measurements on the resource state. We prove a condition for the intrinsic gate allowing for the measurement-based implementation of arbitrary single-qudit unitaries. Furthermore, we demonstrate for prime-power-dimensional qudits that the complexity of the realization depends linearly both on the dimension and the Pauli order of the intrinsic gate. These insights also allow us to optimize the efficiency of the standard qudit cluster state by effectively mimicking more favorable intrinsic-gate structures, thereby reducing the required measurement depth. Finally, we discuss the required two-dimensional geometry of the resource state for universal measurement-based quantum computing. As concrete examples, we present multiple alternative resource states. In certain dimensions, we show the existence of resource states achieving optimal intrinsic gates, enabling more efficient measurement-based quantum information processing than the qudit cluster state and highlighting the potential of qudit stabilizer state resources for future quantum computing architectures.

quant-ph↗

arXiv2026

Self-Configuring Quantum Networks with Superposition of Trajectories

Quantum networks are a backbone of future quantum technologies thanks to their role in communication and scalable quantum computing. However, their performance is challenged by noise and decoherence. We propose a self-configuring approach that integrates superposed quantum paths with variational quantum optimization techniques. This allows networks to dynamically optimize the superposition of noisy paths across multiple nodes to establish high-fidelity connections between different parties. Our framework is in principle capable of adapting to unknown noise without requiring detailed characterization or benchmarking of the corresponding quantum channels. We also discuss the role of vacuum coherence, a quantum effect central to path superposition that impacts protocol performance. Additionally, we demonstrate that our approach remains beneficial even in the presence of imperfections in the generation of path superposition.

quant-ph↗

arXiv2026

Long-ranged gates in quantum computation architectures with limited connectivity

We propose a quantum computation architecture based on geometries with nearest-neighbor interactions, including e.g. planar structures. We show how to efficiently split the role of qubits into data and entanglement-generation qubits. Multipartite entangled states, e.g. 2D cluster states, are generated among the latter, and flexibly transformed via mid-circuit measurements to multiple, long-ranged Bell states, which are used to perform several two-qubit gates in parallel on data qubits. We introduce planar architectures with $n$ data and $n$ auxiliary qubits that allow one to perform $O(\sqrt n)$ long-ranged two-qubit gates simultaneously, with only one round of nearest neighbor gates and one round of mid-circuit measurements. We also show that our approach is applicable in existing superconducting quantum computation architectures, with only a constant overhead.

quant-ph↗

arXiv2025

On the power of moving quantum sensors: fully flexible and noise-resilient sensing

We show that a single moving quantum sensor provides complete access to spatially correlated scalar fields. We demonstrate that with either trajectory or internal state control, one can selectively measure any linear functional, e.g. a gradient or a spatial Fourier series coefficient, while successfully eliminating {\it all} noise signals with orthogonal spatial correlation. This even exceeds the capabilities of a sensor network consisting of multiple entangled, yet spatially fixed, quantum sensors, where the number of suppressed noise signals is limited by the number of sensor positions. We show that one can achieve an improved scaling of the quantum Fisher information for moving sensors beyond the static fundamental limit of $T^2$.

quant-ph↗

arXiv2025

Improved Quantum Sensing by Spectral Design

We investigate how unitary control can improve parameter estimation by designing the effective spectrum of the imprinting Hamiltonian. We show that, for commuting Hamiltonians, the general problem of spectral manipulation via unitary control simplifies to a finite sequence of elementary switching operations. Furthermore, we demonstrate that any desired relative spacing of energy levels can be achieved, although this may come at the cost of a reduced spectral range. We also show that any modified spectrum can be expressed as a convex combination of the original eigenvalues, with the convex weights forming a bi-stochastic matrix. Through several single-parameter estimation examples, we demonstrate that our spectral engineering method substantially enhances estimation accuracy.

quant-ph↗

arXiv2025

A resource-centric, task-based approach to quantum network control

Quantum networks exhibit fundamental differences from their classical counterparts. These differences necessitate novel principles when organizing, managing, and operating them. Here we propose an unconventional approach to organize and manage the operations of quantum network devices. Instead of a hierarchical scheme using layers, like in classical networks and present quantum network stack models, we propose a resource-centric task-based scheme. In this scheme, quantum applications pose objectives, initiated by a node, to a quantum network, such as sharing an entangled state or sending a qubit along a path. The quantum network node initiating the objective consequently derives a distributed workflow, referred to as saga, comprising numerous tasks operating on resources, which completes the objective. We identify three different kinds of resources with their own and independent topology, namely classical messaging, quantum channels and entanglement. Sagas can either be centrally orchestrated or performed in choreography by the network nodes. The tasks of a saga originate from and operate on resources of the network, such as quantum channels or entanglement, and they not only comprise operations and measurements, but potentially also include other tasks or even entire protocols, such as sending a qubit, distributing entanglement or performing entanglement purification steps.

quant-ph↗

arXiv2025

Experimental distributed quantum sensing in a noisy environment

The precision advantages offered by harnessing the quantum states of sensors can be readily compromised by noise. However, when the noise has a different spatial function than the signal of interest, recent theoretical work shows how the advantage can be maintained and even significantly improved. In this work we experimentally demonstrate the associated sensing protocol, using trapped-ion sensors. An entangled state of multi-dimensional sensors is created that isolates and optimally detects a signal, whilst being insensitive to otherwise overwhelming noise fields with different spatial profiles over the sensor locations. The quantum protocol is found to outperform a perfect implementation of the best comparable strategy without sensor entanglement. While our demonstration is carried out for magnetic and electromagnetic fields over a few microns, the technique is readily applicable over arbitrary distances and for arbitrary fields, thus present a promising application for emerging quantum sensor networks.

quant-ph↗

arXiv2025

Graph state extraction from two-dimensional cluster states

We propose schemes to extract arbitrary graph states from two-dimensional cluster states by locally manipulating the qubits solely via single-qubit measurements. We introduce graph state manipulation tools that allow one to increase the local vertex degree and to merge subgraphs. We utilize these tools together with the previously introduced zipper scheme that generates multiple edges between distant vertices to extract the desired graph state from a two-dimensional cluster state. We show how to minimize overheads by avoiding multiple edges, and compare with a local manipulation strategy based on measurement-based quantum computation together with transport. These schemes have direct applications in entanglement-based quantum networks, sensor networks, and distributed quantum computing in general.

quant-ph↗

arXiv2025

Quantum Simulation of Noisy Quantum Networks

Complex quantum networks are not only hard to establish, but also difficult to simulate due to the exponentially growing state space and noise-induced imperfections. In this work, we propose an alternative approach that leverage quantum computers and noisy intermediate-scale quantum (NISQ) devices as simulators for quantum networks, including noisy quantum devices, channels, and protocols. Rather than considering noise as an undesired property that needs to be mitigated, we demonstrate how imperfections in quantum hardware can be utilized to simulate real-world communication devices under realistic conditions beyond classical simulation capabilities. Our approach allows NISQ devices with modest noise to simulate devices with more significant imperfections enabling large-scale, detailed simulations of quantum networks, where exact error models can be treated. It also improves over direct implementation and benchmarking of real networks, as waiting times for information transmission, locality, and memory restrictions do not apply. This framework can offer advantages in flexibility, scalability, and precision, demonstrating that NISQ devices can serve as natural testbeds for complex quantum networks, and paving the way for more efficient quantum network simulations.

quant-ph↗

arXiv2025

Qudit Noisy Stabilizer Formalism

We introduce the qudit Noisy Stabilizer Formalism, a framework for efficiently describing the evolution of stabilizer states in prime-power dimensions subject to generalized Pauli-diagonal noise under Clifford operations and generalized Pauli measurements. For arbitrary dimensions, the formalism remains applicable, though restricted to a subset of stabilizer states and operations. The computational complexity scales linearly with the number of qudits in the initial state and exponentially with the number of qudits in the final state. This ensures that when noisy qudit stabilizer states evolve via generalized Pauli measurements and Clifford operations to generate multipartite entangled states of a few qudits, their description remains efficient. We demonstrate this by analyzing the generation of a generalized Bell pair from a noisy linear cluster state subject to two distinct noise sources acting on each of the qudits.

quant-ph↗