Identifying network topologies via quantum walk distributions
- URL: http://arxiv.org/abs/2301.13842v1
- Date: Tue, 31 Jan 2023 18:38:44 GMT
- Title: Identifying network topologies via quantum walk distributions
- Authors: Claudia Benedetti, and Ilaria Gianani
- Abstract summary: We use a genetic algorithm to retrieve the topology of a network from the measured probability distribution.
Our result shows that the algorithm is capable of efficiently retrieving the required information even in the presence of noise.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Control and characterization of networks is a paramount step for the
development of many quantum technologies. Even for moderate-sized networks,
this amounts to explore an extremely vast parameters space in search for the
couplings defining the network topology. Here we explore the use of a genetic
algorithm to retrieve the topology of a network from the measured probability
distribution obtained from the evolution of a continuous-time quantum walk on
the network. Our result shows that the algorithm is capable of efficiently
retrieving the required information even in the presence of noise.
Related papers
- Routing in Quantum Networks with End-to-End Knowledge [10.955844285189373]
We introduce an approach that facilitates the establishment of paths capable of delivering end-to-end fidelity above a specified threshold.
We define algorithms that are specific instances of this approach and evaluate them in comparison to Dijkstra shortest path algorithm and a fully knowledge-aware algorithm through simulations.
Our results demonstrate that one of the grey box algorithms consistently outperforms the other methods in delivering paths above the fidelity threshold.
arXiv Detail & Related papers (2024-07-19T15:34:51Z) - Guarantees on the structure of experimental quantum networks [105.13377158844727]
Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing.
As these networks grow in size, certification tools will be required to answer questions regarding their properties.
We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
arXiv Detail & Related papers (2024-03-04T19:00:00Z) - Quantum network-entanglement measures [0.0]
We introduce measures of quantum network-entanglement that are well-defined within the general framework of quantum resource theories.
We also provide methods to estimate these measures by introducing novel witnesses of network-entanglement.
arXiv Detail & Related papers (2023-11-23T11:50:09Z) - Certifying the Topology of Quantum Networks: Theory and Experiment [0.0]
It is crucial to characterize the topology of networks in a way that reveals the nodes between which entanglement can be reliably distributed.
Our scheme allows for distinguishing, in a scalable manner, different networks consisting of bipartite and multipartite entanglement sources.
We experimentally demonstrate our approach by certifying the topology of different six-qubit networks generated with polarized photons.
arXiv Detail & Related papers (2023-09-22T14:50:38Z) - Quantum information spreading and scrambling in a distributed quantum
network: A Hasse/Lamport diagrammatic approach [14.308249733521182]
Large-scale quantum networks, known as quantum internet, hold great promises for advanced distributed quantum computing and long-distance quantum communication.
We propose a novel diagrammatic way of visualizing information flow dynamics within the quantum network.
We also propose a quantum information scrambling protocol, where a specific node scrambles secret quantum information across the entire network.
arXiv Detail & Related papers (2023-09-19T06:48:42Z) - Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
Quantum networks rely on entanglement between qubits at distant nodes to transmit information.
We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links.
We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
arXiv Detail & Related papers (2022-12-17T05:40:09Z) - Quantization-aware Interval Bound Propagation for Training Certifiably
Robust Quantized Neural Networks [58.195261590442406]
We study the problem of training and certifying adversarially robust quantized neural networks (QNNs)
Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization.
We present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs.
arXiv Detail & Related papers (2022-11-29T13:32:38Z) - Optimized Quantum Networks [68.8204255655161]
Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests.
We utilize this to design entanglement-based quantum networks tailored to their desired functionality.
arXiv Detail & Related papers (2021-07-21T18:00:07Z) - Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users.
We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
arXiv Detail & Related papers (2020-11-23T19:00:01Z) - ESPN: Extremely Sparse Pruned Networks [50.436905934791035]
We show that a simple iterative mask discovery method can achieve state-of-the-art compression of very deep networks.
Our algorithm represents a hybrid approach between single shot network pruning methods and Lottery-Ticket type approaches.
arXiv Detail & Related papers (2020-06-28T23:09:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.