arXiv subjects

Wolfgang Dür

Publications and source records attributed to Wolfgang Dür.

At least 55 records · Page 3Linked to original sources

arXiv2023

Optimized Quantum Networks

The topology of classical networks is determined by physical links between nodes, and after a network request the links are used to establish the desired connections. Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests, which can substitute links and allow one to fulfill multiple network requests with the same resource state. We utilize this to design entanglement-based quantum networks tailored to their desired functionality, independent of the underlying physical structure. The kind of entanglement to be stored is chosen to fulfill all desired network requests (i.e. parallel bipartite or multipartite communications between specific nodes chosen from some finite set), but in such a way that the storage requirement is minimized. This can be accomplished by using multipartite entangled states shared between network nodes that can be transformed by local operations to different target states. We introduce a clustering algorithm to identify connected clusters in the network for a given desired functionality, i.e. the required network topology of the entanglement-based network, and a merging algorithm that constructs multipartite entangled resource states with reduced memory requirement to fulfill all desired network requests. This leads to a significant reduction in required time and resources, and provides a powerful tool to design quantum networks that is unique to entanglement-based networks.

quant-ph↗

arXiv2023

Remotely Controlled Entanglement Generation

We consider a system of multiple qubits without any quantum control. We show that one can mediate entanglement between different subsystems in a controlled way by adding a (locally) controlled auxiliary system of the same size that couples via an always-on, distant dependent interaction to the system qubits. Solely by changing the internal state of the control system, one can selectively couple it to selected qubits, and ultimately generate different kinds of entanglement within the system. This provides an alternative way for quantum control and quantum gates that does not rely on the ability to switch interactions on and off at will, and can serve as a locally controlled quantum switch where all entanglement patterns can be created. We demonstrate that such an approach also offers an increased error tolerance w.r.t. position fluctuations.

quant-ph↗

arXiv2022

Collective Operations Can Exponentially Enhance Quantum State Verification

Maximally entangled states are a key resource in many quantum communication and computation tasks, and their certification is a crucial element to guarantee the desired functionality. We introduce collective strategies for the efficient, local verification of ensembles of Bell pairs that make use of an initial information and noise transfer to few copies prior to their measurement. In this way the number of entangled pairs that need to be measured and hence destroyed is significantly reduced as compared to previous, even optimal, approaches that operate on individual copies. Moreover the remaining states are directly certified. We show that our tools can be extended to other problems and larger classes of multipartite states.

quant-ph↗

arXiv2022

General measure for macroscopic quantum states beyond "dead and alive"

We consider the characterization of quantum superposition states beyond the pattern "dead and alive". We propose a measure that is applicable to superpositions of multiple macroscopically distinct states, superpositions with different weights as well as mixed states. The measure is based on the mutual information to characterize the distinguishability between multiple superposition states. This allows us to overcome limitations of previous proposals, and to bridge the gap between general measures for macroscopic quantumness and measures for Schrödinger-cat type superpositions. We discuss a number of relevant examples, provide an alternative definition using basis-dependent quantum discord and reveal connections to other proposals in the literature. Finally, we also show the connection between the size of quantum states as quantified by our measure and their vulnerability to noise.

quant-ph↗

arXiv2021

Entanglement purification by counting and locating errors with entangling measurements

We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble in an explicit and controlled way, thereby reducing the amount of noise in the ensemble and purifying the remaining states. This allows us to design entanglement purification protocols for any number of copies that work particularly well for a small number of expected errors, i.e. high fidelity of initial states. The main tool is a counter gate with which the required non-local information can be transferred into the high-dimensional entangled qudit auxiliary states. We compare our schemes to standard recurrence protocols that operate on pairs of copies, and hashing and breeding protocols that operate on a (asymptotically) large number of copies. Our protocols interpolate between these two regimes, leading to a higher achievable fidelity and yield. We illustrate our approach for bipartite qubit states, and generalize it to purify multi-party GHZ states.

quant-ph↗

arXiv2021

Entanglement-assisted entanglement purification

The efficient generation of high-fidelity entangled states is the key element for long-distance quantum communication, quantum computation and other quantum technologies, and at the same time the most resource-consuming part in many schemes. We present a new class of entanglement-assisted entanglement purification protocols that can generate high-fidelity entanglement from noisy, finite-size ensembles with improved yield and fidelity as compared to previous approaches. The scheme utilizes high-dimensional auxiliary entanglement to perform entangling non-local measurements and determine the number and positions of errors in an ensemble in a controlled and efficient way, without disturbing the entanglement of good pairs. Our protocols can deal with arbitrary errors, but are best suited for few errors, and work particularly well for decay noise. Our methods are applicable to moderate sized ensembles, as will be important for near term quantum devices.

quant-ph↗

arXiv2021

