Genuine quantum networks with superposed tasks and addressing

@article{MiguelRamiro2021GenuineQN,
  title={Genuine quantum networks with superposed tasks and addressing},
  author={J. Miguel-Ramiro and A. Pirker and Wolfgang D{\"u}r},
  journal={npj Quantum Information},
  year={2021},
  volume={7},
  pages={1-15}
}
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… 
Quantum Internet: from Medium Access Control to Entanglement Access Control
TLDR
The designed protocol is able to jointly extract in a distributed way an EPR pair from the original multipartite entangled state shared by the set of network nodes, and to univocally determines the identities of the transmitter node and the receiver node in charge of using the extracted EPR Pair.
Universal quantum computation via quantum controlled classical operations
TLDR
This work provides an affirmative answer to this question by considering a computational model that consists of 2n target bits together with a set of classical gates controlled by log (2n + 1) ancillary qubits and shows that this model is equivalent to a quantum computer operating on n qubits.
Tools for quantum network design
TLDR
The state of the art of tools for evaluating the performance of quantum networks are reviewed from three different angles: information-theoretic benchmarks, analytical tools, and simulation.
Quantum internet under random breakdowns and intentional attacks
TLDR
The results apply to quantum internet based on fibers for all kinds of quantum communications and provide implications for the future construction of QNs with regard to its robustness.
Generation of photonic tensor network states with circuit QED
We propose a circuit QED platform and protocol to deterministically generate microwave photonic tensor network states. We first show that using a microwave cavity as ancilla and a transmon qubit as
Quantum communication capacity transition of complex quantum networks
TLDR
This work identifies a threshold transition in the capacity as the density of network nodes increases, and finds that above the threshold the typical communication capacity between two nodes is independent of the distance between them, due to multi-path routing enabled by the quantum network.
Continuous-variable quantum repeaters based on bosonic error-correction and teleportation: architecture and applications
Quantum repeater is an essential ingredient for quantum networks that link distant quantum modules such as quantum computers and sensors. Motivated by distributed quantum computing and communication,
Unsupervised Quantum Gate Control for Gate-Model Quantum Computers
TLDR
A method for the unsupervised control of quantum gates in near-term quantum computers is defined and it is proved that the non-stable quantum gate becomes controllable via a machine learning method if the quantum gates formulate an entangled gate structure.
Scalable distributed gate-model quantum computers
TLDR
It is proved that the proposed architecture can maximize an objective function of a computational problem in a distributed manner and study the impacts of decoherence on distributed objective function evaluation.
...
...

References

SHOWING 1-10 OF 140 REFERENCES
Modular architectures for quantum networks
TLDR
A top-down approach is followed, where the required entanglement is initially present in the network in form of network states shared between network devices, and then manipulated in such a way that the desired target state is generated, which minimizes generation times and allows for network structures that are in principle independent of physical links.
Parallel quantum trajectories via forking for sampling without redundancy
TLDR
A framework based on quantum forking is presented that bypasses this fundamental issue and expedites a family of tasks that require sampling from independent quantum processes and is demonstrated via applications to implementing non-unitary quantum channels, studying entanglement and benchmarking quantum control.
Multipartite state generation in quantum networks with optimal scaling
TLDR
It is found that the multipartite approach offers a storage advantage, which results in higher efficiency and better performance in certain parameter regimes, and generalizes the approach to arbitrary network topologies and different target graph states.
Experimentally superposing two pure states with partial prior knowledge
Superposition, arguably the most fundamental property of quantum mechanics, lies at the heart of quantum information science. However, how to create the superposition of any two unknown pure states
Computational advantage from quantum-controlled ordering of gates.
TLDR
It is shown that this model of quantum computing is physically realizable, by proposing an interferometric setup that can implement such a quantum control of the order between the gates, and that this new resource provides a reduction in computational complexity.
Quantum network routing and local complementation
TLDR
This paper proposes a more general method for establishing EPR pairs in arbitrary networks that uses a graph state instead of maximally entangled pairs to achieve long-distance simultaneous communication, and demonstrates how graph-theoretic tools, and specifically local complementation, help decrease the number of required measurements compared to usual methods applied in repeater schemes.
Path selection for quantum repeater networks
TLDR
To adapt Dijkstra’s algorithm for quantum repeater networks that generate entangled Bell pairs, the key differences are quantified and a link cost metric is defined, seconds per Bell pair of a particular fidelity, where a single Bell pair is the resource consumed to perform one quantum teleportation.
Distributing graph states over arbitrary quantum networks
TLDR
This work study the distribution, or routing, of entangled states over fixed, but arbitrary, physical networks by introducing two protocols to distribute, respectively, Greenberger-Horne-Zeilinger states and arbitrary graph states over arbitrary quantum networks.
Designing quantum repeater networks
TLDR
Engineering principles that ensure robust and interoperable communication by introducing new protocol layers to support quantum sessions are discussed, and how these layers interact with quantum link mechanisms to support user-level quantum-enabled applications are considered.
Optimal and secure measurement protocols for quantum sensor networks.
TLDR
The metrological advantage of entanglement in a setting where the measured quantity is a linear function of parameters individually coupled to each qubit is quantified.
...
...