SEARCH · Engineering Papers
Results for “Quantum network”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
A Fast Renormalization Group Tensor network decoder for Planar quantum LDPC codes
Explore the source record for details and available documents.
Optical parametric oscillator network with coherent feedback quantum control.
Abstract not provided.
Benchmarking quantum annealing for complex network analysis on synthetic social networks.
Abstract not provided.
Engineering Fiber Communications for Coexistence of Quantum and Classical Signals
Explore the source record for details and available documents.
Holographic codes from hyperinvariant tensor networks
Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code’s logical degrees of freedom. Previous discrete holographic codes based on tensor networks have reproduced the general code properties expected from continuum AdS/CFT, such as complementary recovery. However, the boundary states of such tensor networks typically do not exhibit the expected correlation functions of CFT boundary states. In this work, we show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states. Furthermore, these codes exhibit a state-dependent breakdown of complementary recovery as expected from AdS/CFT under small quantum gravity corrections.
Tunneling Spectroscopy of Quantum Hall States in Bilayer Graphene p–n Junctions
We report tunneling transport in spatially controlled networks of quantum Hall (QH) edge states in bilayer graphene. By manipulating the separation, location, and spatial span of QH edge states via gate-defined electrostatics, we observe resonant tunneling between copropagating QH states across incompressible strips. Employing spectroscopic tunneling measurements and an analytical model, we characterize the energy gap, width, density of states, and compressibility of the QH edge states with high precision and sensitivity within the same device. Furthermore, the capability to engineer the QH edge network also provides an opportunity to build future quantum electronic devices with electrostatic manipulation of QH edge states, supported by rich underlying physics.
From Long-distance Entanglement to Building a Nationwide Quantum Internet: Report of the DOE Quantum Internet Blueprint Workshop
A Quantum Path Forward. Today, many scientific experts recognize that building and scaling quantum-protected and enhanced communication networks are among the most important technological frontiers of the 21st century. The international research community perceives the construction of a first prototype global quantum network-the Quantum Internet-to be within reach over the next decade. In February 2020, the U.S Department of Energy (DOE)'s Office of Advanced Scientific Computing Research hosted the Quantum Internet Blueprint workshop to define a potential roadmap toward building the first nationwide quantum Internet. The workshop participants included representatives from DOE national laboratories, universities, industry, and other U.S. agencies with serious interests in quantum networking. The goal was to provide an outline of the essential research needed, detail any engineering and design barriers, and suggest a path forward to move from today's limited local network experiments to a viable, secure quantum Internet.
From Long-distance Entanglement to Building a Nationwide Quantum Internet: Report of the DOE Quantum Internet Blueprint Workshop
A Quantum Path Forward. Today, many scientific experts recognize that building and scaling quantum-protected and enhanced communication networks are among the most important technological frontiers of the 21st century. The international research community perceives the construction of a first prototype global quantum network-the Quantum Internet-to be within reach over the next decade. In February 2020, the U.S. Department of Energy (DOE)'s Office of Advanced Scientific Computing Research hosted the Quantum Internet Blueprint workshop to define a potential roadmap toward building the first nationwide quantum Internet. The workshop participants included representatives from DOE national laboratories, universities, industry, and other U.S. agencies with serious interests in quantum networking. The goal was to provide an outline of the essential research needed, detail any engineering and design barriers, and suggest a path forward to move from today's limited local network experiments to a viable, secure quantum Internet.
A QUBO formulation for top-τ eigencentrality nodes
The efficient calculation of the centrality or “hierarchy” of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity. In this work we lay the foundations for solving the eigencentrality problem of ranking the importance of the nodes of a network with scores from the eigenvector of the network, using quantum computational paradigms such as quantum annealing and gate-based quantum computing. The problem is reformulated as a quadratic unconstrained binary optimization (QUBO) that can be solved on both quantum architectures. The results focus on correctly identifying a given number of the most important nodes in numerous networks given by the sparse vector solution of our QUBO formulation of the problem of identifying the top- τ highest eigencentrality nodes in a network on both the D-Wave and IBM quantum computers.
Sampling two-dimensional isometric tensor network states
Sampling a quantum system’s underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor network sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.
A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers
Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power.In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation.The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware.This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.
Constructing tensor network influence functionals for general quantum dynamics
Here, we describe an iterative formalism to compute influence functionals that describe the general quantum dynamics of a subsystem beyond the assumption of linear coupling to a quadratic bath. We use a space-time tensor network representation of the influence functional and investigate its approximability in terms of its bond dimension and time-like entanglement in the tensor network description. We study two numerical models, the spin-boson model and a model of interacting hard-core bosons in a 1D harmonic trap. We find that the influence functional and the intermediates involved in its construction can be efficiently approximated by low bond dimension tensor networks in certain dynamical regimes, which allows the quantum dynamics to be accurately computed for longer times than with direct time evolution methods. However, as one iteratively integrates out the bath, the correlations in the influence functional can first increase before decreasing, indicating that the final compressibility of the influence functional is achieved via non-trivial cancellation.
A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers
Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power. In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation. The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware. This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.
Numerical approach of the quantum circuit theory
In this paper we develop a numerical method based on the quantum circuit theory to approach the coherent electronic transport in a network of quantum dots connected with arbitrary topology. The algorithm was employed in a circuit formed by quantum dots connected each other in a shape of a linear chain (associations in series), and of a ring (associations in series, and in parallel). For both systems we compute two current observables: conductance and shot noise power. We find an excellent agreement between our numerical results and the ones found in the literature. Moreover, we analyze the algorithm efficiency for a chain of quantum dots, where the mean processing time exhibits a linear dependence with the number of quantum dots in the array.
Quantum magnetism on small-world networks
While classical spin systems in random networks have been intensively studied, much less is known about quantum magnets in random graphs. In this work, we investigate interacting quantum spins on small-world networks, building on mean-field theory and extensive quantum Monte Carlo simulations. Starting from one-dimensional (1D) rings, we consider two situations: All-to-all interacting and long-range interactions randomly added. The effective infinite dimension of the lattice leads to a magnetic ordering at finite temperature Tc with mean-field criticality. Nevertheless, in contrast to the classical case, we find two distinct power-law behaviors for Tc versus the average strength of the extra couplings. This is controlled by a competition between a characteristic length scale of the random graph and the thermal correlation length of the underlying 1D system, thus challenging mean-field theories. We also investigate the fate of a gapped 1D spin chain against the small-world effect.