A5001126121- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
- Quantum Mechanics and Applications
- Cloud Computing and Resource Management
- Low-power high-performance VLSI design
- Computability, Logic, AI Algorithms
- Molecular Communication and Nanonetworks
- Machine Learning in Materials Science
- Advanced Queuing Theory Analysis
- Advanced Thermodynamics and Statistical Mechanics
- Quantum optics and atomic interactions
- Quantum and electron transport phenomena
- Formal Methods in Verification
- Numerical Methods and Algorithms
- Satellite Communication Systems
- Algorithms and Data Compression
- Optical Wireless Communication Technologies
- Dark Matter and Cosmic Phenomena
- Stochastic Gradient Optimization Techniques
- Optical Network Technologies
- Diamond and Carbon-based Materials Research
- Software-Defined Networks and 5G
- Parallel Computing and Optimization Techniques
- Software System Performance and Reliability
- Quantum-Dot Cellular Automata
Leiden University
2023-2024
Delft University of Technology
2019-2024
QuTech
2019-2024
NTT Basic Research Laboratories
2021
Institute of Photonic Sciences
2021
Quantum communication brings radically new capabilities that are provably impossible to attain in any classical network. Here, we take the first step from a physics experiment fully fledged quantum internet system. We propose functional allocation of network stack and construct physical link layer protocols turn ad-hoc experiments producing heralded entanglement between processors into well-defined robust service. This lays groundwork for designing implementing scalable control application...
Quantum information science may lead to technological breakthroughs in computing, cryptography, and sensing. For the implementation of these tasks, however, complex devices with many components are needed quantum advantage easily be spoiled by failure only a few parts. A paradigmatic example is networks. There, not do noise sources such as photon absorption or imperfect memories long waiting times low fidelity, but also hardware break, leading dysfunctionality entire network. successful...
The ability to distribute high-quality entanglement between remote parties is a key element of many quantum network applications, and knowledge the time at which delivered crucial for assessing viability different approaches. In this work, authors provide improved analytical bounds on average quantiles completion distribution protocols in case that all components have success probabilities lower bounded by constant.
Abstract We numerically study the distribution of entanglement between Dutch cities Delft and Eindhoven realized with a processing-node quantum repeater determine minimal hardware requirements for verifiable blind computation using color centers trapped ions. Our results are obtained considering restrictions imposed by real-world fiber grid detailed hardware-specific models. By comparing our to those we would obtain in idealized settings, show that simplifications lead distorted picture...
In order to bring quantum networks into the real world, we would like determine requirements of network protocols including underlying hardware. Because detailed architecture proposals are generally too complex for mathematical analysis, it is natural employ numerical simulation. Here introduce NetSquid, NETwork Simulator QUantum Information using Discrete events, a discrete-event based platform simulating all aspects and modular computing systems, ranging from physical layer its control...
Efficient methods for the representation and simulation of quantum states operations are crucial optimization circuits. Decision diagrams (DDs), a well-studied data structure originally used to represent Boolean functions, have proven capable capturing relevant aspects systems, but their limits not well understood. In this work, we investigate bridge gap between existing DD-based structures stabilizer formalism, an important tool simulating circuits in tractable regime. We first show that...
We introduce an alternative approach for the design of quantum repeaters based on generating entangled states growing size. The scheme utilizes merging operations, also known as fusion type-I that allow reintegration and reuse entanglement. Unlike conventional swapping-based protocols, our method preserves entanglement after failed thereby reducing waiting times, enabling higher rates, introducing enhanced flexibility in communication requests. Through proof-of-principle analysis, we...
Abstract Long-distance quantum communication via entanglement distribution is of great importance for the internet. However, scaling up to such long distances has proved challenging due loss photons, which grows exponentially with distance covered. Quantum repeaters could in theory be used extend over can distributed, but practice hardware quality still lacking. Furthermore, it generally not clear how an improvement a certain repeater parameter, as memory or attempt rate, impacts overall...
Quantum communication enables the implementation of tasks that are unachievable with classical resources. However, losses on channel preclude direct long-distance transmission quantum information in many relevant scenarios. In principle, repeaters allow one to overcome losses. realistic hardware parameters make a challenge practice. For instance, protocols an entangled pair is generated needs wait memory until generation additional pair. During this waiting time first decoheres, impacting...
It is well known that observing nonlocal correlations allows us to draw conclusions about the quantum systems under consideration. In some cases this yields a characterisation which essentially complete, phenomenon as self-testing. Self-testing becomes particularly interesting if we can make statement robust, so it be applied real experimental setup. For simplest self-testing scenarios most robust bounds come from method based on operator inequalities. work elaborate idea and apply family of...
Abstract We present and analyze an architecture for a European-scale quantum network using satellite links to connect Quantum Cities, which are metropolitan networks with minimal hardware requirements the end users. Using NetSquid, simulation tool based on discrete events, we assess benchmark performance of such linking distant locations in Europe terms key distribution rates, considering realistic parameters currently available or near-term technology. Our results highlight limits current...
Quantum communication enables the implementation of tasks that are unachievable with classical resources. However, losses on channel preclude direct long-distance transmission quantum information in many relevant scenarios. In principle repeaters allow one to overcome losses. realistic hardware parameters make a challenge practice. For instance, protocols an entangled pair is generated needs wait memory until generation additional pair. During this waiting time first decoheres, impacting...
Losses are one of the main bottlenecks for distribution entanglement in quantum networks, which can be overcome by implementation repeaters. The most basic form a repeater chain is swap ASAP chain. In such chain, elementary links probabilistically generated and deterministically swapped as soon two adjacent have been generated. As each entangled state waiting to swapped, decoherence experienced, turning fidelity between end nodes into random variable. Fully characterizing (average) grows...
Quantum communication enables a host of applications that cannot be achieved by classical means, with provably secure as one the prime examples. The distance quantum schemes can cover via direct is fundamentally limited losses on channel. By means repeaters, reach these extended and chains repeaters could in principle arbitrarily long distances. In this work, we provide two efficient algorithms for determining generation time fidelity first generated entangled pair between end nodes repeater...
We provide two algorithms for computing the probability distribution of waiting time and fidelity in quantum repeater chains constructed from probabilistic components. Their polynomial runtimes improve upon existing algorithms’ exponential scaling.
Quantum networks will enable the implementation of communication tasks with qualitative advantages respect to we know today. While it is expected that first demonstrations small scale quantum take place in near term, many challenges remain them. To compare different solutions, optimize over parameter space and inform experiments, necessary evaluate performance concrete network scenarios. Here, review state art tools for evaluating networks. We present them from three angles:...
Quantum computing is finding promising applications in optimization, machine learning and physics, leading to the development of various models for representing quantum information. Because these representations are often studied different contexts (many-body learning, formal verification, simulation), little known about fundamental trade-offs between their succinctness runtime operations update them. We therefore analytically investigate three widely-used state representations: matrix...
Verifying equivalence between two quantum circuits is a hard problem, that nonetheless crucial in compiling and optimizing algorithms for real-world devices. This paper gives Turing reduction of the (universal) problem to weighted model counting (WMC). Our starting point folklore theorem showing checking can be done so-called Pauli-basis. We combine this insight with WMC encoding circuit simulation, which we extend support Toffoli gate. Finally, prove weights computed by counter indeed...
Quantum computing has emerged as a promising tool for transforming the landscape of technology. Recent efforts have applied quantum techniques to classical database challenges, such query optimization, data integration, index selection, and transaction management. In this paper, we shift focus critical yet underexplored area: management computing. We are currently in Noisy Intermediate-Scale (NISQ) era, where qubits, while promising, fragile still limited scale. After differentiating from...
This tutorial introduces quantum computing with a focus on the applicability of formal methods in this relatively new domain. We describe circuits and convey an understanding their inherent combinatorial nature exponential blow-up that makes them hard to analyze. Then, we show how weighted model counting (\#SAT) can be used solve analysis tasks for circuits. is aimed at everyone community interest computing. Familiarity not required, but basic linear algebra knowledge (particularly matrix...