Approximate decoherence free subspaces for distributed sensing

We consider the sensing of scalar valued fields with specific spatial dependence using a network of sensors, e.g. multiple atoms located at different positions within a trap. We show how to harness the spatial correlations to sense only a specific signal, and be insensitive to others at different positions or with unequal spatial dependence by constructing a decoherence-free subspace for noise sources at fixed, known positions. This can be extended to noise sources lying on certain surfaces, where we encounter a connection to mirror charges and equipotential surfaces in classical electrostatics. For general situations, we introduce the notion of an approximate decoherence-free subspace, where noise for all sources within some volume is significantly suppressed, at the cost of reducing the signal strength in a controlled way. We show that one can use this approach to maintain Heisenberg-scaling over long times and for a large number of sensors, despite the presence of multiple noise sources in large volumes. We introduce an efficient formalism to construct internal states and sensor configurations, and apply it to several examples to demonstrate the usefulness and wide applicability of our approach.

quant-ph↗

arXiv2021

Coherent randomized benchmarking

Randomized benchmarking is a powerful technique to efficiently estimate the performance and reliability of quantum gates, circuits and devices. Here we propose to perform randomized benchmarking in a coherent way, where superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked, and in terms of efficiency and scalability. We show that e.g. universal gate sets, the set of $n-$qudit Pauli operators or more general sets including arbitrary unitaries, as well as a particular $n-$qudit Clifford gate using only the Pauli set, can be efficiently benchmarked. The price to pay is an additional complexity to add control to the involved quantum operations. However we demonstrate that this can be done by using auxiliary degrees of freedom that are naturally available in basically any physical realization, and are independent of the gates to be tested.

quant-ph↗

arXiv2021

A measurement-based variational quantum eigensolver

Variational quantum eigensolvers (VQEs) combine classical optimization with efficient cost function evaluations on quantum computers. We propose a new approach to VQEs using the principles of measurement-based quantum computation. This strategy uses entagled resource states and local measurements. We present two measurement-based VQE schemes. The first introduces a new approach for constructing variational families. The second provides a translation of circuit-based to measurement-based schemes. Both schemes offer problem-specific advantages in terms of the required resources and coherence times.

quant-ph↗

arXiv2020

Machine learning for long-distance quantum communication

Machine learning can help us in solving problems in the context big data analysis and classification, as well as in playing complex games such as Go. But can it also be used to find novel protocols and algorithms for applications such as large-scale quantum communication? Here we show that machine learning can be used to identify central quantum protocols, including teleportation, entanglement purification and the quantum repeater. These schemes are of importance in long-distance quantum communication, and their discovery has shaped the field of quantum information processing. However, the usefulness of learning agents goes beyond the mere re-production of known protocols; the same approach allows one to find improved solutions to long-distance communication problems, in particular when dealing with asymmetric situations where channel noise and segment distance are non-uniform. Our findings are based on the use of projective simulation, a model of a learning agent that combines reinforcement learning and decision making in a physically motivated framework. The learning agent is provided with a universal gate set, and the desired task is specified via a reward scheme. From a technical perspective, the learning agent has to deal with stochastic environments and reactions. We utilize an idea reminiscent of hierarchical skill acquisition, where solutions to sub-problems are learned and re-used in the overall scheme. This is of particular importance in the development of long-distance communication schemes, and opens the way for using machine learning in the design and implementation of quantum networks.

quant-ph↗

arXiv2020

Genuine quantum networks: superposed tasks and addressing

We show how to make quantum networks, both standard and entanglement-based, genuine quantum by providing them with the possibility of handling superposed tasks and superposed addressing. This extension of their functionality relies on a quantum control register, which specifies not only the task of the network, but also the corresponding weights in a coherently superposed fashion. Although adding coherent control to classical tasks, such as sending or measuring -or not doing so-, is in general impossible, we introduce protocols that are able to mimick this behavior under certain conditions. We achieve this by always performing the classical task, either on the desired state or a properly chosen dummy state. We provide several examples, and show that externally controlling quantum superposition of tasks offers new possibilities and advantages over usually considered single functionality. For instance, superpositions of different target state configurations shared among different nodes of the network can be prepared, or quantum information can be sent among a superposition of different paths or to different destinations.

quant-ph↗

arXiv2019

Delocalized information in quantum networks

We consider entanglement-based quantum networks where information is stored in a delocalized way within regions or the whole network. This offers a natural protection against failure of network nodes, loss and decoherence, and has built-in security features. Quantum information is transmitted within the network by performing local measurements on individual nodes only. Information can be localized within regions or at a specific node by collaborative actions using only entanglement within a region, or sometimes even without entanglement. We discuss several examples based on error correction stabilizer codes, Dicke states and correlation space encodings. We show how to design fully functional networks using encoded states or correlation space resources.

