Related papers: Quantum routing with fast reversals
Quantum repeaters have promised efficient scaling of quantum networks for over two decades. Despite numerous platforms proclaiming functional repeaters, the realization of large-scale networks remains elusive, indicating that the resources…
Recently, there has been increasing interest in designing schemes for quantum computations that are robust against errors. Although considerable research has been devoted to developing quantum error correction schemes, much less attention…
Quantum Key Distribution (QKD) networks harness the principles of quantum physics in order to securely transmit cryptographic key material, providing physical guarantees. These networks require traditional management and operational…
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this…
Estimation of unknown qubit elementary gates and alignment of reference frames are formally the same problem. Using quantum states made out of $N$ qubits, we show that the theoretical precision limit for both problems, which behaves as…
Quantum computing promises to solve previously intractable problems, with neutral atoms emerging as a promising technology. Zoned neutral atom architectures allow for immense parallelism and higher coherence times by shielding idling atoms…
In extant quantum secret sharing protocols, once the secret is shared in a quantum network (\textsc{qnet}) it can not be retrieved back, even if the dealer wishes that her secret no longer be available in the network. For instance, if the…
Realizing the advantages of quantum computation requires access to the full Hilbert space of states of many quantum bits (qubits). Thus, large-scale quantum computation faces the challenge of efficiently generating entanglement between many…
We propose a new fast scalable method for achieving a two-qubit entangling gate between arbitrary distant qubits in a network by exploiting dispersionless propagation in uniform chains. This is achieved dynamically by switching on a strong…
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this…
A random access memory (RAM) uses n bits to randomly address N=2^n distinct memory cells. A quantum random access memory (qRAM) uses n qubits to address any quantum superposition of N memory cells. We present an architecture that…
We define an adaptive routing method for the management of quantum memory failures in the quantum Internet. In the quantum Internet, the entangled quantum states are stored in the local quantum memories of the quantum nodes. A quantum…
There will be a fast-paced shift from conventional network systems to novel quantum networks that are supported by the quantum entanglement and teleportation, key technologies of the quantum era, to enable secured data transmissions in the…
The clock synchronization problem is to determine the time difference T between two spatially separated parties. We improve on I. Chuang's quantum clock synchronization algorithm and show that it is possible to obtain T to n bits of…
We propose a novel hierarchical qubit mapping and routing algorithm. First, a circuit is decomposed into blocks that span an identical number of qubits. In the second stage permutation-aware synthesis (PAS), each block is optimized and…
We present a universal mechanism that, acting on any target qubit, propagates it to the state it had T time units before the experiment started. This protocol works by setting the target on a superposition of flight paths, where it is acted…
The vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary…
Qubit routing is a fundamental problem in quantum compilation, known to be NP-hard. Its dynamic nature makes local routing decisions propagate and compound over time, making global efficient solutions challenging. Existing heuristic methods…
The strong coupling between individual optical emitters and propagating surface plasmons confined to a conducting nanotip make this system act as an ideal interface for quantum networks, through which a stationary qubit and a flying photon…
Quantum networks are gaining momentum in finding applications in a wide range of domains. However, little research has investigated the potential of a quantum network framework to enable highly reliable communications. The goal of this work…