Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Routing space exploration for scalable routing in the quantum Internet.

ABSTRACT: The entangled network structure of the quantum Internet formulates a high complexity routing space that is hard to explore. Scalable routing is a routing method that can determine an optimal routing at particular subnetwork conditions in the quantum Internet to perform a high-performance and low-complexity routing in the entangled structure. Here, we define a method for routing space exploration and scalable routing in the quantum Internet. We prove that scalable routing allows a compact and efficient routing in the entangled networks of the quantum Internet.

SUBMITTER: Gyongyosi L

PROVIDER: S-EPMC7367878 | biostudies-literature | 2020 Jul

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Routing space exploration for scalable routing in the quantum Internet.

Gyongyosi Laszlo L Imre Sandor S

Scientific reports 20200717 1

The entangled network structure of the quantum Internet formulates a high complexity routing space that is hard to explore. Scalable routing is a routing method that can determine an optimal routing at particular subnetwork conditions in the quantum Internet to perform a high-performance and low-complexity routing in the entangled structure. Here, we define a method for routing space exploration and scalable routing in the quantum Internet. We prove that scalable routing allows a compact and eff ...[more]

PMID: 32681034

Similar Datasets

Entanglement-Gradient Routing for Quantum Networks.

Project description:We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

| S-EPMC5660278 | biostudies-literature

Computationally scalable geospatial network and routing analysis through multi-level spatial clustering.

Project description:Network analysis finds natural applications in geospatial information systems for a range of applications, notably for thermal grids, which are important for decarbonising thermal energy supply. These analyses are required to operate over a large range of geographic scales. This is a challenge for existing approaches, which face computational scaling challenges with the large datasets now available, such as building and road network data for an entire country. This work presents a system for geospatial modelling of thermal networks including their routing through the existing road network and calculation of flows through the network. This is in contrast to previous thermal network analysis work which could only work with simplified aggregated data.• We apply multi-level spatial clustering which enables parallelisation of work sets.• We develop algorithms and data processing pipelines for calculating network routing.• We use cluster-level caching to enable rapid evaluation of model variants. Graphical abstract Image, graphical abstract

| S-EPMC7522122 | biostudies-literature

Quantum networks with coherent routing of information through multiple nodes.

Project description:Large-scale communication networks, such as the Internet, rely on routing packets of data through multiple intermediate nodes to transmit information from a sender to a receiver. In this paper, we develop a model of a quantum communication network that routes information simultaneously along multiple paths passing through intermediate stations. We demonstrate that a quantum routing approach can in principle extend the distance over which information can be transmitted reliably. Surprisingly, the benefit of quantum routing also applies to the transmission of classical information: even if the transmitted data is purely classical, delocalising it on multiple routes can enhance the achievable transmission distance. Our findings highlight the potential of a future quantum internet not only for achieving secure quantum communication and distributed quantum computing but also for extending the range of classical data transmission.

| S-EPMC11661969 | biostudies-literature

Long-Range Correlations and Memory in the Dynamics of Internet Interdomain Routing.

Project description:Data transfer is one of the main functions of the Internet. The Internet consists of a large number of interconnected subnetworks or domains, known as Autonomous Systems (ASes). Due to privacy and other reasons the information about what route to use to reach devices within other ASes is not readily available to any given AS. The Border Gateway Protocol (BGP) is responsible for discovering and distributing this reachability information to all ASes. Since the topology of the Internet is highly dynamic, all ASes constantly exchange and update this reachability information in small chunks, known as routing control packets or BGP updates. In the view of the quick growth of the Internet there are significant concerns with the scalability of the BGP updates and the efficiency of the BGP routing in general. Motivated by these issues we conduct a systematic time series analysis of BGP update rates. We find that BGP update time series are extremely volatile, exhibit long-term correlations and memory effects, similar to seismic time series, or temperature and stock market price fluctuations. The presented statistical characterization of BGP update dynamics could serve as a basis for validation of existing and developing better models of Internet interdomain routing.

| S-EPMC4631327 | biostudies-literature

Visual Parameter Space Exploration in Time and Space.