quant-ph↗

arXiv2019

Encrypt me! A game-based approach to Bell inequalities and quantum cryptography

We present a game-based approach to teach Bell inequalities and quantum cryptography at high school. The approach is based on kinesthetic activities and allows students to experience and discover quantum features and their applications first-hand. We represent quantum states by the orientation of students, and mimic quantitative random behaviour and measurements using dice and apps.

physics.ed-ph↗

arXiv2019

Optimal distributed sensing in noisy environments

We consider distributed sensing of non-local quantities. We introduce quantum enhanced protocols to directly measure any (scalar) field with a specific spatial dependence by placing sensors at appropriate positions and preparing a spatially distributed entangled quantum state. Our scheme has optimal Heisenberg scaling and is completely unaffected by noise on other processes with different spatial dependence than the signal. We consider both Fisher and Bayesian scenarios, and design states and settings to achieve optimal scaling. We explicitly demonstrate how to measure coefficients of spatial Taylor and Fourier series, and show that our approach can offer an exponential advantage as compared to strategies that do not make use of entanglement between different sites.

quant-ph↗

arXiv2019

All macroscopic quantum states are fragile and hard to prepare

We study the effect of local decoherence on arbitrary quantum states. Adapting techniques developed in quantum metrology, we show that the action of generic local noise processes -- though arbitrarily small -- always yields a state whose Quantum Fisher Information (QFI) with respect to local observables is linear in system size N, independent of the initial state. This implies that all macroscopic quantum states, which are characterized by a QFI that is quadratic in N, are fragile under decoherence, and cannot be maintained if the system is not perfectly isolated. We also provide analytical bounds on the effective system size, and show that the effective system size scales as the inverse of the noise parameter p for small p for all the noise channels considered, making it increasingly difficult to generate macroscopic or even mesoscopic quantum states. In turn, we also show that the preparation of a macroscopic quantum state, with respect to a conserved quantity, requires a device whose QFI is already at least as large as the one of the desired state. Given that the preparation device itself is classical and not a perfectly isolated macroscopic quantum state, the preparation device needs to be quadratically bigger than the macroscopic target state.

quant-ph↗

arXiv2019

Entangle me! A game to demonstrate the principles of Quantum Mechanics

We introduce a game to illustrate the principles of quantum mechanics using a qubit (or spin-first) approach, where students can experience and discover its puzzling features first-hand. Students take the role of particles and scientists. Scientists unravel underlying rules and properties by collecting and analysing data that is generated by observing particles that act according to given rules. We show how this allows one to illustrate quantum states, their stochastic behavior under measurements as well as quantum entanglement. In addition, we use this approach to illustrate and discuss decoherence, and a modern application of quantum features, namely quantum cryptography. We have tested the game in class and report on the results we obtained.

physics.ed-ph↗

arXiv2018

Multipartite entanglement outperforming bipartite entanglement under limited quantum system sizes

Multipartite quantum entanglement serves as a resource for spatially separated parties performing distributed quantum information processing. Any multipartite entangled state can be generated from appropriately distributed bipartite entangled states by local operations and classical communication (LOCC), and in this sense, any distributed process based on shared multipartite entanglement and LOCC is simulatable by using only bipartite entangled states and LOCC. We show here that this reduction scenario does not hold when there exists a limitation on the size of the local quantum system of each party. Under such a limitation, we prove that there exists a set of multipartite quantum states such that these states in the set cannot be prepared from any distribution of bipartite entanglement while the states can be prepared from a common resource state exhibiting multipartite entanglement. We also show that temporal uses of bipartite quantum communication resources within a limitation of local system sizes are sufficient for preparing this common resource state exhibiting multipartite entanglement, yet there also exist other states exhibiting multipartite entanglement which cannot be prepared even in this setting. Hence, when the local quantum system sizes are limited, multipartite entanglement is an indispensable resource without which certain processes still cannot be accomplished.

quant-ph↗

arXiv2018

Multipartite state generation in quantum networks with optimal scaling

We introduce a repeater scheme to efficiently distribute multipartite entangled states in a quantum network with optimal scaling. The scheme allows to generate graph states such as 2D and 3D cluster states of growing size or GHZ states over arbitrary distances, with a constant overhead per node/channel that is independent of the distance. The approach is genuine multipartite, and is based on the measurement-based implementation of multipartite hashing, an entanglement purification protocol that operates on a large ensemble together with local merging/connection of elementary building blocks. We analyze the performance of the scheme in a setting where local or global storage is limited, and compare it to bipartite and hybrid approaches that are based on the distribution of entangled pairs. We find that the multipartite approach offers a storage advantage, which results in higher efficiency and better performance in certain parameter regimes. We generalize our approach to arbitrary network topologies and different target graph states.

quant-ph↗