Project description:Computational models, such as simulations, are central to a wide range of fields in science and industry. Those models take input parameters and produce some output. To fully exploit their utility, relations between parameters and outputs must be understood. These include, for example, which parameter setting produces the best result (optimization) or which ranges of parameter settings produce a wide variety of results (sensitivity). Such tasks are often difficult to achieve for various reasons, for example, the size of the parameter space, and supported with visual analytics. In this paper, we survey visual parameter space exploration (VPSE) systems involving spatial and temporal data. We focus on interactive visualizations and user interfaces. Through thematic analysis of the surveyed papers, we identify common workflow steps and approaches to support them. We also identify topics for future work that will help enable VPSE on a greater variety of computational models.

| S-EPMC10947302 | biostudies-literature

Scalable distributed gate-model quantum computers.

Project description:A scalable model for a distributed quantum computation is a challenging problem due to the complexity of the problem space provided by the diversity of possible quantum systems, from small-scale quantum devices to large-scale quantum computers. Here, we define a model of scalable distributed gate-model quantum computation in near-term quantum systems of the NISQ (noisy intermediate scale quantum) technology era. We prove that the proposed architecture can maximize an objective function of a computational problem in a distributed manner. We study the impacts of decoherence on distributed objective function evaluation.

| S-EPMC7910494 | biostudies-literature

Multilayer Optimization for the Quantum Internet.

Project description:We define a multilayer optimization method for the quantum Internet. Multilayer optimization integrates separate procedures for the optimization of the quantum layer and the classical layer of the quantum Internet. The multilayer optimization procedure defines advanced techniques for the optimization of the layers. The optimization of the quantum layer covers the minimization of total usage time of quantum memories in the quantum nodes, the maximization of the entanglement throughput over the entangled links, and the reduction of the number of entangled links between the arbitrary source and target quantum nodes. The objective of the optimization of the classical layer is the cost minimization of any auxiliary classical communications. The multilayer optimization framework provides a practically implementable tool for quantum network communications, or long-distance quantum communications.

| S-EPMC6107661 | biostudies-literature

Algorithmic cooling and scalable NMR quantum computers.

Project description:We present here algorithmic cooling (via polarization heat bath)-a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by using a set of rapidly thermal-relaxing bits. Such auxiliary bits could be implemented by using spins that rapidly get into thermal equilibrium with the environment, e.g., electron spins. Interestingly, the interaction with the environment, usually a most undesired interaction, is used here to our benefit, allowing a cooling mechanism. Cooling spins to a very low temperature without cooling the environment could lead to a breakthrough in NMR experiments, and our "spin-refrigerating" method suggests that this is possible. The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices, and our spin-refrigerating method suggests that this problem can be resolved.

| S-EPMC122533 | biostudies-literature

Parity-Frequency-Space Elastic Spin Control of Wave Routing in Topological Phononic Circuits.

Project description:Topological phononic cavities, such as ring resonators with topological whispering gallery modes (TWGMs), offer a flexible platform for the realization of robust phononic circuits. However, the chiral mechanism governing TWGMs and their selective routing in integrated phononic circuits remain unclear. This work reveals, both experimentally and theoretically, that at a phononic topological interface, the elastic spin texture is intricately linked to, and can be explained through a knowledge of, the phonon eigenmodes inside each unit cell. Furthermore, for paired, counterpropagating TWGMs based on such interfaces in a waveguide resonator, this study demonstrates that the elastic spin exhibits locking at discrete frequencies. Backed up by theory, experiments on kHz TWGMs in thin honeycomb-lattice aluminum plates bored with clover-leaf shaped holes show that together with this spin-texture related angular-momentum locking mechanism at a single topological interface, there are triplicate parity-frequency-space selective wave routing mechanisms. In the future, these mechanisms can be harnessed for the versatile manipulation of elastic-spin based routing in phononic topological insulators.

| S-EPMC11423203 | biostudies-literature

Scalable biclustering - the future of big data exploration?

Project description:Biclustering is a technique of discovering local similarities within data. For many years the complexity of the methods and parallelization issues limited its application to big data problems. With the development of novel scalable methods, biclustering has finally started to close this gap. In this paper we discuss the caveats of biclustering and present its current challenges and guidelines for practitioners. We also try to explain why biclustering may soon become one of the standards for big data analytics.

| S-EPMC6598466 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data