Quantum optics of optomechanical networks

International Nuclear Information System (INIS)

Stannigel, K.

2012-01-01

This thesis proposes various setups in which micro-mechanical resonators and optomechanical systems can be combined with other quantum systems, such as solid-state qubits or atomic ensembles, in a beneficial way. These hybrid systems open up new ways for quantum control, and several protocols and applications for quantum information processing and, in particular, for quantum networks are presented. Part I describes an optically mediated coupling between the vibrational modes of a semi-transparent dielectric membrane and the center-of-mass motion of an atomic ensemble. Using the sophisticated toolbox available for the control of atomic systems, this setting enables an indirect manipulation of the membrane, including, for example, cooling it to the vibrational ground state. A fully quantum mechanical treatment of this open system is given in terms of the quantum stochastic Schrödinger equation. In Part II we explore the potential of optomechanical systems for quantum information processing applications. First, we introduce the concept of an optomechanical transducer, where a micro-mechanical resonator mediates an interaction between a solid-state based qubit on the one hand, and photons in an optical cavity on the other hand. The resulting qubit-light interface is shown to enable quantum state transfers between two distant solid-state qubits, thereby making them available for quantum networking applications. Second, we study multi-mode optomechanical systems in the single-photon single-phonon strong coupling regime. We predict quantum signatures of this interaction, which could be observed in future experiments, and provide a route towards possible applications of these systems as quantum information processing units. Part III presents a dissipative state preparation scheme for cascaded quantum networks. In such networks excitations can only propagate along a single spatial direction and the optomechanical transducer represents one way of realizing them. We show, in

Reconfigurable optical implementation of quantum complex networks

Science.gov (United States)

Nokkala, J.; Arzani, F.; Galve, F.; Zambrini, R.; Maniscalco, S.; Piilo, J.; Treps, N.; Parigi, V.

2018-05-01

Network theory has played a dominant role in understanding the structure of complex systems and their dynamics. Recently, quantum complex networks, i.e. collections of quantum systems arranged in a non-regular topology, have been theoretically explored leading to significant progress in a multitude of diverse contexts including, e.g., quantum transport, open quantum systems, quantum communication, extreme violation of local realism, and quantum gravity theories. Despite important progress in several quantum platforms, the implementation of complex networks with arbitrary topology in quantum experiments is still a demanding task, especially if we require both a significant size of the network and the capability of generating arbitrary topology—from regular to any kind of non-trivial structure—in a single setup. Here we propose an all optical and reconfigurable implementation of quantum complex networks. The experimental proposal is based on optical frequency combs, parametric processes, pulse shaping and multimode measurements allowing the arbitrary control of the number of the nodes (optical modes) and topology of the links (interactions between the modes) within the network. Moreover, we also show how to simulate quantum dynamics within the network combined with the ability to address its individual nodes. To demonstrate the versatility of these features, we discuss the implementation of two recently proposed probing techniques for quantum complex networks and structured environments.

Complex quantum network geometries: Evolution and phase transitions

Science.gov (United States)

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

Networks are topological and geometric structures used to describe systems as different as the Internet, the brain, or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying structure of growing simplicial 2-complexes, i.e., simplicial complexes formed by triangles. These networks are geometric networks with energies of the links that grow according to a nonequilibrium dynamics. The evolution in time of the geometric networks is a classical evolution describing a given path of a path integral defining the evolution of quantum network states. The quantum network states are characterized by quantum occupation numbers that can be mapped, respectively, to the nodes, links, and triangles incident to each link of the network. We call the geometric networks describing the evolution of quantum network states the quantum geometric networks. The quantum geometric networks have many properties common to complex networks, including small-world property, high clustering coefficient, high modularity, and scale-free degree distribution. Moreover, they can be distinguished between the Fermi-Dirac network and the Bose-Einstein network obeying, respectively, the Fermi-Dirac and Bose-Einstein statistics. We show that these networks can undergo structural phase transitions where the geometrical properties of the networks change drastically. Finally, we comment on the relation between quantum complex network geometries, spin networks, and triangulations.

Quantum state transfer and network engineering

International Nuclear Information System (INIS)

Nikolopoulos, Georgios M.; Jex, Igor

2014-01-01

Presents the basics of large-scale quantum information processing and networking. Covers most aspects of the problems of state transfer and quantum network engineering. Reflects the interdisciplinary nature of the field. Presents various theoretical approaches as well as possible implementations and related experiments. Faithful communication is a necessary precondition for large-scale quantum information processing and networking, irrespective of the physical platform. Thus, the problems of quantum-state transfer and quantum-network engineering have attracted enormous interest over the last years, and constitute one of the most active areas of research in quantum information processing. The present volume introduces the reader to fundamental concepts and various aspects of this exciting research area, including links to other related areas and problems. The implementation of state-transfer schemes and the engineering of quantum networks are discussed in the framework of various quantum optical and condensed matter systems, emphasizing the interdisciplinary character of the research area. Each chapter is a review of theoretical or experimental achievements on a particular topic, written by leading scientists in the field. The volume aims at both newcomers as well as experienced researchers.

Quantum networks based on cavity QED

Energy Technology Data Exchange (ETDEWEB)

Ritter, Stephan; Bochmann, Joerg; Figueroa, Eden; Hahn, Carolin; Kalb, Norbert; Muecke, Martin; Neuzner, Andreas; Noelleke, Christian; Reiserer, Andreas; Uphoff, Manuel; Rempe, Gerhard [Max-Planck-Institut fuer Quantenoptik, Hans-Kopfermann-Strasse 1, 85748 Garching (Germany)

2014-07-01

Quantum repeaters require an efficient interface between stationary quantum memories and flying photons. Single atoms in optical cavities are ideally suited as universal quantum network nodes that are capable of sending, storing, retrieving, and even processing quantum information. We demonstrate this by presenting an elementary version of a quantum network based on two identical nodes in remote, independent laboratories. The reversible exchange of quantum information and the creation of remote entanglement are achieved by exchange of a single photon. Quantum teleportation is implemented using a time-resolved photonic Bell-state measurement. Quantum control over all degrees of freedom of the single atom also allows for the nondestructive detection of flying photons and the implementation of a quantum gate between the spin state of the atom and the polarization of a photon upon its reflection from the cavity. Our approach to quantum networking offers a clear perspective for scalability and provides the essential components for the realization of a quantum repeater.

77 FR 44063 - Federal Acquisition Regulations; DARPA-New Mexico Tax Agreement

Science.gov (United States)

2012-07-26

... Federal Acquisition Regulation (FAR) to add the United States Defense Advanced Research Projects Agency... Mexico (NM). The DARPA-NM tax agreement eliminates the double taxation of Government cost-reimbursement... 2012- 019. SUPPLEMENTARY INFORMATION: I. Background On August 18, 2011, DARPA and the Taxation and...

Quantum Networks: General theory and applications

International Nuclear Information System (INIS)

Bisio, A.; D'Ariano, G. M.; Perinotti, P.; Chiribella, G.

2011-01-01

In this work we present a general mathematical framework to deal with Quantum Networks, i.e. networks resulting from the interconnection of elementary quantum circuits. The cornerstone of our approach is a generalization of the Choi isomorphism that allows one to efficiently represent any given Quantum Network in terms of a single positive operator. Our formalism allows one to face and solve many quantum information processing problems that would be hardly manageable otherwise, the most relevant of which are reviewed in this work: quantum process tomography, quantum cloning and learning of transformations, inversion of a unitary gate, information-disturbance tradeoff in estimating a unitary transformation, cloning and learning of a measurement device (Authors)

Entanglement distribution in quantum networks

International Nuclear Information System (INIS)

Perseguers, Sebastien

2010-01-01

This Thesis contributes to the theory of entanglement distribution in quantum networks, analyzing the generation of long-distance entanglement in particular. We consider that neighboring stations share one partially entangled pair of qubits, which emphasizes the difficulty of creating remote entanglement in realistic settings. The task is then to design local quantum operations at the stations, such that the entanglement present in the links of the whole network gets concentrated between few parties only, regardless of their spatial arrangement. First, we study quantum networks with a two-dimensional lattice structure, where quantum connections between the stations (nodes) are described by non-maximally entangled pure states (links). We show that the generation of a perfectly entangled pair of qubits over an arbitrarily long distance is possible if the initial entanglement of the links is larger than a threshold. This critical value highly depends on the geometry of the lattice, in particular on the connectivity of the nodes, and is related to a classical percolation problem. We then develop a genuine quantum strategy based on multipartite entanglement, improving both the threshold and the success probability of the generation of long-distance entanglement. Second, we consider a mixed-state definition of the connections of the quantum networks. This formalism is well-adapted for a more realistic description of systems in which noise (random errors) inevitably occurs. New techniques are required to create remote entanglement in this setting, and we show how to locally extract and globally process some error syndromes in order to create useful long-distance quantum correlations. Finally, we turn to networks that have a complex topology, which is the case for most real-world communication networks such as the Internet for instance. Besides many other characteristics, these systems have in common the small-world feature, stating that any two nodes are separated by a

Entanglement distribution in quantum networks

Energy Technology Data Exchange (ETDEWEB)

Perseguers, Sebastien

2010-04-15

This Thesis contributes to the theory of entanglement distribution in quantum networks, analyzing the generation of long-distance entanglement in particular. We consider that neighboring stations share one partially entangled pair of qubits, which emphasizes the difficulty of creating remote entanglement in realistic settings. The task is then to design local quantum operations at the stations, such that the entanglement present in the links of the whole network gets concentrated between few parties only, regardless of their spatial arrangement. First, we study quantum networks with a two-dimensional lattice structure, where quantum connections between the stations (nodes) are described by non-maximally entangled pure states (links). We show that the generation of a perfectly entangled pair of qubits over an arbitrarily long distance is possible if the initial entanglement of the links is larger than a threshold. This critical value highly depends on the geometry of the lattice, in particular on the connectivity of the nodes, and is related to a classical percolation problem. We then develop a genuine quantum strategy based on multipartite entanglement, improving both the threshold and the success probability of the generation of long-distance entanglement. Second, we consider a mixed-state definition of the connections of the quantum networks. This formalism is well-adapted for a more realistic description of systems in which noise (random errors) inevitably occurs. New techniques are required to create remote entanglement in this setting, and we show how to locally extract and globally process some error syndromes in order to create useful long-distance quantum correlations. Finally, we turn to networks that have a complex topology, which is the case for most real-world communication networks such as the Internet for instance. Besides many other characteristics, these systems have in common the small-world feature, stating that any two nodes are separated by a

Fractional quantum mechanics on networks: Long-range dynamics and quantum transport.

Science.gov (United States)

Riascos, A P; Mateos, José L

2015-11-01

In this paper we study the quantum transport on networks with a temporal evolution governed by the fractional Schrödinger equation. We generalize the dynamics based on continuous-time quantum walks, with transitions to nearest neighbors on the network, to the fractional case that allows long-range displacements. By using the fractional Laplacian matrix of a network, we establish a formalism that combines a long-range dynamics with the quantum superposition of states; this general approach applies to any type of connected undirected networks, including regular, random, and complex networks, and can be implemented from the spectral properties of the Laplacian matrix. We study the fractional dynamics and its capacity to explore the network by means of the transition probability, the average probability of return, and global quantities that characterize the efficiency of this quantum process. As a particular case, we explore analytically these quantities for circulant networks such as rings, interacting cycles, and complete graphs.

Quantum neural networks: Current status and prospects for development

Science.gov (United States)

Altaisky, M. V.; Kaputkina, N. E.; Krylov, V. A.

2014-11-01

The idea of quantum artificial neural networks, first formulated in [34], unites the artificial neural network concept with the quantum computation paradigm. Quantum artificial neural networks were first systematically considered in the PhD thesis by T. Menneer (1998). Based on the works of Menneer and Narayanan [42, 43], Kouda, Matsui, and Nishimura [35, 36], Altaisky [2, 68], Zhou [67], and others, quantum-inspired learning algorithms for neural networks were developed, and are now used in various training programs and computer games [29, 30]. The first practically realizable scaled hardware-implemented model of the quantum artificial neural network is obtained by D-Wave Systems, Inc. [33]. It is a quantum Hopfield network implemented on the basis of superconducting quantum interference devices (SQUIDs). In this work we analyze possibilities and underlying principles of an alternative way to implement quantum neural networks on the basis of quantum dots. A possibility of using quantum neural network algorithms in automated control systems, associative memory devices, and in modeling biological and social networks is examined.

DARPA-funded efforts in the development of novel brain-computer interface technologies.

Science.gov (United States)

Miranda, Robbin A; Casebeer, William D; Hein, Amy M; Judy, Jack W; Krotkov, Eric P; Laabs, Tracy L; Manzo, Justin E; Pankratz, Kent G; Pratt, Gill A; Sanchez, Justin C; Weber, Douglas J; Wheeler, Tracey L; Ling, Geoffrey S F

2015-04-15

The Defense Advanced Research Projects Agency (DARPA) has funded innovative scientific research and technology developments in the field of brain-computer interfaces (BCI) since the 1970s. This review highlights some of DARPA's major advances in the field of BCI, particularly those made in recent years. Two broad categories of DARPA programs are presented with respect to the ultimate goals of supporting the nation's warfighters: (1) BCI efforts aimed at restoring neural and/or behavioral function, and (2) BCI efforts aimed at improving human training and performance. The programs discussed are synergistic and complementary to one another, and, moreover, promote interdisciplinary collaborations among researchers, engineers, and clinicians. Finally, this review includes a summary of some of the remaining challenges for the field of BCI, as well as the goals of new DARPA efforts in this domain. Copyright © 2014 The Authors. Published by Elsevier B.V. All rights reserved.

Programmable multi-node quantum network design and simulation

Science.gov (United States)

Dasari, Venkat R.; Sadlier, Ronald J.; Prout, Ryan; Williams, Brian P.; Humble, Travis S.

2016-05-01

Software-defined networking offers a device-agnostic programmable framework to encode new network functions. Externally centralized control plane intelligence allows programmers to write network applications and to build functional network designs. OpenFlow is a key protocol widely adopted to build programmable networks because of its programmability, flexibility and ability to interconnect heterogeneous network devices. We simulate the functional topology of a multi-node quantum network that uses programmable network principles to manage quantum metadata for protocols such as teleportation, superdense coding, and quantum key distribution. We first show how the OpenFlow protocol can manage the quantum metadata needed to control the quantum channel. We then use numerical simulation to demonstrate robust programmability of a quantum switch via the OpenFlow network controller while executing an application of superdense coding. We describe the software framework implemented to carry out these simulations and we discuss near-term efforts to realize these applications.

Modular architectures for quantum networks

Science.gov (United States)

Pirker, A.; Wallnöfer, J.; Dür, W.

2018-05-01

We consider the problem of generating multipartite entangled states in a quantum network upon request. We follow a top-down approach, 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. This minimizes generation times, and allows for network structures that are in principle independent of physical links. We present a modular and flexible architecture, where a multi-layer network consists of devices of varying complexity, including quantum network routers, switches and clients, that share certain resource states. We concentrate on the generation of graph states among clients, which are resources for numerous distributed quantum tasks. We assume minimal functionality for clients, i.e. they do not participate in the complex and distributed generation process of the target state. We present architectures based on shared multipartite entangled Greenberger–Horne–Zeilinger states of different size, and fully connected decorated graph states, respectively. We compare the features of these architectures to an approach that is based on bipartite entanglement, and identify advantages of the multipartite approach in terms of memory requirements and complexity of state manipulation. The architectures can handle parallel requests, and are designed in such a way that the network state can be dynamically extended if new clients or devices join the network. For generation or dynamical extension of the network states, we propose a quantum network configuration protocol, where entanglement purification is used to establish high fidelity states. The latter also allows one to show that the entanglement generated among clients is private, i.e. the network is secure.

Robust quantum network architectures and topologies for entanglement distribution

Science.gov (United States)

Das, Siddhartha; Khatri, Sumeet; Dowling, Jonathan P.

2018-01-01

Entanglement distribution is a prerequisite for several important quantum information processing and computing tasks, such as quantum teleportation, quantum key distribution, and distributed quantum computing. In this work, we focus on two-dimensional quantum networks based on optical quantum technologies using dual-rail photonic qubits for the building of a fail-safe quantum internet. We lay out a quantum network architecture for entanglement distribution between distant parties using a Bravais lattice topology, with the technological constraint that quantum repeaters equipped with quantum memories are not easily accessible. We provide a robust protocol for simultaneous entanglement distribution between two distant groups of parties on this network. We also discuss a memory-based quantum network architecture that can be implemented on networks with an arbitrary topology. We examine networks with bow-tie lattice and Archimedean lattice topologies and use percolation theory to quantify the robustness of the networks. In particular, we provide figures of merit on the loss parameter of the optical medium that depend only on the topology of the network and quantify the robustness of the network against intermittent photon loss and intermittent failure of nodes. These figures of merit can be used to compare the robustness of different network topologies in order to determine the best topology in a given real-world scenario, which is critical in the realization of the quantum internet.

Quantum network with individual atoms and photons

International Nuclear Information System (INIS)

Rempe, G.

2013-01-01

Quantum physics allows a new approach to information processing. A grand challenge is the realization of a quantum network for long-distance quantum communication and large-scale quantum simulation. This paper highlights a first implementation of an elementary quantum network with two fibre-linked high-finesse optical resonators, each containing a single quasi-permanently trapped atom as a stationary quantum node. Reversible quantum state transfer between the two atoms and entanglement of the two atoms are achieved by the controlled exchange of a time-symmetric single photon. This approach to quantum networking is efficient and offers a clear perspective for scalability. It allows for arbitrary topologies and features controlled connectivity as well as, in principle, infinite-range interactions. Our system constitutes the largest man-made material quantum system to date and is an ideal test bed for fundamental investigations, e.g. quantum non-locality. (authors)

Multiple-Access Quantum-Classical Networks

Science.gov (United States)

Razavi, Mohsen

2011-10-01

A multi-user network that supports both classical and quantum communication is proposed. By relying on optical code-division multiple access techniques, this system offers simultaneous key exchange between multiple pairs of network users. A lower bound on the secure key generation rate will be derived for decoy-state quantum key distribution protocols.

Distributed wireless quantum communication networks

International Nuclear Information System (INIS)

Yu Xu-Tao; Xu Jin; Zhang Zai-Chen

2013-01-01

The distributed wireless quantum communication network (DWQCN) has a distributed network topology and transmits information by quantum states. In this paper, we present the concept of the DWQCN and propose a system scheme to transfer quantum states in the DWQCN. The system scheme for transmitting information between any two nodes in the DWQCN includes a routing protocol and a scheme for transferring quantum states. The routing protocol is on-demand and the routing metric is selected based on the number of entangled particle pairs. After setting up a route, quantum teleportation and entanglement swapping are used for transferring quantum states. Entanglement swapping is achieved along with the process of routing set up and the acknowledgment packet transmission. The measurement results of each entanglement swapping are piggybacked with route reply packets or acknowledgment packets. After entanglement swapping, a direct quantum link between source and destination is set up and quantum states are transferred by quantum teleportation. Adopting this scheme, the measurement results of entanglement swapping do not need to be transmitted specially, which decreases the wireless transmission cost and transmission delay. (general)

Google in a Quantum Network

Science.gov (United States)

Paparo, Giuseppe

2013-03-01

In we introduce the characterization of a class of quantum PageRank algorithms in a scenario in which some kind of quantum network is realizable out of the current classical internet web, but no quantum computer is yet available. This class of algorithms represents a quantization of the PageRank protocol currently employed to list web pages according to their importance. The PageRank algorithm's ranking ability has been instrumental to give structure to the web. This class of algorithms may be able to rank nodes in a quantum network. Furthermore, in this class, we have found an instance of this class of quantum protocols that outperforms its classical counterpart and may break the classical hierarchy of web pages depending on the topology of the web.

Towards a global quantum network

Science.gov (United States)

Simon, Christoph

2017-11-01

The creation of a global quantum network is now a realistic proposition thanks to developments in satellite and fibre links and quantum memory. Applications will range from secure communication and fundamental physics experiments to a future quantum internet.

Software-defined Quantum Networking Ecosystem

Energy Technology Data Exchange (ETDEWEB)

2017-01-01

The software enables a user to perform modeling and simulation of software-defined quantum networks. The software addresses the problem of how to synchronize transmission of quantum and classical signals through multi-node networks and to demonstrate quantum information protocols such as quantum teleportation. The software approaches this problem by generating a graphical model of the underlying network and attributing properties to each node and link in the graph. The graphical model is then simulated using a combination of discrete-event simulators to calculate the expected state of each node and link in the graph at a future time. A user interacts with the software by providing an initial network model and instantiating methods for the nodes to transmit information with each other. This includes writing application scripts in python that make use of the software library interfaces. A user then initiates the application scripts, which invokes the software simulation. The user then uses the built-in diagnostic tools to query the state of the simulation and to collect statistics on synchronization.

Open quantum generalisation of Hopfield neural networks

Science.gov (United States)

Rotondo, P.; Marcuzzi, M.; Garrahan, J. P.; Lesanovsky, I.; Müller, M.

2018-03-01

We propose a new framework to understand how quantum effects may impact on the dynamics of neural networks. We implement the dynamics of neural networks in terms of Markovian open quantum systems, which allows us to treat thermal and quantum coherent effects on the same footing. In particular, we propose an open quantum generalisation of the Hopfield neural network, the simplest toy model of associative memory. We determine its phase diagram and show that quantum fluctuations give rise to a qualitatively new non-equilibrium phase. This novel phase is characterised by limit cycles corresponding to high-dimensional stationary manifolds that may be regarded as a generalisation of storage patterns to the quantum domain.

Single-shot secure quantum network coding on butterfly network with free public communication

Science.gov (United States)

Owari, Masaki; Kato, Go; Hayashi, Masahito

2018-01-01

Quantum network coding on the butterfly network has been studied as a typical example of quantum multiple cast network. We propose a secure quantum network code for the butterfly network with free public classical communication in the multiple unicast setting under restricted eavesdropper’s power. This protocol certainly transmits quantum states when there is no attack. We also show the secrecy with shared randomness as additional resource when the eavesdropper wiretaps one of the channels in the butterfly network and also derives the information sending through public classical communication. Our protocol does not require verification process, which ensures single-shot security.

Quantum networks based on spins in diamond

International Nuclear Information System (INIS)

Ronald Hanson

2014-01-01

Entanglement of spatially separated objects is one of the most intriguing phenomena that can occur in physics. Besides being of fundamental interest, entanglement is also a valuable resource in quantum information technology enabling secure quantum communication networks and distributed quantum computing. Here we present our most recent results towards the realization of scalable quantum networks with solid-state qubits. (author)

Quantum state transfer and network engineering

CERN Document Server

Nikolopoulos, Georgios M

2013-01-01

Faithful communication is a necessary precondition for large-scale quantum information processing and networking, irrespective of the physical platform. Thus, the problems of quantum-state transfer and quantum-network engineering have attracted enormous interest over the last years, and constitute one of the most active areas of research in quantum information processing. The present volume introduces the reader to fundamental concepts and various aspects of this exciting research area, including links to other related areas and problems. The implementation of state-transfer schemes and the en

Quantum networks: where should we be heading?

Science.gov (United States)

Sasaki, Masahide

2017-06-01

Quantum key distribution network has become a reality in practical environment. Quantum repeaters have been explored in various physical systems and their combinations. For practical use of them, these new paradigms must be combined with existing or emerging infrastructures of communication and security systems. In this article, we discussed how quantum network can be combined with modern cryptographic technologies in fibre network and with emerging mobile terminals in wireless network, creating new solutions for the future cryptographic and communication systems. Our discussions are summarised in a roadmap.

Stability, gain, and robustness in quantum feedback networks

International Nuclear Information System (INIS)

D'Helon, C.; James, M. R.

2006-01-01

In this paper we are concerned with the problem of stability for quantum feedback networks. We demonstrate in the context of quantum optics how stability of quantum feedback networks can be guaranteed using only simple gain inequalities for network components and algebraic relationships determined by the network. Quantum feedback networks are shown to be stable if the loop gain is less than one--this is an extension of the famous small gain theorem of classical control theory. We illustrate the simplicity and power of the small gain approach with applications to important problems of robust stability and robust stabilization

Nonadditivity of quantum capacities of quantum multiple-access channels and the butterfly network

International Nuclear Information System (INIS)

Huang Peng; He Guangqiang; Zhu Jun; Zeng Guihua

2011-01-01

Multipartite quantum information transmission without additional classical resources is investigated. We show purely quantum superadditivity of quantum capacity regions of quantum memoryless multiple-access (MA) channels, which are not entanglement breaking. Also, we find that the superadditivity holds when the MA channel extends to the quantum butterfly network, which can achieve quantum network coding. The present widespread effects for the channels which enable entanglement distribution have not been revealed for multipartite scenarios.

A full quantum network scheme

International Nuclear Information System (INIS)

Ma Hai-Qiang; Wei Ke-Jin; Yang Jian-Hui; Li Rui-Xue; Zhu Wu

2014-01-01

We present a full quantum network scheme using a modified BB84 protocol. Unlike other quantum network schemes, it allows quantum keys to be distributed between two arbitrary users with the help of an intermediary detecting user. Moreover, it has good expansibility and prevents all potential attacks using loopholes in a detector, so it is more practical to apply. Because the fiber birefringence effects are automatically compensated, the scheme is distinctly stable in principle and in experiment. The simple components for every user make our scheme easier for many applications. The experimental results demonstrate the stability and feasibility of this scheme. (general)

Deep Neural Network Detects Quantum Phase Transition

Science.gov (United States)

Arai, Shunta; Ohzeki, Masayuki; Tanaka, Kazuyuki

2018-03-01

We detect the quantum phase transition of a quantum many-body system by mapping the observed results of the quantum state onto a neural network. In the present study, we utilized the simplest case of a quantum many-body system, namely a one-dimensional chain of Ising spins with the transverse Ising model. We prepared several spin configurations, which were obtained using repeated observations of the model for a particular strength of the transverse field, as input data for the neural network. Although the proposed method can be employed using experimental observations of quantum many-body systems, we tested our technique with spin configurations generated by a quantum Monte Carlo simulation without initial relaxation. The neural network successfully identified the strength of transverse field only from the spin configurations, leading to consistent estimations of the critical point of our model Γc = J.

Extensible router for a quantum key distribution network

International Nuclear Information System (INIS)

Zhang Tao; Mo Xiaofan; Han Zhengfu; Guo Guangcan

2008-01-01

Building a quantum key distribution network is crucial for practical quantum cryptography. We present a scheme to build a star topology quantum key distribution network based on wavelength division multiplexing which, with current technology, can connect at least a hundred users. With the scheme, a 4-user demonstration network was built up and key exchanges were performed

Universal quantum computation in a semiconductor quantum wire network

International Nuclear Information System (INIS)

Sau, Jay D.; Das Sarma, S.; Tewari, Sumanta

2010-01-01

Universal quantum computation (UQC) using Majorana fermions on a two-dimensional topological superconducting (TS) medium remains an outstanding open problem. This is because the quantum gate set that can be generated by braiding of the Majorana fermions does not include any two-qubit gate and also no single-qubit π/8 phase gate. In principle, it is possible to create these crucial extra gates using quantum interference of Majorana fermion currents. However, it is not clear if the motion of the various order parameter defects (vortices, domain walls, etc.), to which the Majorana fermions are bound in a TS medium, can be quantum coherent. We show that these obstacles can be overcome using a semiconductor quantum wire network in the vicinity of an s-wave superconductor, by constructing topologically protected two-qubit gates and any arbitrary single-qubit phase gate in a topologically unprotected manner, which can be error corrected using magic-state distillation. Thus our strategy, using a judicious combination of topologically protected and unprotected gate operations, realizes UQC on a quantum wire network with a remarkably high error threshold of 0.14 as compared to 10 -3 to 10 -4 in ordinary unprotected quantum computation.

Topspin networks in loop quantum gravity

International Nuclear Information System (INIS)

Duston, Christopher L

2012-01-01

We discuss the extension of loop quantum gravity to topspin networks, a proposal which allows topological information to be encoded in spin networks. We will show that this requires minimal changes to the phase space, C*-algebra and Hilbert space of cylindrical functions. We will also discuss the area and Hamiltonian operators, and show how they depend on the topology. This extends the idea of ‘background independence’ in loop quantum gravity to include topology as well as geometry. It is hoped this work will confirm the usefulness of the topspin network formalism and open up several new avenues for research into quantum gravity. (paper)

OpenFlow Extensions for Programmable Quantum Networks

Science.gov (United States)

2017-06-19

Introduction 1 2. Background 1 2.1 Quantum Networks 2 2.2 Software -Defined Networks 3 3. Approach 3 3.1 Metadata 4 3.2 Switch 4 3.3 Controller 5... software -defined networks . Stanford (CA): Stanford University HotNets; 2010. 9. Raychev N. Algorithm for switching 4-bit packages in full quantum...applications to communicate. Advances in network protocols and architectures have led to the development of software -defined programmable networks

Perfect quantum multiple-unicast network coding protocol

Science.gov (United States)

Li, Dan-Dan; Gao, Fei; Qin, Su-Juan; Wen, Qiao-Yan

2018-01-01

In order to realize long-distance and large-scale quantum communication, it is natural to utilize quantum repeater. For a general quantum multiple-unicast network, it is still puzzling how to complete communication tasks perfectly with less resources such as registers. In this paper, we solve this problem. By applying quantum repeaters to multiple-unicast communication problem, we give encoding-decoding schemes for source nodes, internal ones and target ones, respectively. Source-target nodes share EPR pairs by using our encoding-decoding schemes over quantum multiple-unicast network. Furthermore, quantum communication can be accomplished perfectly via teleportation. Compared with existed schemes, our schemes can reduce resource consumption and realize long-distance transmission of quantum information.

Long-distance quantum communication over noisy networks without long-time quantum memory

Science.gov (United States)

Mazurek, Paweł; Grudka, Andrzej; Horodecki, Michał; Horodecki, Paweł; Łodyga, Justyna; Pankowski, Łukasz; PrzysieŻna, Anna

2014-12-01

The problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008), 10.1103/PhysRevA.78.062324] the authors put forward an important isomorphism between storing quantum information in a dimension D and transmission of quantum information in a D +1 -dimensional network. We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) network, even when taking into account that encoding and decoding of a state is exposed to an error. For 3D networks we propose a simple encoding and decoding scheme based solely on syndrome measurements on 2D Kitaev topological quantum memory. Our procedure constitutes an alternative scheme of state injection that can be used for universal quantum computation on 2D Kitaev code. It is shown that the encoding scheme is equivalent to teleporting the state, from a specific node into a whole two-dimensional network, through some virtual EPR pair existing within the rest of network qubits. We present an analytic lower bound on fidelity of the encoding and decoding procedure, using as our main tool a modified metric on space-time lattice, deviating from a taxicab metric at the first and the last time slices.

Block-free optical quantum Banyan network based on quantum state fusion and fission

International Nuclear Information System (INIS)

Zhu Chang-Hua; Meng Yan-Hong; Quan Dong-Xiao; Zhao Nan; Pei Chang-Xing

2014-01-01

Optical switch fabric plays an important role in building multiple-user optical quantum communication networks. Owing to its self-routing property and low complexity, a banyan network is widely used for building switch fabric. While, there is no efficient way to remove internal blocking in a banyan network in a classical way, quantum state fusion, by which the two-dimensional internal quantum states of two photons could be combined into a four-dimensional internal state of a single photon, makes it possible to solve this problem. In this paper, we convert the output mode of quantum state fusion from spatial-polarization mode into time-polarization mode. By combining modified quantum state fusion and quantum state fission with quantum Fredkin gate, we propose a practical scheme to build an optical quantum switch unit which is block free. The scheme can be extended to building more complex units, four of which are shown in this paper. (general)

Distributed wireless quantum communication networks with partially entangled pairs

International Nuclear Information System (INIS)

Yu Xu-Tao; Zhang Zai-Chen; Xu Jin

2014-01-01

Wireless quantum communication networks transfer quantum state by teleportation. Existing research focuses on maximal entangled pairs. In this paper, we analyse the distributed wireless quantum communication networks with partially entangled pairs. A quantum routing scheme with multi-hop teleportation is proposed. With the proposed scheme, is not necessary for the quantum path to be consistent with the classical path. The quantum path and its associated classical path are established in a distributed way. Direct multi-hop teleportation is conducted on the selected path to transfer a quantum state from the source to the destination. Based on the feature of multi-hop teleportation using partially entangled pairs, if the node number of the quantum path is even, the destination node will add another teleportation at itself. We simulated the performance of distributed wireless quantum communication networks with a partially entangled state. The probability of transferring the quantum state successfully is statistically analyzed. Our work shows that multi-hop teleportation on distributed wireless quantum networks with partially entangled pairs is feasible. (general)

Computationally Efficient Nonlinear Bell Inequalities for Quantum Networks

Science.gov (United States)

Luo, Ming-Xing

2018-04-01

The correlations in quantum networks have attracted strong interest with new types of violations of the locality. The standard Bell inequalities cannot characterize the multipartite correlations that are generated by multiple sources. The main problem is that no computationally efficient method is available for constructing useful Bell inequalities for general quantum networks. In this work, we show a significant improvement by presenting new, explicit Bell-type inequalities for general networks including cyclic networks. These nonlinear inequalities are related to the matching problem of an equivalent unweighted bipartite graph that allows constructing a polynomial-time algorithm. For the quantum resources consisting of bipartite entangled pure states and generalized Greenberger-Horne-Zeilinger (GHZ) states, we prove the generic nonmultilocality of quantum networks with multiple independent observers using new Bell inequalities. The violations are maximal with respect to the presented Tsirelson's bound for Einstein-Podolsky-Rosen states and GHZ states. Moreover, these violations hold for Werner states or some general noisy states. Our results suggest that the presented Bell inequalities can be used to characterize experimental quantum networks.

Towards a feasible implementation of quantum neural networks using quantum dots

International Nuclear Information System (INIS)

Altaisky, Mikhail V.; Zolnikova, Nadezhda N.; Kaputkina, Natalia E.; Krylov, Victor A.; Lozovik, Yurii E.; Dattani, Nikesh S.

2016-01-01

We propose an implementation of quantum neural networks using an array of quantum dots with dipole-dipole interactions. We demonstrate that this implementation is both feasible and versatile by studying it within the framework of GaAs based quantum dot qubits coupled to a reservoir of acoustic phonons. Using numerically exact Feynman integral calculations, we have found that the quantum coherence in our neural networks survive for over a hundred ps even at liquid nitrogen temperatures (77 K), which is three orders of magnitude higher than current implementations, which are based on SQUID-based systems operating at temperatures in the mK range.

Quantum perceptron over a field and neural network architecture selection in a quantum computer.

Science.gov (United States)

da Silva, Adenilton José; Ludermir, Teresa Bernarda; de Oliveira, Wilson Rosa

2016-04-01

In this work, we propose a quantum neural network named quantum perceptron over a field (QPF). Quantum computers are not yet a reality and the models and algorithms proposed in this work cannot be simulated in actual (or classical) computers. QPF is a direct generalization of a classical perceptron and solves some drawbacks found in previous models of quantum perceptrons. We also present a learning algorithm named Superposition based Architecture Learning algorithm (SAL) that optimizes the neural network weights and architectures. SAL searches for the best architecture in a finite set of neural network architectures with linear time over the number of patterns in the training set. SAL is the first learning algorithm to determine neural network architectures in polynomial time. This speedup is obtained by the use of quantum parallelism and a non-linear quantum operator. Copyright © 2016 Elsevier Ltd. All rights reserved.

Quantum logic networks for probabilistic teleportation

Institute of Scientific and Technical Information of China (English)

刘金明; 张永生; 等

2003-01-01

By eans of the primitive operations consisting of single-qubit gates.two-qubit controlled-not gates,Von Neuman measurement and classically controlled operations.,we construct efficient quantum logic networks for implementing probabilistic teleportation of a single qubit,a two-particle entangled state,and an N-particle entanglement.Based on the quantum networks,we show that after the partially entangled states are concentrated into maximal entanglement,the above three kinds of probabilistic teleportation are the same as the standard teleportation using the corresponding maximally entangled states as the quantum channels.

Quantum key distribution network for multiple applications

Science.gov (United States)

Tajima, A.; Kondoh, T.; Ochi, T.; Fujiwara, M.; Yoshino, K.; Iizuka, H.; Sakamoto, T.; Tomita, A.; Shimamura, E.; Asami, S.; Sasaki, M.

2017-09-01

The fundamental architecture and functions of secure key management in a quantum key distribution (QKD) network with enhanced universal interfaces for smooth key sharing between arbitrary two nodes and enabling multiple secure communication applications are proposed. The proposed architecture consists of three layers: a quantum layer, key management layer and key supply layer. We explain the functions of each layer, the key formats in each layer and the key lifecycle for enabling a practical QKD network. A quantum key distribution-advanced encryption standard (QKD-AES) hybrid system and an encrypted smartphone system were developed as secure communication applications on our QKD network. The validity and usefulness of these systems were demonstrated on the Tokyo QKD Network testbed.

Conditional efficient multiuser quantum cryptography network

International Nuclear Information System (INIS)

Xue Peng; Li Chuanfeng; Guo Guangcan

2002-01-01

We propose a conditional quantum key distribution scheme with three nonorthogonal states. Combined with the idea presented by Lo et al. (H.-K. Lo, H. F. Chau, and M. Ardehali, e-print arXiv: quant-ph/0011056), the efficiency of this scheme is increased to tend to 100%. Also, such a refined data analysis guarantees the security of our scheme against the most general eavesdropping strategy. Then, based on the scheme, we present a quantum cryptography network with the addition of a device called ''space optical switch.'' Moreover, we give out a realization of a quantum random number generator. Thus, a feasible experimental scheme of this efficient quantum cryptography network is completely given

The Stratonovich formulation of quantum feedback network rules

Science.gov (United States)

Gough, John E.

2016-12-01

We express the rules for forming quantum feedback networks using the Stratonovich form of quantum stochastic calculus rather than the Itō or SLH (J. E. Gough and M. R. James, "Quantum feedback networks: Hamiltonian formulation," Commun. Math. Phys. 287, 1109 (2009), J. E. Gough and M. R. James, "The Series product and its application to quantum feedforward and feedback networks," IEEE Trans. Autom. Control 54, 2530 (2009)) form. Remarkably the feedback reduction rule implies that we obtain the Schur complement of the matrix of Stratonovich coupling operators where we short out the internal input/output coefficients.

Trapped modes in linear quantum stochastic networks with delays

Energy Technology Data Exchange (ETDEWEB)

Tabak, Gil [Stanford University, Department of Applied Physics, Stanford, CA (United States); Mabuchi, Hideo

2016-12-15

Networks of open quantum systems with feedback have become an active area of research for applications such as quantum control, quantum communication and coherent information processing. A canonical formalism for the interconnection of open quantum systems using quantum stochastic differential equations (QSDEs) has been developed by Gough, James and co-workers and has been used to develop practical modeling approaches for complex quantum optical, microwave and optomechanical circuits/networks. In this paper we fill a significant gap in existing methodology by showing how trapped modes resulting from feedback via coupled channels with finite propagation delays can be identified systematically in a given passive linear network. Our method is based on the Blaschke-Potapov multiplicative factorization theorem for inner matrix-valued functions, which has been applied in the past to analog electronic networks. Our results provide a basis for extending the Quantum Hardware Description Language (QHDL) framework for automated quantum network model construction (Tezak et al. in Philos. Trans. R. Soc. A, Math. Phys. Eng. Sci. 370(1979):5270-5290, 2012) to efficiently treat scenarios in which each interconnection of components has an associated signal propagation time delay. (orig.)

Steady and Unsteady Force and Moment Data on a DARPA2 Submarine

OpenAIRE

Whitfield, Cindy Carol

1999-01-01

Steady and unsteady force and moment experiments were conducted in the Virginia Tech Stability wind tunnel using the Dynamic Plunge-Pitch-Roll (DyPPiR) model mount to perform rapid time-dependent,high-excursion maneuvers. The experiments were performed for a DARPA2 submarine model using three widely spaced 2-force-component loadcells and three tri-axial accelerometers to extract the aerodynamic loads. The DARPA2 model was tested with different body configurations in two different test sect...

Iris Data Classification Using Quantum Neural Networks

International Nuclear Information System (INIS)

Sahni, Vishal; Patvardhan, C.

2006-01-01

Quantum computing is a novel paradigm that promises to be the future of computing. The performance of quantum algorithms has proved to be stunning. ANN within the context of classical computation has been used for approximation and classification tasks with some success. This paper presents an idea of quantum neural networks along with the training algorithm and its convergence property. It synergizes the unique properties of quantum bits or qubits with the various techniques in vogue in neural networks. An example application of Fisher's Iris data set, a benchmark classification problem has also been presented. The results obtained amply demonstrate the classification capabilities of the quantum neuron and give an idea of their promising capabilities

Google in a quantum network.

Science.gov (United States)

Paparo, G D; Martin-Delgado, M A

2012-01-01

We introduce the characterization of a class of quantum PageRank algorithms in a scenario in which some kind of quantum network is realizable out of the current classical internet web, but no quantum computer is yet available. This class represents a quantization of the PageRank protocol currently employed to list web pages according to their importance. We have found an instance of this class of quantum protocols that outperforms its classical counterpart and may break the classical hierarchy of web pages depending on the topology of the web.

Building the quantum network

International Nuclear Information System (INIS)

Elliott, Chip

2002-01-01

We show how quantum key distribution (QKD) techniques can be employed within realistic, highly secure communications systems, using the internet architecture for a specific example. We also discuss how certain drawbacks in existing QKD point-to-point links can be mitigated by building QKD networks, where such networks can be composed of trusted relays or untrusted photonic switches. (author)

Overview of implementation of DARPA GPU program in SAIC

Science.gov (United States)

Braunreiter, Dennis; Furtek, Jeremy; Chen, Hai-Wen; Healy, Dennis

2008-04-01

This paper reviews the implementation of DARPA MTO STAP-BOY program for both Phase I and II conducted at Science Applications International Corporation (SAIC). The STAP-BOY program conducts fast covariance factorization and tuning techniques for space-time adaptive process (STAP) Algorithm Implementation on Graphics Processor unit (GPU) Architectures for Embedded Systems. The first part of our presentation on the DARPA STAP-BOY program will focus on GPU implementation and algorithm innovations for a prototype radar STAP algorithm. The STAP algorithm will be implemented on the GPU, using stream programming (from companies such as PeakStream, ATI Technologies' CTM, and NVIDIA) and traditional graphics APIs. This algorithm will include fast range adaptive STAP weight updates and beamforming applications, each of which has been modified to exploit the parallel nature of graphics architectures.

Fermionic topological quantum states as tensor networks

Science.gov (United States)

Wille, C.; Buerschaper, O.; Eisert, J.

2017-06-01

Tensor network states, and in particular projected entangled pair states, play an important role in the description of strongly correlated quantum lattice systems. They do not only serve as variational states in numerical simulation methods, but also provide a framework for classifying phases of quantum matter and capture notions of topological order in a stringent and rigorous language. The rapid development in this field for spin models and bosonic systems has not yet been mirrored by an analogous development for fermionic models. In this work, we introduce a tensor network formalism capable of capturing notions of topological order for quantum systems with fermionic components. At the heart of the formalism are axioms of fermionic matrix-product operator injectivity, stable under concatenation. Building upon that, we formulate a Grassmann number tensor network ansatz for the ground state of fermionic twisted quantum double models. A specific focus is put on the paradigmatic example of the fermionic toric code. This work shows that the program of describing topologically ordered systems using tensor networks carries over to fermionic models.

Short-Term Load Forecasting Model Based on Quantum Elman Neural Networks

Directory of Open Access Journals (Sweden)

Zhisheng Zhang

2016-01-01

Full Text Available Short-term load forecasting model based on quantum Elman neural networks was constructed in this paper. The quantum computation and Elman feedback mechanism were integrated into quantum Elman neural networks. Quantum computation can effectively improve the approximation capability and the information processing ability of the neural networks. Quantum Elman neural networks have not only the feedforward connection but also the feedback connection. The feedback connection between the hidden nodes and the context nodes belongs to the state feedback in the internal system, which has formed specific dynamic memory performance. Phase space reconstruction theory is the theoretical basis of constructing the forecasting model. The training samples are formed by means of K-nearest neighbor approach. Through the example simulation, the testing results show that the model based on quantum Elman neural networks is better than the model based on the quantum feedforward neural network, the model based on the conventional Elman neural network, and the model based on the conventional feedforward neural network. So the proposed model can effectively improve the prediction accuracy. The research in the paper makes a theoretical foundation for the practical engineering application of the short-term load forecasting model based on quantum Elman neural networks.

Communication via an entangled coherent quantum network

Energy Technology Data Exchange (ETDEWEB)

El Allati, A; Hassouni, Y [Faculte des Sciences, Departement de Physique, Laboratoire de Physique Theorique URAC 13, Universite Mohammed V Agdal Rabat, Avenue Ibn Battouta, B.P. 1014, Rabat (Morocco); Metwally, N, E-mail: Nmetwally@gmail.com [Mathematics Department, College of Science, University of Bahrain, PO Box 32038 (Bahrain)

2011-06-01

A quantum network (QN) is constructed via maximum entangled coherent states. The possibility of using this network to achieve quantum communication between multi-participants is investigated. We showed that the probability of the successful teleportation of an unknown state depends on the size of the used network. As the number of participants increases, the success probability does not depend on the intensity of the field. Implementing a quantum teleportation protocol via a noisy QN is discussed. The unknown state can be teleported perfectly with small values of the field intensity and larger values of the noise strength. The success probability of this suggested protocol increases abruptly for larger values of the noise strength and gradually for small values. For small-size QNs, the fidelity of the teleported state decreases smoothly, whereas it decreases abruptly for larger-sized networks.

Network geometry with flavor: From complexity to quantum geometry

Science.gov (United States)

Bianconi, Ginestra; Rahmede, Christoph

2016-03-01

Network geometry is attracting increasing attention because it has a wide range of applications, ranging from data mining to routing protocols in the Internet. At the same time advances in the understanding of the geometrical properties of networks are essential for further progress in quantum gravity. In network geometry, simplicial complexes describing the interaction between two or more nodes play a special role. In fact these structures can be used to discretize a geometrical d -dimensional space, and for this reason they have already been widely used in quantum gravity. Here we introduce the network geometry with flavor s =-1 ,0 ,1 (NGF) describing simplicial complexes defined in arbitrary dimension d and evolving by a nonequilibrium dynamics. The NGF can generate discrete geometries of different natures, ranging from chains and higher-dimensional manifolds to scale-free networks with small-world properties, scale-free degree distribution, and nontrivial community structure. The NGF admits as limiting cases both the Bianconi-Barabási models for complex networks, the stochastic Apollonian network, and the recently introduced model for complex quantum network manifolds. The thermodynamic properties of NGF reveal that NGF obeys a generalized area law opening a new scenario for formulating its coarse-grained limit. The structure of NGF is strongly dependent on the dimensionality d . In d =1 NGFs grow complex networks for which the preferential attachment mechanism is necessary in order to obtain a scale-free degree distribution. Instead, for NGF with dimension d >1 it is not necessary to have an explicit preferential attachment rule to generate scale-free topologies. We also show that NGF admits a quantum mechanical description in terms of associated quantum network states. Quantum network states evolve by a Markovian dynamics and a quantum network state at time t encodes all possible NGF evolutions up to time t . Interestingly the NGF remains fully classical but

Quantum-Like Bayesian Networks for Modeling Decision Making

Directory of Open Access Journals (Sweden)

Catarina eMoreira

2016-01-01

Full Text Available In this work, we explore an alternative quantum structure to perform quantum probabilistic inferences to accommodate the paradoxical findings of the Sure Thing Principle. We propose a Quantum-Like Bayesian Network, which consists in replacing classical probabilities by quantum probability amplitudes. However, since this approach suffers from the problem of exponential growth of quantum parameters, we also propose a similarity heuristic that automatically fits quantum parameters through vector similarities. This makes the proposed model general and predictive in contrast to the current state of the art models, which cannot be generalized for more complex decision scenarios and that only provide an explanatory nature for the observed paradoxes. In the end, the model that we propose consists in a nonparametric method for estimating inference effects from a statistical point of view. It is a statistical model that is simpler than the previous quantum dynamic and quantum-like models proposed in the literature. We tested the proposed network with several empirical data from the literature, mainly from the Prisoner's Dilemma game and the Two Stage Gambling game. The results obtained show that the proposed quantum Bayesian Network is a general method that can accommodate violations of the laws of classical probability theory and make accurate predictions regarding human decision-making in these scenarios.

Quantum-entanglement storage and extraction in quantum network node

Science.gov (United States)

Shan, Zhuoyu; Zhang, Yong

Quantum computing and quantum communication have become the most popular research topic. Nitrogen-vacancy (NV) centers in diamond have been shown the great advantage of implementing quantum information processing. The generation of entanglement between NV centers represents a fundamental prerequisite for all quantum information technologies. In this paper, we propose a scheme to realize the high-fidelity storage and extraction of quantum entanglement information based on the NV centers at room temperature. We store the entangled information of a pair of entangled photons in the Bell state into the nuclear spins of two NV centers, which can make these two NV centers entangled. And then we illuminate how to extract the entangled information from NV centers to prepare on-demand entangled states for optical quantum information processing. The strategy of engineering entanglement demonstrated here maybe pave the way towards a NV center-based quantum network.

Physical approach to quantum networks with massive particles

Science.gov (United States)

Andersen, Molte Emil Strange; Zinner, Nikolaj Thomas

2018-04-01

Assembling large-scale quantum networks is a key goal of modern physics research with applications in quantum information and computation. Quantum wires and waveguides in which massive particles propagate in tailored confinement is one promising platform for realizing a quantum network. In the literature, such networks are often treated as quantum graphs, that is, the wave functions are taken to live on graphs of one-dimensional edges meeting in vertices. Hitherto, it has been unclear what boundary conditions on the vertices produce the physical states one finds in nature. This paper treats a quantum network from a physical approach, explicitly finds the physical eigenstates and compares them to the quantum-graph description. The basic building block of a quantum network is an X-shaped potential well made by crossing two quantum wires, and we consider a massive particle in such an X well. The system is analyzed using a variational method based on an expansion into modes with fast convergence and it provides a very clear intuition for the physics of the problem. The particle is found to have a ground state that is exponentially localized to the center of the X well, and the other symmetric solutions are formed so to be orthogonal to the ground state. This is in contrast to the predictions of the conventionally used so-called Kirchoff boundary conditions in quantum graph theory that predict a different sequence of symmetric solutions that cannot be physically realized. Numerical methods have previously been the only source of information on the ground-state wave function and our results provide a different perspective with strong analytical insights. The ground-state wave function has a spatial profile that looks very similar to the shape of a solitonic solution to a nonlinear Schrödinger equation, enabling an analytical prediction of the wave number. When combining multiple X wells into a network or grid, each site supports a solitonlike localized state. These

Tensor Networks and Quantum Error Correction

Science.gov (United States)

Ferris, Andrew J.; Poulin, David

2014-07-01

We establish several relations between quantum error correction (QEC) and tensor network (TN) methods of quantum many-body physics. We exhibit correspondences between well-known families of QEC codes and TNs, and demonstrate a formal equivalence between decoding a QEC code and contracting a TN. We build on this equivalence to propose a new family of quantum codes and decoding algorithms that generalize and improve upon quantum polar codes and successive cancellation decoding in a natural way.

Non-classical state engineering for quantum networks

International Nuclear Information System (INIS)

Vollmer, Christina E.

2014-01-01

The wide field of quantum information processing and quantum networks has developed very fast in the last two decades. Besides the regime of discrete variables, which was developed first, the regime of continuous variables represents an alternative approach to realize many quantum applications. Non-classical states of light, like squeezed or entangled states, are a fundamental resource for quantum applications like quantum repeaters, quantum memories, quantum key distribution, quantum spectroscopy, and quantum metrology. These states can be generated successfully in the infrared wavelength regime. However, for some tasks other wavelengths, especially in the visible wavelength regime, are desirable. To generate non-classical states of light in this wavelength regime frequency up-conversion can be used, since all quantum properties are maintained in this process. The first part of this thesis deals with the experimental frequency up-conversion of quantum states. Squeezed vacuum states of light at 1550 nm were up-converted to 532 nm and a noise reduction of -1.5 dB at 532 nm was achieved. These states can be used for increasing the sensitivity of gravitational wave detectors or spectroscopic measurements. Furthermore, one part of an entangled state at 1550 nm was up-converted to 532 nm and, thus, entanglement between these two wavelengths was generated and characterized to -1.4 dB following Duan et al. With such a quantum link it is possible to establish a quantum network, which takes advantage of the low optical loss at 1550 nm for information transmission and of atomic transitions around 532 nm for a quantum memory in a quantum repeater. For quantum networks the distribution of entanglement and especially of a quantum key is essential. In the second part of this thesis the experimental distribution of entanglement by separable states is demonstrated. The underlying protocol requires a special three-mode state, which is separable in two of the three splittings. With

Non-classical state engineering for quantum networks

Energy Technology Data Exchange (ETDEWEB)

Vollmer, Christina E.

2014-01-24

The wide field of quantum information processing and quantum networks has developed very fast in the last two decades. Besides the regime of discrete variables, which was developed first, the regime of continuous variables represents an alternative approach to realize many quantum applications. Non-classical states of light, like squeezed or entangled states, are a fundamental resource for quantum applications like quantum repeaters, quantum memories, quantum key distribution, quantum spectroscopy, and quantum metrology. These states can be generated successfully in the infrared wavelength regime. However, for some tasks other wavelengths, especially in the visible wavelength regime, are desirable. To generate non-classical states of light in this wavelength regime frequency up-conversion can be used, since all quantum properties are maintained in this process. The first part of this thesis deals with the experimental frequency up-conversion of quantum states. Squeezed vacuum states of light at 1550 nm were up-converted to 532 nm and a noise reduction of -1.5 dB at 532 nm was achieved. These states can be used for increasing the sensitivity of gravitational wave detectors or spectroscopic measurements. Furthermore, one part of an entangled state at 1550 nm was up-converted to 532 nm and, thus, entanglement between these two wavelengths was generated and characterized to -1.4 dB following Duan et al. With such a quantum link it is possible to establish a quantum network, which takes advantage of the low optical loss at 1550 nm for information transmission and of atomic transitions around 532 nm for a quantum memory in a quantum repeater. For quantum networks the distribution of entanglement and especially of a quantum key is essential. In the second part of this thesis the experimental distribution of entanglement by separable states is demonstrated. The underlying protocol requires a special three-mode state, which is separable in two of the three splittings. With

Quantum Random Networks for Type 2 Quantum Computers

National Research Council Canada - National Science Library

Allara, David L; Hasslacher, Brosl

2006-01-01

Random boolean networks (RBNs) have been studied theoretically and computationally in order to be able to use their remarkable self-healing and large basins of altercation properties as quantum computing architectures, especially...

Exploration of Digital Circuits and Transistor-Level Testing in the DARPA TRUST Program

Science.gov (United States)

2015-03-01

attacked is to have the Trojan Horse being the signal. The term Trojan Horse was originally invented when the Greek soldiers tried to invade Troy but...night Greek soldiers came out of the horse and destroyed the city. Nowadays, a Trojan Horse is a seemingly innocuous piece of hardware or software...the DARPA TRUST program was initiated and continues to be a vital component in the war fighting effort of the DoD. One reason that the DARPA TRUST

Quantum Google in a Complex Network

Science.gov (United States)

Paparo, Giuseppe Davide; Müller, Markus; Comellas, Francesc; Martin-Delgado, Miguel Angel

2013-01-01

We investigate the behaviour of the recently proposed Quantum PageRank algorithm, in large complex networks. We find that the algorithm is able to univocally reveal the underlying topology of the network and to identify and order the most relevant nodes. Furthermore, it is capable to clearly highlight the structure of secondary hubs and to resolve the degeneracy in importance of the low lying part of the list of rankings. The quantum algorithm displays an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance, as compared to the classical algorithm. We test the performance and confirm the listed features by applying it to real world examples from the WWW. Finally, we raise and partially address whether the increased sensitivity of the quantum algorithm persists under coordinated attacks in scale-free and random networks. PMID:24091980

Quantum Google in a Complex Network

Science.gov (United States)

Paparo, Giuseppe Davide; Müller, Markus; Comellas, Francesc; Martin-Delgado, Miguel Angel

2013-10-01

We investigate the behaviour of the recently proposed Quantum PageRank algorithm, in large complex networks. We find that the algorithm is able to univocally reveal the underlying topology of the network and to identify and order the most relevant nodes. Furthermore, it is capable to clearly highlight the structure of secondary hubs and to resolve the degeneracy in importance of the low lying part of the list of rankings. The quantum algorithm displays an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance, as compared to the classical algorithm. We test the performance and confirm the listed features by applying it to real world examples from the WWW. Finally, we raise and partially address whether the increased sensitivity of the quantum algorithm persists under coordinated attacks in scale-free and random networks.

Single-hidden-layer feed-forward quantum neural network based on Grover learning.

Science.gov (United States)

Liu, Cheng-Yi; Chen, Chein; Chang, Ching-Ter; Shih, Lun-Min

2013-09-01

In this paper, a novel single-hidden-layer feed-forward quantum neural network model is proposed based on some concepts and principles in the quantum theory. By combining the quantum mechanism with the feed-forward neural network, we defined quantum hidden neurons and connected quantum weights, and used them as the fundamental information processing unit in a single-hidden-layer feed-forward neural network. The quantum neurons make a wide range of nonlinear functions serve as the activation functions in the hidden layer of the network, and the Grover searching algorithm outstands the optimal parameter setting iteratively and thus makes very efficient neural network learning possible. The quantum neuron and weights, along with a Grover searching algorithm based learning, result in a novel and efficient neural network characteristic of reduced network, high efficient training and prospect application in future. Some simulations are taken to investigate the performance of the proposed quantum network and the result show that it can achieve accurate learning. Copyright © 2013 Elsevier Ltd. All rights reserved.

Generation of a superposition of odd photon number states for quantum information networks

DEFF Research Database (Denmark)

Neergaard-Nielsen, Jonas Schou; Nielsen, B.; Hettich, C.

2006-01-01

Quantum information networks, quantum memories, quantum repeaters, linear optics quantum computers Udgivelsesdato: 25 August......Quantum information networks, quantum memories, quantum repeaters, linear optics quantum computers Udgivelsesdato: 25 August...

Neural-Network Quantum States, String-Bond States, and Chiral Topological States

Science.gov (United States)

Glasser, Ivan; Pancotti, Nicola; August, Moritz; Rodriguez, Ivan D.; Cirac, J. Ignacio

2018-01-01

Neural-network quantum states have recently been introduced as an Ansatz for describing the wave function of quantum many-body systems. We show that there are strong connections between neural-network quantum states in the form of restricted Boltzmann machines and some classes of tensor-network states in arbitrary dimensions. In particular, we demonstrate that short-range restricted Boltzmann machines are entangled plaquette states, while fully connected restricted Boltzmann machines are string-bond states with a nonlocal geometry and low bond dimension. These results shed light on the underlying architecture of restricted Boltzmann machines and their efficiency at representing many-body quantum states. String-bond states also provide a generic way of enhancing the power of neural-network quantum states and a natural generalization to systems with larger local Hilbert space. We compare the advantages and drawbacks of these different classes of states and present a method to combine them together. This allows us to benefit from both the entanglement structure of tensor networks and the efficiency of neural-network quantum states into a single Ansatz capable of targeting the wave function of strongly correlated systems. While it remains a challenge to describe states with chiral topological order using traditional tensor networks, we show that, because of their nonlocal geometry, neural-network quantum states and their string-bond-state extension can describe a lattice fractional quantum Hall state exactly. In addition, we provide numerical evidence that neural-network quantum states can approximate a chiral spin liquid with better accuracy than entangled plaquette states and local string-bond states. Our results demonstrate the efficiency of neural networks to describe complex quantum wave functions and pave the way towards the use of string-bond states as a tool in more traditional machine-learning applications.

Decoherence and Entanglement Simulation in a Model of Quantum Neural Network Based on Quantum Dots

Directory of Open Access Journals (Sweden)

Altaisky Mikhail V.

2016-01-01

Full Text Available We present the results of the simulation of a quantum neural network based on quantum dots using numerical method of path integral calculation. In the proposed implementation of the quantum neural network using an array of single-electron quantum dots with dipole-dipole interaction, the coherence is shown to survive up to 0.1 nanosecond in time and up to the liquid nitrogen temperature of 77K.We study the quantum correlations between the quantum dots by means of calculation of the entanglement of formation in a pair of quantum dots on the GaAs based substrate with dot size of 100 ÷ 101 nanometer and interdot distance of 101 ÷ 102 nanometers order.

Transfer of an unknown quantum state, quantum networks, and memory

International Nuclear Information System (INIS)

Biswas, Asoka; Agarwal, G.S.

2004-01-01

We present a protocol for transfer of an unknown quantum state. The protocol is based on a two-mode cavity interacting dispersively in a sequential manner with three-level atoms in the Λ configuration. We propose a scheme for quantum networking using an atomic channel. We investigate the effect of cavity decoherence in the entire process. Further, we demonstrate the possibility of an efficient quantum memory for arbitrary superposition of two modes of a cavity containing one photon

Quantum games on evolving random networks

OpenAIRE

Pawela, Łukasz

2015-01-01

We study the advantages of quantum strategies in evolutionary social dilemmas on evolving random networks. We focus our study on the two-player games: prisoner's dilemma, snowdrift and stag-hunt games. The obtained result show the benefits of quantum strategies for the prisoner's dilemma game. For the other two games, we obtain regions of parameters where the quantum strategies dominate, as well as regions where the classical strategies coexist.

Long-term performance of the SwissQuantum quantum key distribution network in a field environment

International Nuclear Information System (INIS)

Stucki, D; Gisin, N; Thew, R; Legré, M; Clausen, B; Monat, L; Page, J-B; Ribordy, G; Rochas, A; Robyr, S; Trinkler, P; Buntschu, F; Perroud, D; Felber, N; Henzen, L; Junod, P; Monbaron, P; Ventura, S; Litzistorf, G; Tavares, J

2011-01-01

In this paper, we report on the performance of the SwissQuantum quantum key distribution (QKD) network. The network was installed in the Geneva metropolitan area and ran for more than one-and-a-half years, from the end of March 2009 to the beginning of January 2011. The main goal of this experiment was to test the reliability of the quantum layer over a long period of time in a production environment. A key management layer has been developed to manage the key between the three nodes of the network. This QKD-secure network was utilized by end-users through an application layer. (paper)

Continuous variable multipartite entanglement and optical implementations of quantum communication networks

International Nuclear Information System (INIS)

Lian Yimin; Xie Changde; Peng Kunchi

2007-01-01

A variety of optical quantum information networks based on the multipartite entanglement of amplitude and phase quadratures of an electromagnetic field have been proposed and experimentally realized in recent years. The multipartite entanglement of optical continuous variables provides flexible and reliable quantum resources for developing unconditional quantum information networks. In this paper, we review the generation schemes of the multipartite entangled states of optical continuous quantum variables and some applications in the quantum communication networks with emphasis on the experimental implementations

Optimal Quantum Spatial Search on Random Temporal Networks

Science.gov (United States)

Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

2017-12-01

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

Optimal Quantum Spatial Search on Random Temporal Networks.

Science.gov (United States)

Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

2017-12-01

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G(n,p), where p is the probability that any two given nodes are connected: After every time interval τ, a new graph G(n,p) replaces the previous one. We prove analytically that, for any given p, there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O(sqrt[n]), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

Spin networks and quantum computation

International Nuclear Information System (INIS)

Kauffman, L.; Lomonaco, S. Jr.

2008-01-01

We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. The simplest case of these models is the Fibonacci model, itself universal for quantum computation. We here formulate these braid group representations in a form suitable for computation and algebraic work. (authors)

Quantum Entanglement in Neural Network States

Directory of Open Access Journals (Sweden)

Dong-Ling Deng

2017-05-01

Full Text Available Machine learning, one of today’s most rapidly growing interdisciplinary fields, promises an unprecedented perspective for solving intricate quantum many-body problems. Understanding the physical aspects of the representative artificial neural-network states has recently become highly desirable in the applications of machine-learning techniques to quantum many-body physics. In this paper, we explore the data structures that encode the physical features in the network states by studying the quantum entanglement properties, with a focus on the restricted-Boltzmann-machine (RBM architecture. We prove that the entanglement entropy of all short-range RBM states satisfies an area law for arbitrary dimensions and bipartition geometry. For long-range RBM states, we show by using an exact construction that such states could exhibit volume-law entanglement, implying a notable capability of RBM in representing quantum states with massive entanglement. Strikingly, the neural-network representation for these states is remarkably efficient, in the sense that the number of nonzero parameters scales only linearly with the system size. We further examine the entanglement properties of generic RBM states by randomly sampling the weight parameters of the RBM. We find that their averaged entanglement entropy obeys volume-law scaling, and the meantime strongly deviates from the Page entropy of the completely random pure states. We show that their entanglement spectrum has no universal part associated with random matrix theory and bears a Poisson-type level statistics. Using reinforcement learning, we demonstrate that RBM is capable of finding the ground state (with power-law entanglement of a model Hamiltonian with a long-range interaction. In addition, we show, through a concrete example of the one-dimensional symmetry-protected topological cluster states, that the RBM representation may also be used as a tool to analytically compute the entanglement spectrum. Our

Quantum networks in divergence-free circuit QED

Science.gov (United States)

Parra-Rodriguez, A.; Rico, E.; Solano, E.; Egusquiza, I. L.

2018-04-01

Superconducting circuits are one of the leading quantum platforms for quantum technologies. With growing system complexity, it is of crucial importance to develop scalable circuit models that contain the minimum information required to predict the behaviour of the physical system. Based on microwave engineering methods, divergent and non-divergent Hamiltonian models in circuit quantum electrodynamics have been proposed to explain the dynamics of superconducting quantum networks coupled to infinite-dimensional systems, such as transmission lines and general impedance environments. Here, we study systematically common linear coupling configurations between networks and infinite-dimensional systems. The main result is that the simple Lagrangian models for these configurations present an intrinsic natural length that provides a natural ultraviolet cutoff. This length is due to the unavoidable dressing of the environment modes by the network. In this manner, the coupling parameters between their components correctly manifest their natural decoupling at high frequencies. Furthermore, we show the requirements to correctly separate infinite-dimensional coupled systems in local bases. We also compare our analytical results with other analytical and approximate methods available in the literature. Finally, we propose several applications of these general methods to analogue quantum simulation of multi-spin-boson models in non-perturbative coupling regimes.

Complex Quantum Network Manifolds in Dimension d > 2 are Scale-Free

Science.gov (United States)

Bianconi, Ginestra; Rahmede, Christoph

2015-09-01

In quantum gravity, several approaches have been proposed until now for the quantum description of discrete geometries. These theoretical frameworks include loop quantum gravity, causal dynamical triangulations, causal sets, quantum graphity, and energetic spin networks. Most of these approaches describe discrete spaces as homogeneous network manifolds. Here we define Complex Quantum Network Manifolds (CQNM) describing the evolution of quantum network states, and constructed from growing simplicial complexes of dimension . We show that in d = 2 CQNM are homogeneous networks while for d > 2 they are scale-free i.e. they are characterized by large inhomogeneities of degrees like most complex networks. From the self-organized evolution of CQNM quantum statistics emerge spontaneously. Here we define the generalized degrees associated with the -faces of the -dimensional CQNMs, and we show that the statistics of these generalized degrees can either follow Fermi-Dirac, Boltzmann or Bose-Einstein distributions depending on the dimension of the -faces.

Semantic Web Services with Web Ontology Language (OWL-S) - Specification of Agent-Services for DARPA Agent Markup Language (DAML)

National Research Council Canada - National Science Library

Sycara, Katia P

2006-01-01

CMU did research and development on semantic web services using OWL-S, the semantic web service language under the Defense Advanced Research Projects Agency- DARPA Agent Markup Language (DARPA-DAML) program...

Virginia Tech team qualifies as DARPA Urban Challenge semi-finalist

OpenAIRE

Crumbley, Liz

2007-01-01

"VictorTango," a team of Virginia Tech engineering and geography students, will travel to Victorville, Calif., for the national qualifying rounds of the Urban Challenge autonomous vehicle competition, sponsored by the Defense Advanced Research Projects Agency (DARPA).

Entangled network and quantum communication

Energy Technology Data Exchange (ETDEWEB)

Metwally, Nasser, E-mail: Nmetwally@gmail.com [Math. Dept., Faculty of Science, South Valley University, Aswan (Egypt); Math. Dept., College of Science, University of Bahrain, P.O. Box 32038 (Bahrain)

2011-11-21

A theoretical scheme is introduced to generate entangled network via Dzyaloshinskii–Moriya (DM) interaction. The dynamics of entanglement between different nodes, which is generated by direct or indirect interaction, is investigated. It is shown that, the direction of (DM) interaction and the locations of the nodes have a sensational effect on the degree of entanglement. The minimum entanglement generated between all the nodes is quantified. The upper and lower bounds of the entanglement depend on the direction of DM interaction, and the repetition of the behavior depends on the strength of DM. The generated entangled nodes are used as quantum channel to perform quantum teleportation, where it is shown that the fidelity of teleporting unknown information between the network members depends on the locations of the members.

Experimental violation of local causality in a quantum network

Science.gov (United States)

Carvacho, Gonzalo; Andreoli, Francesco; Santodonato, Luca; Bentivegna, Marco; Chaves, Rafael; Sciarrino, Fabio

2017-03-01

Bell's theorem plays a crucial role in quantum information processing and thus several experimental investigations of Bell inequalities violations have been carried out over the years. Despite their fundamental relevance, however, previous experiments did not consider an ingredient of relevance for quantum networks: the fact that correlations between distant parties are mediated by several, typically independent sources. Here, using a photonic setup, we investigate a quantum network consisting of three spatially separated nodes whose correlations are mediated by two distinct sources. This scenario allows for the emergence of the so-called non-bilocal correlations, incompatible with any local model involving two independent hidden variables. We experimentally witness the emergence of this kind of quantum correlations by violating a Bell-like inequality under the fair-sampling assumption. Our results provide a proof-of-principle experiment of generalizations of Bell's theorem for networks, which could represent a potential resource for quantum communication protocols.

Faithful qubit transmission in a quantum communication network with heterogeneous channels

Science.gov (United States)

Chen, Na; Zhang, Lin Xi; Pei, Chang Xing

2018-04-01

Quantum communication networks enable long-distance qubit transmission and distributed quantum computation. In this paper, a quantum communication network with heterogeneous quantum channels is constructed. A faithful qubit transmission scheme is presented. Detailed calculations and performance analyses show that even in a low-quality quantum channel with serious decoherence, only modest number of locally prepared target qubits are required to achieve near-deterministic qubit transmission.

Evolution of quantum and classical strategies on networks by group interactions

International Nuclear Information System (INIS)

Li Qiang; Chen Minyou; Iqbal, Azhar; Abbott, Derek

2012-01-01

In this paper, quantum strategies are introduced within evolutionary games in order to investigate the evolution of quantum and classical strategies on networks in the public goods game. Comparing the results of evolution on a scale-free network and a square lattice, we find that a quantum strategy outperforms the classical strategies, regardless of the network. Moreover, a quantum strategy dominates the population earlier in group interactions than it does in pairwise interactions. In particular, if the hub node in a scale-free network is occupied by a cooperator initially, the strategy of cooperation will prevail in the population. However, in other situations, a quantum strategy can defeat the classical ones and finally becomes the dominant strategy in the population. (paper)

Parallel state transfer and efficient quantum routing on quantum networks.

Science.gov (United States)

Chudzicki, Christopher; Strauch, Frederick W

2010-12-31

We study the routing of quantum information in parallel on multidimensional networks of tunable qubits and oscillators. These theoretical models are inspired by recent experiments in superconducting circuits. We show that perfect parallel state transfer is possible for certain networks of harmonic oscillator modes. We extend this to the distribution of entanglement between every pair of nodes in the network, finding that the routing efficiency of hypercube networks is optimal and robust in the presence of dissipation and finite bandwidth.

A synopsis of the Defense Advanced Research Projects Agency (DARPA) investment in additive manufacture and what challenges remain

Science.gov (United States)

Maher, Michael; Smith, Adrien; Margiotta, Jesse

2014-03-01

DARPA's interest in additive manufacture dates back to the mid-80s with seedling programs that developed the foundational knowledge and equipment that led to the Solid Freeform Fabrication program in 1990. The drivers for this program included reducing development times by enabling "tool-less" manufacturing as well as integration of design and fabrication tools. DARPA consistently pushed the boundaries of additive manufacture with follow-on programs that expanded the material suite available for 3-D printing as well as new processes that expanded the technology's capability base. Programs such as the Mesoscopic Integrated Conformal Electronics (MICE) program incorporated functionality to the manufacturing processes through direct write of electronics. DARPA's investment in additive manufacture continues to this day but the focus has changed. DARPA's early investments were focused on developing and demonstrating the technology's capabilities. Now that the technology has been demonstrated, there is serious interest in taking advantage of the attributes unique to the processing methodology (such as customization and new design possibilities) for producing production parts. Accordingly, today's investment at DARPA addresses the systematic barriers to implementation rather than the technology itself. The Open Manufacturing program is enabling rapid qualification of new technologies for the manufacturing environment through the development of new modeling and informatics tools. While the technology is becoming more mainstream, there are plenty of challenges that need to be addressed. And as the technology continues to mature, the agency will continue to look for those "DARPA-hard" challenges that enable revolutionary changes in capability and performance for the Department of Defense.

Generalized Tavis-Cummings models and quantum networks

Science.gov (United States)

Gorokhov, A. V.

2018-04-01

The properties of quantum networks based on generalized Tavis-Cummings models are theoretically investigated. We have calculated the information transfer success rate from one node to another in a simple model of a quantum network realized with two-level atoms placed in the cavities and interacting with an external laser field and cavity photons. The method of dynamical group of the Hamiltonian and technique of corresponding coherent states were used for investigation of the temporal dynamics of the two nodes model.

Quantum network theory

International Nuclear Information System (INIS)

Yurke, B.; Denker, J.S.

1984-01-01

A general approach, within the framework of canonical quantization, is described for analyzing the quantum behavior of complicated electronic circuits. This approach is capable of dealing with electrical networks having nonlinear or dissipative elements. The techniques are used to analyze a degenerate parametric amplifier, a device capable of generating squeezed coherent state signals. A circuit capable of performing back-action-evading electrical measurements is also discussed. (author)

Quantum stochastic walks on networks for decision-making.

Science.gov (United States)

Martínez-Martínez, Ismael; Sánchez-Burillo, Eduardo

2016-03-31

Recent experiments report violations of the classical law of total probability and incompatibility of certain mental representations when humans process and react to information. Evidence shows promise of a more general quantum theory providing a better explanation of the dynamics and structure of real decision-making processes than classical probability theory. Inspired by this, we show how the behavioral choice-probabilities can arise as the unique stationary distribution of quantum stochastic walkers on the classical network defined from Luce's response probabilities. This work is relevant because (i) we provide a very general framework integrating the positive characteristics of both quantum and classical approaches previously in confrontation, and (ii) we define a cognitive network which can be used to bring other connectivist approaches to decision-making into the quantum stochastic realm. We model the decision-maker as an open system in contact with her surrounding environment, and the time-length of the decision-making process reveals to be also a measure of the process' degree of interplay between the unitary and irreversible dynamics. Implementing quantum coherence on classical networks may be a door to better integrate human-like reasoning biases in stochastic models for decision-making.

Quantum stochastic walks on networks for decision-making

Science.gov (United States)

Martínez-Martínez, Ismael; Sánchez-Burillo, Eduardo

2016-03-01

Recent experiments report violations of the classical law of total probability and incompatibility of certain mental representations when humans process and react to information. Evidence shows promise of a more general quantum theory providing a better explanation of the dynamics and structure of real decision-making processes than classical probability theory. Inspired by this, we show how the behavioral choice-probabilities can arise as the unique stationary distribution of quantum stochastic walkers on the classical network defined from Luce’s response probabilities. This work is relevant because (i) we provide a very general framework integrating the positive characteristics of both quantum and classical approaches previously in confrontation, and (ii) we define a cognitive network which can be used to bring other connectivist approaches to decision-making into the quantum stochastic realm. We model the decision-maker as an open system in contact with her surrounding environment, and the time-length of the decision-making process reveals to be also a measure of the process’ degree of interplay between the unitary and irreversible dynamics. Implementing quantum coherence on classical networks may be a door to better integrate human-like reasoning biases in stochastic models for decision-making.

Quantum communication for satellite-to-ground networks with partially entangled states

International Nuclear Information System (INIS)

Chen Na; Quan Dong-Xiao; Pei Chang-Xing; Yang-Hong

2015-01-01

To realize practical wide-area quantum communication, a satellite-to-ground network with partially entangled states is developed in this paper. For efficiency and security reasons, the existing method of quantum communication in distributed wireless quantum networks with partially entangled states cannot be applied directly to the proposed quantum network. Based on this point, an efficient and secure quantum communication scheme with partially entangled states is presented. In our scheme, the source node performs teleportation only after an end-to-end entangled state has been established by entanglement swapping with partially entangled states. Thus, the security of quantum communication is guaranteed. The destination node recovers the transmitted quantum bit with the help of an auxiliary quantum bit and specially defined unitary matrices. Detailed calculations and simulation analyses show that the probability of successfully transferring a quantum bit in the presented scheme is high. In addition, the auxiliary quantum bit provides a heralded mechanism for successful communication. Based on the critical components that are presented in this article an efficient, secure, and practical wide-area quantum communication can be achieved. (paper)

Spin networks, quantum automata and link invariants

International Nuclear Information System (INIS)

Garnerone, Silvano; Marzuoli, Annalisa; Rasetti, Mario

2006-01-01

The spin network simulator model represents a bridge between (generalized) circuit schemes for standard quantum computation and approaches based on notions from Topological Quantum Field Theories (TQFT). More precisely, when working with purely discrete unitary gates, the simulator is naturally modelled as families of quantum automata which in turn represent discrete versions of topological quantum computation models. Such a quantum combinatorial scheme, which essentially encodes SU(2) Racah-Wigner algebra and its braided counterpart, is particularly suitable to address problems in topology and group theory and we discuss here a finite states-quantum automaton able to accept the language of braid group in view of applications to the problem of estimating link polynomials in Chern-Simons field theory

Quantum Measurements: From Bayes Rule to Neural Networks

DEFF Research Database (Denmark)

Greplova, Eliska

2017-01-01

Quantum technologies are becoming more and more introduced into the devices that we use in the daily life, such as quantum dot based television screens or quantum cryptographic channels for encoding financial transactions. Given the limits of the silicon computer chips, it will in the near future...... learning techniques such as artificial neural networks....

Continuous-time quantum walks on multilayer dendrimer networks

Science.gov (United States)

Galiceanu, Mircea; Strunz, Walter T.

2016-08-01

We consider continuous-time quantum walks (CTQWs) on multilayer dendrimer networks (MDs) and their application to quantum transport. A detailed study of properties of CTQWs is presented and transport efficiency is determined in terms of the exact and average return probabilities. The latter depends only on the eigenvalues of the connectivity matrix, which even for very large structures allows a complete analytical solution for this particular choice of network. In the case of MDs we observe an interplay between strong localization effects, due to the dendrimer topology, and good efficiency from the linear segments. We show that quantum transport is enhanced by interconnecting more layers of dendrimers.

Bipartite quantum states and random complex networks

International Nuclear Information System (INIS)

Garnerone, Silvano; Zanardi, Paolo; Giorda, Paolo

2012-01-01

We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of random graphs known as complex networks. In the case of classical random graphs, we derive an analytic expression for the averaged entanglement entropy S-bar while for general complex networks we rely on numerics. For a large number of nodes n we find a scaling S-bar ∼c log n +g e where both the prefactor c and the sub-leading O(1) term g e are characteristic of the different classes of complex networks. In particular, g e encodes topological features of the graphs and is named network topological entropy. Our results suggest that quantum entanglement may provide a powerful tool for the analysis of large complex networks with non-trivial topological properties. (paper)

Neural network decoder for quantum error correcting codes

Science.gov (United States)

Krastanov, Stefan; Jiang, Liang

Artificial neural networks form a family of extremely powerful - albeit still poorly understood - tools used in anything from image and sound recognition through text generation to, in our case, decoding. We present a straightforward Recurrent Neural Network architecture capable of deducing the correcting procedure for a quantum error-correcting code from a set of repeated stabilizer measurements. We discuss the fault-tolerance of our scheme and the cost of training the neural network for a system of a realistic size. Such decoders are especially interesting when applied to codes, like the quantum LDPC codes, that lack known efficient decoding schemes.

Quantum dynamics in transverse-field Ising models from classical networks

Directory of Open Access Journals (Sweden)

Markus Schmitt, Markus Heyl

2018-02-01

Full Text Available The efficient representation of quantum many-body states with classical resources is a key challenge in quantum many-body theory. In this work we analytically construct classical networks for the description of the quantum dynamics in transverse-field Ising models that can be solved efficiently using Monte Carlo techniques. Our perturbative construction encodes time-evolved quantum states of spin-1/2 systems in a network of classical spins with local couplings and can be directly generalized to other spin systems and higher spins. Using this construction we compute the transient dynamics in one, two, and three dimensions including local observables, entanglement production, and Loschmidt amplitudes using Monte Carlo algorithms and demonstrate the accuracy of this approach by comparisons to exact results. We include a mapping to equivalent artificial neural networks, which were recently introduced to provide a universal structure for classical network wave functions.

Efficient multiuser quantum cryptography network based on entanglement.

Science.gov (United States)

Xue, Peng; Wang, Kunkun; Wang, Xiaoping

2017-04-04

We present an efficient quantum key distribution protocol with a certain entangled state to solve a special cryptographic task. Also, we provide a proof of security of this protocol by generalizing the proof of modified of Lo-Chau scheme. Based on this two-user scheme, a quantum cryptography network protocol is proposed without any quantum memory.

77 FR 66823 - Freedom of Information Act Request for Papers Submitted to DARPA for the 2011 100 Year Starship...

Science.gov (United States)

2012-11-07

... DEPARTMENT OF DEFENSE Office of the Secretary Freedom of Information Act Request for Papers... by DARPA under the Freedom of Information Act. DATES: All written correspondence must be received by DARPA by close of business December 7, 2012. ADDRESSES: Send written comments concerning this Freedom of...

Quantum social networks

International Nuclear Information System (INIS)

Cabello, Adán; López-Tarrida, Antonio J; Danielsen, Lars Eirik; Portillo, José R

2012-01-01

We introduce a physical approach to social networks (SNs) in which each actor is characterized by a yes–no test on a physical system. This allows us to consider SNs beyond those originated by interactions based on pre-existing properties, as in a classical SN (CSN). As an example of SNs beyond CSNs, we introduce quantum SNs (QSNs) in which actor i is characterized by a test of whether or not the system is in a quantum state |ψ i 〉. We show that QSNs outperform CSNs for a certain task and some graphs. We identify the simplest of these graphs and show that graphs in which QSNs outperform CSNs are increasingly frequent as the number of vertices increases. We also discuss more general SNs and identify the simplest graphs in which QSNs cannot be outperformed. (paper)

A Quantum Implementation Model for Artificial Neural Networks

Directory of Open Access Journals (Sweden)

Ammar Daskin

2018-02-01

Full Text Available The learning process for multilayered neural networks with many nodes makes heavy demands on computational resources. In some neural network models, the learning formulas, such as the Widrow–Hoff formula, do not change the eigenvectors of the weight matrix while flatting the eigenvalues. In infinity, these iterative formulas result in terms formed by the principal components of the weight matrix, namely, the eigenvectors corresponding to the non-zero eigenvalues. In quantum computing, the phase estimation algorithm is known to provide speedups over the conventional algorithms for the eigenvalue-related problems. Combining the quantum amplitude amplification with the phase estimation algorithm, a quantum implementation model for artificial neural networks using the Widrow–Hoff learning rule is presented. The complexity of the model is found to be linear in the size of the weight matrix. This provides a quadratic improvement over the classical algorithms. Quanta 2018; 7: 7–18.

The quest for a Quantum Neural Network

OpenAIRE

Schuld, M.; Sinayskiy, I.; Petruccione, F.

2014-01-01

With the overwhelming success in the field of quantum information in the last decades, the "quest" for a Quantum Neural Network (QNN) model began in order to combine quantum computing with the striking properties of neural computing. This article presents a systematic approach to QNN research, which so far consists of a conglomeration of ideas and proposals. It outlines the challenge of combining the nonlinear, dissipative dynamics of neural computing and the linear, unitary dynamics of quant...

Continuous-variable Measurement-device-independent Quantum Relay Network with Phase-sensitive Amplifiers

Science.gov (United States)

Li, Fei; Zhao, Wei; Guo, Ying

2018-01-01

Continuous-variable (CV) measurement-device-independent (MDI) quantum cryptography is now heading towards solving the practical problem of implementing scalable quantum networks. In this paper, we show that a solution can come from deploying an optical amplifier in the CV-MDI system, aiming to establish a high-rate quantum network. We suggest an improved CV-MDI protocol using the EPR states coupled with optical amplifiers. It can implement a practical quantum network scheme, where the legal participants create the secret correlations by using EPR states connecting to an untrusted relay via insecure links and applying the multi-entangled Greenberger-Horne-Zeilinger (GHZ) state analysis at relay station. Despite the possibility that the relay could be completely tampered with and imperfect links are subject to the powerful attacks, the legal participants are still able to extract a secret key from network communication. The numerical simulation indicates that the quantum network communication can be achieved in an asymmetric scenario, fulfilling the demands of a practical quantum network. Furthermore, we show that the use of optical amplifiers can compensate the inherent imperfections and improve the secret key rate of the CV-MDI system.

Response to defects in multipartite and bipartite entanglement of isotropic quantum spin networks

Science.gov (United States)

Roy, Sudipto Singha; Dhar, Himadri Shekhar; Rakshit, Debraj; SenDe, Aditi; Sen, Ujjwal

2018-05-01

Quantum networks are an integral component in performing efficient computation and communication tasks that are not accessible using classical systems. A key aspect in designing an effective and scalable quantum network is generating entanglement between its nodes, which is robust against defects in the network. We consider an isotropic quantum network of spin-1/2 particles with a finite fraction of defects, where the corresponding wave function of the network is rotationally invariant under the action of local unitaries. By using quantum information-theoretic concepts like strong subadditivity of von Neumann entropy and approximate quantum telecloning, we prove analytically that in the presence of defects, caused by loss of a finite fraction of spins, the network, composed of a fixed numbers of lattice sites, sustains genuine multisite entanglement and at the same time may exhibit finite moderate-range bipartite entanglement, in contrast to the network with no defects.

Quantum Effects in Inverse Opal Structures

Science.gov (United States)

Bleiweiss, Michael; Datta, Timir; Lungu, Anca; Yin, Ming; Iqbal, Zafar; Palm, Eric; Brandt, Bruce

2002-03-01

Properties of bismuth inverse opals and carbon opal replicas were studied. The bismuth nanostructures were fabricated by pressure infiltration into porous artificial opal, while the carbon opal replicas were created via CVD. These structures form a regular three-dimensional network in which the bismuth and carbon regions percolate in all directions between the close packed spheres of SiO_2. The sizes of the conducting regions are of the order of tens of nanometers. Static susceptibility of the bismuth inverse opal showed clear deHaas-vanAlphen oscillations. Transport measurements, including Hall, were done using standard ac four and six probe techniques in fields up to 17 T* and temperatures between 4.2 and 200 K. Observations of Shubnikov-deHaas oscillations in magnetoresistance, one-dimensional weak localization, quantum Hall and other effects will be discussed. *Performed at the National High Magnetic Field Lab (NHMFL) FSU, Tallahassee, FL. This work was partially supported by grants from DARPA-nanothermoelectrics, NASA-EPSCOR and the USC nanocenter.

Design and analysis of communication protocols for quantum repeater networks

International Nuclear Information System (INIS)

Jones, Cody; Kim, Danny; Rakher, Matthew T; Ladd, Thaddeus D; Kwiat, Paul G

2016-01-01

We analyze how the performance of a quantum-repeater network depends on the protocol employed to distribute entanglement, and we find that the choice of repeater-to-repeater link protocol has a profound impact on entanglement-distribution rate as a function of hardware parameters. We develop numerical simulations of quantum networks using different protocols, where the repeater hardware is modeled in terms of key performance parameters, such as photon generation rate and collection efficiency. These parameters are motivated by recent experimental demonstrations in quantum dots, trapped ions, and nitrogen-vacancy centers in diamond. We find that a quantum-dot repeater with the newest protocol (‘MidpointSource’) delivers the highest entanglement-distribution rate for typical cases where there is low probability of establishing entanglement per transmission, and in some cases the rate is orders of magnitude higher than other schemes. Our simulation tools can be used to evaluate communication protocols as part of designing a large-scale quantum network. (paper)

Quantum Communication Through a Two-Dimensional Spin Network

International Nuclear Information System (INIS)

Wang Zhaoming; Gu Yongjian

2012-01-01

We investigate the state or entanglement transfer through a two-dimensional spin network. We show that for state transfer, better fidelity can be gained along the diagonal direction but for entanglement transfer, when the initial entanglement is created along the boundary, the concurrence is more inclined to propagate along the boundary. This behavior is produced by quantum mechanical interference and the communication quality depends on the precise size of the network. For some number of sites, the fidelity in a two-dimensional channel is higher than one-dimensional case. This is an important result for realizing quantum communication through high dimension spin chain networks.

Quantum computation over the butterfly network

International Nuclear Information System (INIS)

Soeda, Akihito; Kinjo, Yoshiyuki; Turner, Peter S.; Murao, Mio

2011-01-01

In order to investigate distributed quantum computation under restricted network resources, we introduce a quantum computation task over the butterfly network where both quantum and classical communications are limited. We consider deterministically performing a two-qubit global unitary operation on two unknown inputs given at different nodes, with outputs at two distinct nodes. By using a particular resource setting introduced by M. Hayashi [Phys. Rev. A 76, 040301(R) (2007)], which is capable of performing a swap operation by adding two maximally entangled qubits (ebits) between the two input nodes, we show that unitary operations can be performed without adding any entanglement resource, if and only if the unitary operations are locally unitary equivalent to controlled unitary operations. Our protocol is optimal in the sense that the unitary operations cannot be implemented if we relax the specifications of any of the channels. We also construct protocols for performing controlled traceless unitary operations with a 1-ebit resource and for performing global Clifford operations with a 2-ebit resource.

Complex-network description of thermal quantum states in the Ising spin chain

Science.gov (United States)

Sundar, Bhuvanesh; Valdez, Marc Andrew; Carr, Lincoln D.; Hazzard, Kaden R. A.

2018-05-01

We use network analysis to describe and characterize an archetypal quantum system—an Ising spin chain in a transverse magnetic field. We analyze weighted networks for this quantum system, with link weights given by various measures of spin-spin correlations such as the von Neumann and Rényi mutual information, concurrence, and negativity. We analytically calculate the spin-spin correlations in the system at an arbitrary temperature by mapping the Ising spin chain to fermions, as well as numerically calculate the correlations in the ground state using matrix product state methods, and then analyze the resulting networks using a variety of network measures. We demonstrate that the network measures show some traits of complex networks already in this spin chain, arguably the simplest quantum many-body system. The network measures give insight into the phase diagram not easily captured by more typical quantities, such as the order parameter or correlation length. For example, the network structure varies with transverse field and temperature, and the structure in the quantum critical fan is different from the ordered and disordered phases.

Tensor network states in time-bin quantum optics

Science.gov (United States)

Lubasch, Michael; Valido, Antonio A.; Renema, Jelmer J.; Kolthammer, W. Steven; Jaksch, Dieter; Kim, M. S.; Walmsley, Ian; García-Patrón, Raúl

2018-06-01

The current shift in the quantum optics community towards experiments with many modes and photons necessitates new classical simulation techniques that efficiently encode many-body quantum correlations and go beyond the usual phase-space formulation. To address this pressing demand we formulate linear quantum optics in the language of tensor network states. We extensively analyze the quantum and classical correlations of time-bin interference in a single fiber loop. We then generalize our results to more complex time-bin quantum setups and identify different classes of architectures for high-complexity and low-overhead boson sampling experiments.

Silicon nanophotonics for scalable quantum coherent feedback networks

International Nuclear Information System (INIS)

Sarovar, Mohan; Brif, Constantin; Soh, Daniel B.S.; Cox, Jonathan; DeRose, Christopher T.; Camacho, Ryan; Davids, Paul

2016-01-01

The emergence of coherent quantum feedback control (CQFC) as a new paradigm for precise manipulation of dynamics of complex quantum systems has led to the development of efficient theoretical modeling and simulation tools and opened avenues for new practical implementations. This work explores the applicability of the integrated silicon photonics platform for implementing scalable CQFC networks. If proven successful, on-chip implementations of these networks would provide scalable and efficient nanophotonic components for autonomous quantum information processing devices and ultra-low-power optical processing systems at telecommunications wavelengths. We analyze the strengths of the silicon photonics platform for CQFC applications and identify the key challenges to both the theoretical formalism and experimental implementations. In particular, we determine specific extensions to the theoretical CQFC framework (which was originally developed with bulk-optics implementations in mind), required to make it fully applicable to modeling of linear and nonlinear integrated optics networks. We also report the results of a preliminary experiment that studied the performance of an in situ controllable silicon nanophotonic network of two coupled cavities and analyze the properties of this device using the CQFC formalism. (orig.)

Silicon nanophotonics for scalable quantum coherent feedback networks

Energy Technology Data Exchange (ETDEWEB)

Sarovar, Mohan; Brif, Constantin [Sandia National Laboratories, Livermore, CA (United States); Soh, Daniel B.S. [Sandia National Laboratories, Livermore, CA (United States); Stanford University, Edward L. Ginzton Laboratory, Stanford, CA (United States); Cox, Jonathan; DeRose, Christopher T.; Camacho, Ryan; Davids, Paul [Sandia National Laboratories, Albuquerque, NM (United States)

2016-12-15

The emergence of coherent quantum feedback control (CQFC) as a new paradigm for precise manipulation of dynamics of complex quantum systems has led to the development of efficient theoretical modeling and simulation tools and opened avenues for new practical implementations. This work explores the applicability of the integrated silicon photonics platform for implementing scalable CQFC networks. If proven successful, on-chip implementations of these networks would provide scalable and efficient nanophotonic components for autonomous quantum information processing devices and ultra-low-power optical processing systems at telecommunications wavelengths. We analyze the strengths of the silicon photonics platform for CQFC applications and identify the key challenges to both the theoretical formalism and experimental implementations. In particular, we determine specific extensions to the theoretical CQFC framework (which was originally developed with bulk-optics implementations in mind), required to make it fully applicable to modeling of linear and nonlinear integrated optics networks. We also report the results of a preliminary experiment that studied the performance of an in situ controllable silicon nanophotonic network of two coupled cavities and analyze the properties of this device using the CQFC formalism. (orig.)

Toward Designing a Quantum Key Distribution Network Simulation Model

OpenAIRE

Miralem Mehic; Peppino Fazio; Miroslav Voznak; Erik Chromy

2016-01-01

As research in quantum key distribution network technologies grows larger and more complex, the need for highly accurate and scalable simulation technologies becomes important to assess the practical feasibility and foresee difficulties in the practical implementation of theoretical achievements. In this paper, we described the design of simplified simulation environment of the quantum key distribution network with multiple links and nodes. In such simulation environment, we analyzed several ...

Resource-aware system architecture model for implementation of quantum aided Byzantine agreement on quantum repeater networks

Science.gov (United States)

Taherkhani, Mohammand Amin; Navi, Keivan; Van Meter, Rodney

2018-01-01

Quantum aided Byzantine agreement is an important distributed quantum algorithm with unique features in comparison to classical deterministic and randomized algorithms, requiring only a constant expected number of rounds in addition to giving a higher level of security. In this paper, we analyze details of the high level multi-party algorithm, and propose elements of the design for the quantum architecture and circuits required at each node to run the algorithm on a quantum repeater network (QRN). Our optimization techniques have reduced the quantum circuit depth by 44% and the number of qubits in each node by 20% for a minimum five-node setup compared to the design based on the standard arithmetic circuits. These improvements lead to a quantum system architecture with 160 qubits per node, space-time product (an estimate of the required fidelity) {KQ}≈ 1.3× {10}5 per node and error threshold 1.1× {10}-6 for the total nodes in the network. The evaluation of the designed architecture shows that to execute the algorithm once on the minimum setup, we need to successfully distribute a total of 648 Bell pairs across the network, spread evenly between all pairs of nodes. This framework can be considered a starting point for establishing a road-map for light-weight demonstration of a distributed quantum application on QRNs.

A molecular quantum spin network controlled by a single qubit.

Science.gov (United States)

Schlipf, Lukas; Oeckinghaus, Thomas; Xu, Kebiao; Dasari, Durga Bhaktavatsala Rao; Zappe, Andrea; de Oliveira, Felipe Fávaro; Kern, Bastian; Azarkh, Mykhailo; Drescher, Malte; Ternes, Markus; Kern, Klaus; Wrachtrup, Jörg; Finkler, Amit

2017-08-01

Scalable quantum technologies require an unprecedented combination of precision and complexity for designing stable structures of well-controllable quantum systems on the nanoscale. It is a challenging task to find a suitable elementary building block, of which a quantum network can be comprised in a scalable way. We present the working principle of such a basic unit, engineered using molecular chemistry, whose collective control and readout are executed using a nitrogen vacancy (NV) center in diamond. The basic unit we investigate is a synthetic polyproline with electron spins localized on attached molecular side groups separated by a few nanometers. We demonstrate the collective readout and coherent manipulation of very few (≤ 6) of these S = 1/2 electronic spin systems and access their direct dipolar coupling tensor. Our results show that it is feasible to use spin-labeled peptides as a resource for a molecular qubit-based network, while at the same time providing simple optical readout of single quantum states through NV magnetometry. This work lays the foundation for building arbitrary quantum networks using well-established chemistry methods, which has many applications ranging from mapping distances in single molecules to quantum information processing.

Network-based Arbitrated Quantum Signature Scheme with Graph State

Science.gov (United States)

Ma, Hongling; Li, Fei; Mao, Ningyi; Wang, Yijun; Guo, Ying

2017-08-01

Implementing an arbitrated quantum signature(QAS) through complex networks is an interesting cryptography technology in the literature. In this paper, we propose an arbitrated quantum signature for the multi-user-involved networks, whose topological structures are established by the encoded graph state. The determinative transmission of the shared keys, is enabled by the appropriate stabilizers performed on the graph state. The implementation of this scheme depends on the deterministic distribution of the multi-user-shared graph state on which the encoded message can be processed in signing and verifying phases. There are four parties involved, the signatory Alice, the verifier Bob, the arbitrator Trent and Dealer who assists the legal participants in the signature generation and verification. The security is guaranteed by the entanglement of the encoded graph state which is cooperatively prepared by legal participants in complex quantum networks.

Quantum secure direct communication network with superdense coding and decoy photons

International Nuclear Information System (INIS)

Deng Fuguo; Li Xihan; Li Chunyan; Zhou Ping; Zhou Hongyu

2007-01-01

A quantum secure direct communication network scheme is proposed with quantum superdense coding and decoy photons. The servers on a passive optical network prepare and measure the quantum signal, i.e. a sequence of the d-dimensional Bell states. After confirming the security of the photons received from the receiver, the sender codes his secret message on them directly. For preventing a dishonest server from eavesdropping, some decoy photons prepared by measuring one photon in the Bell states are used to replace some original photons. One of the users on the network can communicate to any other one. This scheme has the advantage of high capacity, and it is more convenient than others as only a sequence of photons is transmitted in quantum line

Counterfactual quantum cryptography network with untrusted relay

Science.gov (United States)

Chen, Yuanyuan; Gu, Xuemei; Jiang, Dong; Xie, Ling; Chen, Lijun

2015-07-01

Counterfactual quantum cryptography allows two remote parties to share a secret key even though a physical particle is not in fact transmitted through the quantum channel. In order to extend the scope of counterfactual quantum cryptography, we use an untrusted relay to construct a multi-user network. The implementation issues are discussed to show that the scheme can be realized with current technologies. We also prove the practical security advantages of the scheme by eliminating the probability that an eavesdropper can directly access the signal or an untrusted relay can perform false operations.

Quantum metropolitan optical network based on wavelength division multiplexing.

Science.gov (United States)

Ciurana, A; Martínez-Mateo, J; Peev, M; Poppe, A; Walenta, N; Zbinden, H; Martín, V

2014-01-27

Quantum Key Distribution (QKD) is maturing quickly. However, the current approaches to its application in optical networks make it an expensive technology. QKD networks deployed to date are designed as a collection of point-to-point, dedicated QKD links where non-neighboring nodes communicate using the trusted repeater paradigm. We propose a novel optical network model in which QKD systems share the communication infrastructure by wavelength multiplexing their quantum and classical signals. The routing is done using optical components within a metropolitan area which allows for a dynamically any-to-any communication scheme. Moreover, it resembles a commercial telecom network, takes advantage of existing infrastructure and utilizes commercial components, allowing for an easy, cost-effective and reliable deployment.

Quantifying Complexity in Quantum Phase Transitions via Mutual Information Complex Networks.

Science.gov (United States)

Valdez, Marc Andrew; Jaschke, Daniel; Vargas, David L; Carr, Lincoln D

2017-12-01

We quantify the emergent complexity of quantum states near quantum critical points on regular 1D lattices, via complex network measures based on quantum mutual information as the adjacency matrix, in direct analogy to quantifying the complexity of electroencephalogram or functional magnetic resonance imaging measurements of the brain. Using matrix product state methods, we show that network density, clustering, disparity, and Pearson's correlation obtain the critical point for both quantum Ising and Bose-Hubbard models to a high degree of accuracy in finite-size scaling for three classes of quantum phase transitions, Z_{2}, mean field superfluid to Mott insulator, and a Berzinskii-Kosterlitz-Thouless crossover.

Quantifying Complexity in Quantum Phase Transitions via Mutual Information Complex Networks

Science.gov (United States)

Valdez, Marc Andrew; Jaschke, Daniel; Vargas, David L.; Carr, Lincoln D.

2017-12-01

We quantify the emergent complexity of quantum states near quantum critical points on regular 1D lattices, via complex network measures based on quantum mutual information as the adjacency matrix, in direct analogy to quantifying the complexity of electroencephalogram or functional magnetic resonance imaging measurements of the brain. Using matrix product state methods, we show that network density, clustering, disparity, and Pearson's correlation obtain the critical point for both quantum Ising and Bose-Hubbard models to a high degree of accuracy in finite-size scaling for three classes of quantum phase transitions, Z2, mean field superfluid to Mott insulator, and a Berzinskii-Kosterlitz-Thouless crossover.

Metropolitan all-pass and inter-city quantum communication network.

Science.gov (United States)

Chen, Teng-Yun; Wang, Jian; Liang, Hao; Liu, Wei-Yue; Liu, Yang; Jiang, Xiao; Wang, Yuan; Wan, Xu; Cai, Wei-Qi; Ju, Lei; Chen, Luo-Kan; Wang, Liu-Jun; Gao, Yuan; Chen, Kai; Peng, Cheng-Zhi; Chen, Zeng-Bing; Pan, Jian-Wei

2010-12-20

We have demonstrated a metropolitan all-pass quantum communication network in field fiber for four nodes. Any two nodes of them can be connected in the network to perform quantum key distribution (QKD). An optical switching module is presented that enables arbitrary 2-connectivity among output ports. Integrated QKD terminals are worked out, which can operate either as a transmitter, a receiver, or even both at the same time. Furthermore, an additional link in another city of 60 km fiber (up to 130 km) is seamless integrated into this network based on a trusted relay architecture. On all the links, we have implemented protocol of decoy state scheme. All of necessary electrical hardware, synchronization, feedback control, network software, execution of QKD protocols are made by tailored designing, which allow a completely automatical and stable running. Our system has been put into operation in Hefei in August 2009, and publicly demonstrated during an evaluation conference on quantum network organized by the Chinese Academy of Sciences on August 29, 2009. Real-time voice telephone with one-time pad encoding between any two of the five nodes (four all-pass nodes plus one additional node through relay) is successfully established in the network within 60 km.

Multiple network alignment on quantum computers

Science.gov (United States)

Daskin, Anmer; Grama, Ananth; Kais, Sabre

2014-12-01

Comparative analyses of graph-structured datasets underly diverse problems. Examples of these problems include identification of conserved functional components (biochemical interactions) across species, structural similarity of large biomolecules, and recurring patterns of interactions in social networks. A large class of such analyses methods quantify the topological similarity of nodes across networks. The resulting correspondence of nodes across networks, also called node alignment, can be used to identify invariant subgraphs across the input graphs. Given graphs as input, alignment algorithms use topological information to assign a similarity score to each -tuple of nodes, with elements (nodes) drawn from each of the input graphs. Nodes are considered similar if their neighbors are also similar. An alternate, equivalent view of these network alignment algorithms is to consider the Kronecker product of the input graphs and to identify high-ranked nodes in the Kronecker product graph. Conventional methods such as PageRank and HITS (Hypertext-Induced Topic Selection) can be used for this purpose. These methods typically require computation of the principal eigenvector of a suitably modified Kronecker product matrix of the input graphs. We adopt this alternate view of the problem to address the problem of multiple network alignment. Using the phase estimation algorithm, we show that the multiple network alignment problem can be efficiently solved on quantum computers. We characterize the accuracy and performance of our method and show that it can deliver exponential speedups over conventional (non-quantum) methods.

Quantum Enhanced Inference in Markov Logic Networks.

Science.gov (United States)

Wittek, Peter; Gogolin, Christian

2017-04-19

Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference in MLNs is probabilistic and it is often performed by approximate methods such as Markov chain Monte Carlo (MCMC) Gibbs sampling. An MLN has many regular, symmetric structures that can be exploited at both first-order level and in the generated Markov network. We analyze the graph structures that are produced by various lifting methods and investigate the extent to which quantum protocols can be used to speed up Gibbs sampling with state preparation and measurement schemes. We review different such approaches, discuss their advantages, theoretical limitations, and their appeal to implementations. We find that a straightforward application of a recent result yields exponential speedup compared to classical heuristics in approximate probabilistic inference, thereby demonstrating another example where advanced quantum resources can potentially prove useful in machine learning.

Quantum Enhanced Inference in Markov Logic Networks

Science.gov (United States)

Wittek, Peter; Gogolin, Christian

2017-04-01

Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference in MLNs is probabilistic and it is often performed by approximate methods such as Markov chain Monte Carlo (MCMC) Gibbs sampling. An MLN has many regular, symmetric structures that can be exploited at both first-order level and in the generated Markov network. We analyze the graph structures that are produced by various lifting methods and investigate the extent to which quantum protocols can be used to speed up Gibbs sampling with state preparation and measurement schemes. We review different such approaches, discuss their advantages, theoretical limitations, and their appeal to implementations. We find that a straightforward application of a recent result yields exponential speedup compared to classical heuristics in approximate probabilistic inference, thereby demonstrating another example where advanced quantum resources can potentially prove useful in machine learning.

Quantum Logic Networks for Probabilistic and Controlled Teleportation of Unknown Quantum States

Institute of Scientific and Technical Information of China (English)

GAO Ting

2004-01-01

We present simplification schemes for probabilistic and controlled teleportation of the unknown quantum states of both one particle and two particles and construct efficient quantum logic networks for implementing the new schemes by means of the primitive operations consisting of single-qubit gates, two-qubit controlled-not gates, Von Neumann measurement, and classically controlled operations. In these schemes the teleportation are not always successful but with certain probability.

Quantum Processes and Dynamic Networks in Physical and Biological Systems.

Science.gov (United States)

Dudziak, Martin Joseph

Quantum theory since its earliest formulations in the Copenhagen Interpretation has been difficult to integrate with general relativity and with classical Newtonian physics. There has been traditionally a regard for quantum phenomena as being a limiting case for a natural order that is fundamentally classical except for microscopic extrema where quantum mechanics must be applied, more as a mathematical reconciliation rather than as a description and explanation. Macroscopic sciences including the study of biological neural networks, cellular energy transports and the broad field of non-linear and chaotic systems point to a quantum dimension extending across all scales of measurement and encompassing all of Nature as a fundamentally quantum universe. Theory and observation lead to a number of hypotheses all of which point to dynamic, evolving networks of fundamental or elementary processes as the underlying logico-physical structure (manifestation) in Nature and a strongly quantized dimension to macroscalar processes such as are found in biological, ecological and social systems. The fundamental thesis advanced and presented herein is that quantum phenomena may be the direct consequence of a universe built not from objects and substance but from interacting, interdependent processes collectively operating as sets and networks, giving rise to systems that on microcosmic or macroscopic scales function wholistically and organically, exhibiting non-locality and other non -classical phenomena. The argument is made that such effects as non-locality are not aberrations or departures from the norm but ordinary consequences of the process-network dynamics of Nature. Quantum processes are taken to be the fundamental action-events within Nature; rather than being the exception quantum theory is the rule. The argument is also presented that the study of quantum physics could benefit from the study of selective higher-scale complex systems, such as neural processes in the brain

Recurrent neural network approach to quantum signal: coherent state restoration for continuous-variable quantum key distribution

Science.gov (United States)

Lu, Weizhao; Huang, Chunhui; Hou, Kun; Shi, Liting; Zhao, Huihui; Li, Zhengmei; Qiu, Jianfeng

2018-05-01

In continuous-variable quantum key distribution (CV-QKD), weak signal carrying information transmits from Alice to Bob; during this process it is easily influenced by unknown noise which reduces signal-to-noise ratio, and strongly impacts reliability and stability of the communication. Recurrent quantum neural network (RQNN) is an artificial neural network model which can perform stochastic filtering without any prior knowledge of the signal and noise. In this paper, a modified RQNN algorithm with expectation maximization algorithm is proposed to process the signal in CV-QKD, which follows the basic rule of quantum mechanics. After RQNN, noise power decreases about 15 dBm, coherent signal recognition rate of RQNN is 96%, quantum bit error rate (QBER) drops to 4%, which is 6.9% lower than original QBER, and channel capacity is notably enlarged.

Improved Quantum Artificial Fish Algorithm Application to Distributed Network Considering Distributed Generation.

Science.gov (United States)

Du, Tingsong; Hu, Yang; Ke, Xianting

2015-01-01

An improved quantum artificial fish swarm algorithm (IQAFSA) for solving distributed network programming considering distributed generation is proposed in this work. The IQAFSA based on quantum computing which has exponential acceleration for heuristic algorithm uses quantum bits to code artificial fish and quantum revolving gate, preying behavior, and following behavior and variation of quantum artificial fish to update the artificial fish for searching for optimal value. Then, we apply the proposed new algorithm, the quantum artificial fish swarm algorithm (QAFSA), the basic artificial fish swarm algorithm (BAFSA), and the global edition artificial fish swarm algorithm (GAFSA) to the simulation experiments for some typical test functions, respectively. The simulation results demonstrate that the proposed algorithm can escape from the local extremum effectively and has higher convergence speed and better accuracy. Finally, applying IQAFSA to distributed network problems and the simulation results for 33-bus radial distribution network system show that IQAFSA can get the minimum power loss after comparing with BAFSA, GAFSA, and QAFSA.

Improved Quantum Artificial Fish Algorithm Application to Distributed Network Considering Distributed Generation

Directory of Open Access Journals (Sweden)

Tingsong Du

2015-01-01

Full Text Available An improved quantum artificial fish swarm algorithm (IQAFSA for solving distributed network programming considering distributed generation is proposed in this work. The IQAFSA based on quantum computing which has exponential acceleration for heuristic algorithm uses quantum bits to code artificial fish and quantum revolving gate, preying behavior, and following behavior and variation of quantum artificial fish to update the artificial fish for searching for optimal value. Then, we apply the proposed new algorithm, the quantum artificial fish swarm algorithm (QAFSA, the basic artificial fish swarm algorithm (BAFSA, and the global edition artificial fish swarm algorithm (GAFSA to the simulation experiments for some typical test functions, respectively. The simulation results demonstrate that the proposed algorithm can escape from the local extremum effectively and has higher convergence speed and better accuracy. Finally, applying IQAFSA to distributed network problems and the simulation results for 33-bus radial distribution network system show that IQAFSA can get the minimum power loss after comparing with BAFSA, GAFSA, and QAFSA.

Quantum phase transition of the transverse-field quantum Ising model on scale-free networks.

Science.gov (United States)

Yi, Hangmo

2015-01-01

I investigate the quantum phase transition of the transverse-field quantum Ising model in which nearest neighbors are defined according to the connectivity of scale-free networks. Using a continuous-time quantum Monte Carlo simulation method and the finite-size scaling analysis, I identify the quantum critical point and study its scaling characteristics. For the degree exponent λ=6, I obtain results that are consistent with the mean-field theory. For λ=4.5 and 4, however, the results suggest that the quantum critical point belongs to a non-mean-field universality class. Further simulations indicate that the quantum critical point remains mean-field-like if λ>5, but it continuously deviates from the mean-field theory as λ becomes smaller.

Quantum Bayesian networks with application to games displaying Parrondo's paradox

Science.gov (United States)

Pejic, Michael

Bayesian networks and their accompanying graphical models are widely used for prediction and analysis across many disciplines. We will reformulate these in terms of linear maps. This reformulation will suggest a natural extension, which we will show is equivalent to standard textbook quantum mechanics. Therefore, this extension will be termed quantum. However, the term quantum should not be taken to imply this extension is necessarily only of utility in situations traditionally thought of as in the domain of quantum mechanics. In principle, it may be employed in any modelling situation, say forecasting the weather or the stock market---it is up to experiment to determine if this extension is useful in practice. Even restricting to the domain of quantum mechanics, with this new formulation the advantages of Bayesian networks can be maintained for models incorporating quantum and mixed classical-quantum behavior. The use of these will be illustrated by various basic examples. Parrondo's paradox refers to the situation where two, multi-round games with a fixed winning criteria, both with probability greater than one-half for one player to win, are combined. Using a possibly biased coin to determine the rule to employ for each round, paradoxically, the previously losing player now wins the combined game with probabilitygreater than one-half. Using the extended Bayesian networks, we will formulate and analyze classical observed, classical hidden, and quantum versions of a game that displays this paradox, finding bounds for the discrepancy from naive expectations for the occurrence of the paradox. A quantum paradox inspired by Parrondo's paradox will also be analyzed. We will prove a bound for the discrepancy from naive expectations for this paradox as well. Games involving quantum walks that achieve this bound will be presented.

Topological networks for quantum communication between distant qubits

Science.gov (United States)

Lang, Nicolai; Büchler, Hans Peter

2017-11-01

Efficient communication between qubits relies on robust networks, which allow for fast and coherent transfer of quantum information. It seems natural to harvest the remarkable properties of systems characterized by topological invariants to perform this task. Here, we show that a linear network of coupled bosonic degrees of freedom, characterized by topological bands, can be employed for the efficient exchange of quantum information over large distances. Important features of our setup are that it is robust against quenched disorder, all relevant operations can be performed by global variations of parameters, and the time required for communication between distant qubits approaches linear scaling with their distance. We demonstrate that our concept can be extended to an ensemble of qubits embedded in a two-dimensional network to allow for communication between all of them.

Quantum load balancing in ad hoc networks

Science.gov (United States)

Hasanpour, M.; Shariat, S.; Barnaghi, P.; Hoseinitabatabaei, S. A.; Vahid, S.; Tafazolli, R.

2017-06-01

This paper presents a novel approach in targeting load balancing in ad hoc networks utilizing the properties of quantum game theory. This approach benefits from the instantaneous and information-less capability of entangled particles to synchronize the load balancing strategies in ad hoc networks. The quantum load balancing (QLB) algorithm proposed by this work is implemented on top of OLSR as the baseline routing protocol; its performance is analyzed against the baseline OLSR, and considerable gain is reported regarding some of the main QoS metrics such as delay and jitter. Furthermore, it is shown that QLB algorithm supports a solid stability gain in terms of throughput which stands a proof of concept for the load balancing properties of the proposed theory.

Beam Splitter for Spin Waves in Quantum Spin Network

OpenAIRE

Yang, S.; Song, Z.; Sun, C. P.

2005-01-01

We theoretically design and analytically study a controllable beam splitter for the spin wave propagating in a star-shaped (e.g., a $Y$-shaped beam) spin network. Such a solid state beam splitter can display quantum interference and quantum entanglement by the well-aimed controls of interaction on nodes. It will enable an elementary interferometric device for scalable quantum information processing based on the solid system.

Efficient quantum computation in a network with probabilistic gates and logical encoding

DEFF Research Database (Denmark)

Borregaard, J.; Sørensen, A. S.; Cirac, J. I.

2017-01-01

An approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and nonlocal setting. It combines heralded gates previously studied for atom or atomlike qubits with logical encoding from linear optical quantum computation in order to perform high......-fidelity quantum gates across a quantum network. The error-detecting properties of the heralded operations ensure high fidelity while the encoding makes it possible to correct for failed attempts such that deterministic and high-quality gates can be achieved. Importantly, this is robust to photon loss, which...... is typically the main obstacle to photonic-based quantum information processing. Overall this approach opens a path toward quantum networks with atomic nodes and photonic links....

Maximal qubit violation of n-locality inequalities in a star-shaped quantum network

Science.gov (United States)

Andreoli, Francesco; Carvacho, Gonzalo; Santodonato, Luca; Chaves, Rafael; Sciarrino, Fabio

2017-11-01

Bell's theorem was a cornerstone for our understanding of quantum theory and the establishment of Bell non-locality played a crucial role in the development of quantum information. Recently, its extension to complex networks has been attracting growing attention, but a deep characterization of quantum behavior is still missing for this novel context. In this work we analyze quantum correlations arising in the bilocality scenario, that is a tripartite quantum network where the correlations between the parties are mediated by two independent sources of states. First, we prove that non-bilocal correlations witnessed through a Bell-state measurement in the central node of the network form a subset of those obtainable by means of a local projective measurement. This leads us to derive the maximal violation of the bilocality inequality that can be achieved by arbitrary two-qubit quantum states and arbitrary local projective measurements. We then analyze in details the relation between the violation of the bilocality inequality and the CHSH inequality. Finally, we show how our method can be extended to the n-locality scenario consisting of n two-qubit quantum states distributed among n+1 nodes of a star-shaped network.

Perfect transfer of arbitrary states in quantum spin networks

International Nuclear Information System (INIS)

Christandl, Matthias; Kay, Alastair; Datta, Nilanjana; Dorlas, Tony C.; Ekert, Artur; Landahl, Andrew J.

2005-01-01

We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher-dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2 log 3 N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done by Christandl et al., Phys. Rev. Lett. 92, 187902 (2004)

DARPA Antibody Technology Program. Standardized Test Bed for Antibody Characterization: Characterization of an MS2 ScFv Antibody Produced by Illumina

Science.gov (United States)

2016-08-01

ECBC-TR-1395 DARPA ANTIBODY TECHNOLOGY PROGRAM STANDARDIZED TEST BED FOR... ANTIBODY CHARACTERIZATION: CHARACTERIZATION OF AN MS2 SCFV ANTIBODY PRODUCED BY ILLUMINA Patricia E. Buckley Alena M. Calm Heather Welsh Roy...4. TITLE AND SUBTITLE DARPA Antibody Technology Program Standardized Test Bed for Antibody Characterization: Characterization of an MS2 ScFv

An elementary quantum network using robust nuclear spin qubits in diamond

Science.gov (United States)

Kalb, Norbert; Reiserer, Andreas; Humphreys, Peter; Blok, Machiel; van Bemmelen, Koen; Twitchen, Daniel; Markham, Matthew; Taminiau, Tim; Hanson, Ronald

Quantum registers containing multiple robust qubits can form the nodes of future quantum networks for computation and communication. Information storage within such nodes must be resilient to any type of local operation. Here we demonstrate multiple robust memories by employing five nuclear spins adjacent to a nitrogen-vacancy defect centre in diamond. We characterize the storage of quantum superpositions and their resilience to entangling attempts with the electron spin of the defect centre. The storage fidelity is found to be limited by the probabilistic electron spin reset after failed entangling attempts. Control over multiple memories is then utilized to encode states in decoherence protected subspaces with increased robustness. Furthermore we demonstrate memory control in two optically linked network nodes and characterize the storage capabilities of both memories in terms of the process fidelity with the identity. These results pave the way towards multi-qubit quantum algorithms in a remote network setting.

Hartman effect and nonlocality in quantum networks

International Nuclear Information System (INIS)

Bandopadhyay, Swarnali; Jayannavar, A.M.

2005-01-01

We study the phase time for various quantum mechanical networks having potential barriers in their arms to find the generic presence of Hartman effect. In such systems it is possible to control the 'super arrival' time in one of the arms by changing parameters on another, spatially separated from it. This is yet another quantum nonlocal effect. Negative time delays (time advancement) and 'ultra Hartman effect' with negative saturation times have been observed in some parameter regimes

Toward Designing a Quantum Key Distribution Network Simulation Model

Directory of Open Access Journals (Sweden)

Miralem Mehic

2016-01-01

Full Text Available As research in quantum key distribution network technologies grows larger and more complex, the need for highly accurate and scalable simulation technologies becomes important to assess the practical feasibility and foresee difficulties in the practical implementation of theoretical achievements. In this paper, we described the design of simplified simulation environment of the quantum key distribution network with multiple links and nodes. In such simulation environment, we analyzed several routing protocols in terms of the number of sent routing packets, goodput and Packet Delivery Ratio of data traffic flow using NS-3 simulator.

Nonadditivity of quantum and classical capacities for entanglement breaking multiple-access channels and the butterfly network

International Nuclear Information System (INIS)

Grudka, Andrzej; Horodecki, Pawel

2010-01-01

We analyze quantum network primitives which are entanglement breaking. We show superadditivity of quantum and classical capacity regions for quantum multiple-access channels and the quantum butterfly network. Since the effects are especially visible at high noise they suggest that quantum information effects may be particularly helpful in the case of the networks with occasional high noise rates. The present effects provide a qualitative borderline between superadditivities of bipartite and multipartite systems.

Quantum Google algorithm. Construction and application to complex networks

Science.gov (United States)

Paparo, G. D.; Müller, M.; Comellas, F.; Martin-Delgado, M. A.

2014-07-01

We review the main findings on the ranking capabilities of the recently proposed Quantum PageRank algorithm (G.D. Paparo et al., Sci. Rep. 2, 444 (2012) and G.D. Paparo et al., Sci. Rep. 3, 2773 (2013)) applied to large complex networks. The algorithm has been shown to identify unambiguously the underlying topology of the network and to be capable of clearly highlighting the structure of secondary hubs of networks. Furthermore, it can resolve the degeneracy in importance of the low-lying part of the list of rankings. Examples of applications include real-world instances from the WWW, which typically display a scale-free network structure and models of hierarchical networks. The quantum algorithm has been shown to display an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance among the nodes, as compared to the classical algorithm.

Computing and the electrical transport properties of coupled quantum networks

Science.gov (United States)

Cain, Casey Andrew

In this dissertation a number of investigations were conducted on ballistic quantum networks in the mesoscopic range. In this regime, the wave nature of electron transport under the influence of transverse magnetic fields leads to interesting applications for digital logic and computing circuits. The work specifically looks at characterizing a few main areas that would be of interest to experimentalists who are working in nanostructure devices, and is organized as a series of papers. The first paper analyzes scaling relations and normal mode charge distributions for such circuits in both isolated and open (terminals attached) form. The second paper compares the flux-qubit nature of quantum networks to the well-established spintronics theory. The results found exactly contradict the conventional school of thought for what is required for quantum computation. The third paper investigates the requirements and limitations of extending the Thevenin theorem in classic electric circuits to ballistic quantum transport. The fourth paper outlines the optimal functionally complete set of quantum circuits that can completely satisfy all sixteen Boolean logic operations for two variables.

Information processing by networks of quantum decision makers

Science.gov (United States)

Yukalov, V. I.; Yukalova, E. P.; Sornette, D.

2018-02-01

We suggest a model of a multi-agent society of decision makers taking decisions being based on two criteria, one is the utility of the prospects and the other is the attractiveness of the considered prospects. The model is the generalization of quantum decision theory, developed earlier for single decision makers realizing one-step decisions, in two principal aspects. First, several decision makers are considered simultaneously, who interact with each other through information exchange. Second, a multistep procedure is treated, when the agents exchange information many times. Several decision makers exchanging information and forming their judgment, using quantum rules, form a kind of a quantum information network, where collective decisions develop in time as a result of information exchange. In addition to characterizing collective decisions that arise in human societies, such networks can describe dynamical processes occurring in artificial quantum intelligence composed of several parts or in a cluster of quantum computers. The practical usage of the theory is illustrated on the dynamic disjunction effect for which three quantitative predictions are made: (i) the probabilistic behavior of decision makers at the initial stage of the process is described; (ii) the decrease of the difference between the initial prospect probabilities and the related utility factors is proved; (iii) the existence of a common consensus after multiple exchange of information is predicted. The predicted numerical values are in very good agreement with empirical data.

Performance analysis of quantum access network using code division multiple access model

International Nuclear Information System (INIS)

Hu Linxi; Yang Can; He Guangqiang

2017-01-01

A quantum access network has been implemented by frequency division multiple access and time division multiple access, while code division multiple access is limited for its difficulty to realize the orthogonality of the code. Recently, the chaotic phase shifters were proposed to guarantee the orthogonality by different chaotic signals and spread the spectral content of the quantum states. In this letter, we propose to implement the code division multiple access quantum network by using chaotic phase shifters and synchronization. Due to the orthogonality of the different chaotic phase shifter, every pair of users can faithfully transmit quantum information through a common channel and have little crosstalk between different users. Meanwhile, the broadband spectra of chaotic signals efficiently help the quantum states to defend against channel loss and noise. (paper)

Disorder overtakes order in information concentration over quantum networks

International Nuclear Information System (INIS)

Prabhu, R.; Pradhan, Saurabh; Sen, Aditi; Sen, Ujjwal

2011-01-01

We consider different classes of quenched disordered quantum XY spin chains, including a quantum XY spin glass and a quantum XY model with a random transverse field, and investigate the behavior of genuine multiparty entanglement in the ground states of these models. We find that there are distinct ranges of the disorder parameter that give rise to a higher genuine multiparty entanglement than in the corresponding systems without disorder: an order-from-disorder phenomenon in genuine multiparty entanglement. Moreover, we show that such a disorder-induced advantage in the genuine multiparty entanglement is useful: It is almost certainly accompanied by a order-from-disorder phenomenon for a multiport quantum dense coding capacity with the same ground state used as a multiport quantum network.

Satellite-Relayed Intercontinental Quantum Network.

Science.gov (United States)

Liao, Sheng-Kai; Cai, Wen-Qi; Handsteiner, Johannes; Liu, Bo; Yin, Juan; Zhang, Liang; Rauch, Dominik; Fink, Matthias; Ren, Ji-Gang; Liu, Wei-Yue; Li, Yang; Shen, Qi; Cao, Yuan; Li, Feng-Zhi; Wang, Jian-Feng; Huang, Yong-Mei; Deng, Lei; Xi, Tao; Ma, Lu; Hu, Tai; Li, Li; Liu, Nai-Le; Koidl, Franz; Wang, Peiyuan; Chen, Yu-Ao; Wang, Xiang-Bin; Steindorfer, Michael; Kirchner, Georg; Lu, Chao-Yang; Shu, Rong; Ursin, Rupert; Scheidl, Thomas; Peng, Cheng-Zhi; Wang, Jian-Yu; Zeilinger, Anton; Pan, Jian-Wei

2018-01-19

We perform decoy-state quantum key distribution between a low-Earth-orbit satellite and multiple ground stations located in Xinglong, Nanshan, and Graz, which establish satellite-to-ground secure keys with ∼kHz rate per passage of the satellite Micius over a ground station. The satellite thus establishes a secure key between itself and, say, Xinglong, and another key between itself and, say, Graz. Then, upon request from the ground command, Micius acts as a trusted relay. It performs bitwise exclusive or operations between the two keys and relays the result to one of the ground stations. That way, a secret key is created between China and Europe at locations separated by 7600 km on Earth. These keys are then used for intercontinental quantum-secured communication. This was, on the one hand, the transmission of images in a one-time pad configuration from China to Austria as well as from Austria to China. Also, a video conference was performed between the Austrian Academy of Sciences and the Chinese Academy of Sciences, which also included a 280 km optical ground connection between Xinglong and Beijing. Our work clearly confirms the Micius satellite as a robust platform for quantum key distribution with different ground stations on Earth, and points towards an efficient solution for an ultralong-distance global quantum network.

Satellite-Relayed Intercontinental Quantum Network

Science.gov (United States)

Liao, Sheng-Kai; Cai, Wen-Qi; Handsteiner, Johannes; Liu, Bo; Yin, Juan; Zhang, Liang; Rauch, Dominik; Fink, Matthias; Ren, Ji-Gang; Liu, Wei-Yue; Li, Yang; Shen, Qi; Cao, Yuan; Li, Feng-Zhi; Wang, Jian-Feng; Huang, Yong-Mei; Deng, Lei; Xi, Tao; Ma, Lu; Hu, Tai; Li, Li; Liu, Nai-Le; Koidl, Franz; Wang, Peiyuan; Chen, Yu-Ao; Wang, Xiang-Bin; Steindorfer, Michael; Kirchner, Georg; Lu, Chao-Yang; Shu, Rong; Ursin, Rupert; Scheidl, Thomas; Peng, Cheng-Zhi; Wang, Jian-Yu; Zeilinger, Anton; Pan, Jian-Wei

2018-01-01

We perform decoy-state quantum key distribution between a low-Earth-orbit satellite and multiple ground stations located in Xinglong, Nanshan, and Graz, which establish satellite-to-ground secure keys with ˜kHz rate per passage of the satellite Micius over a ground station. The satellite thus establishes a secure key between itself and, say, Xinglong, and another key between itself and, say, Graz. Then, upon request from the ground command, Micius acts as a trusted relay. It performs bitwise exclusive or operations between the two keys and relays the result to one of the ground stations. That way, a secret key is created between China and Europe at locations separated by 7600 km on Earth. These keys are then used for intercontinental quantum-secured communication. This was, on the one hand, the transmission of images in a one-time pad configuration from China to Austria as well as from Austria to China. Also, a video conference was performed between the Austrian Academy of Sciences and the Chinese Academy of Sciences, which also included a 280 km optical ground connection between Xinglong and Beijing. Our work clearly confirms the Micius satellite as a robust platform for quantum key distribution with different ground stations on Earth, and points towards an efficient solution for an ultralong-distance global quantum network.

Pattern-recalling processes in quantum Hopfield networks far from saturation

International Nuclear Information System (INIS)

Inoue, Jun-ichi

2011-01-01

As a mathematical model of associative memories, the Hopfield model was now well-established and a lot of studies to reveal the pattern-recalling process have been done from various different approaches. As well-known, a single neuron is itself an uncertain, noisy unit with a finite unnegligible error in the input-output relation. To model the situation artificially, a kind of 'heat bath' that surrounds neurons is introduced. The heat bath, which is a source of noise, is specified by the 'temperature'. Several studies concerning the pattern-recalling processes of the Hopfield model governed by the Glauber-dynamics at finite temperature were already reported. However, we might extend the 'thermal noise' to the quantum-mechanical variant. In this paper, in terms of the stochastic process of quantum-mechanical Markov chain Monte Carlo method (the quantum MCMC), we analytically derive macroscopically deterministic equations of order parameters such as 'overlap' in a quantum-mechanical variant of the Hopfield neural networks (let us call quantum Hopfield model or quantum Hopfield networks). For the case in which non-extensive number p of patterns are embedded via asymmetric Hebbian connections, namely, p/N → 0 for the number of neuron N → ∞ ('far from saturation'), we evaluate the recalling processes for one of the built-in patterns under the influence of quantum-mechanical noise.

Quantum photonic network and physical layer security.

Science.gov (United States)

Sasaki, Masahide; Endo, Hiroyuki; Fujiwara, Mikio; Kitamura, Mitsuo; Ito, Toshiyuki; Shimizu, Ryosuke; Toyoshima, Morio

2017-08-06

Quantum communication and quantum cryptography are expected to enhance the transmission rate and the security (confidentiality of data transmission), respectively. We study a new scheme which can potentially bridge an intermediate region covered by these two schemes, which is referred to as quantum photonic network. The basic framework is information theoretically secure communications in a free space optical (FSO) wiretap channel, in which an eavesdropper has physically limited access to the main channel between the legitimate sender and receiver. We first review a theoretical framework to quantify the optimal balance of the transmission efficiency and the security level under power constraint and at finite code length. We then present experimental results on channel characterization based on 10 MHz on-off keying transmission in a 7.8 km terrestrial FSO wiretap channel.This article is part of the themed issue 'Quantum technology for the 21st century'. © 2017 The Author(s).

N multipartite GHZ states in quantum networks

Science.gov (United States)

Caprara Vivoli, Valentina; Wehner, Stephanie

Nowadays progress in experimental quantum physics has brought to a significant control on systems like nitrogen-vacancy centres, ion traps, and superconducting qubit clusters. These systems can constitute the key cells of future quantum networks, where tasks like quantum communication at large scale and quantum cryptography can be achieved. It is, though, still not clear which approaches can be used to generate such entanglement at large distances using only local operations on or between at most two adjacent nodes. Here, we analyse three protocols that are able to generate genuine multipartite entanglement between an arbitrary large number of parties. In particular, we focus on the generation of the Greenberger-Horne-Zeilinger state. Moreover, the performances of the three methods are numerically compared in the scenario of a decoherence model both in terms of fidelity and entanglement generation rate. V.C.V. is founded by a NWO Vidi Grant, and S.W. is founded by STW Netherlands.

Compiling gate networks on an Ising quantum computer

International Nuclear Information System (INIS)

Bowdrey, M.D.; Jones, J.A.; Knill, E.; Laflamme, R.

2005-01-01

Here we describe a simple mechanical procedure for compiling a quantum gate network into the natural gates (pulses and delays) for an Ising quantum computer. The aim is not necessarily to generate the most efficient pulse sequence, but rather to develop an efficient compilation algorithm that can be easily implemented in large spin systems. The key observation is that it is not always necessary to refocus all the undesired couplings in a spin system. Instead, the coupling evolution can simply be tracked and then corrected at some later time. Although described within the language of NMR, the algorithm is applicable to any design of quantum computer based on Ising couplings

Pulsed neural networks consisting of single-flux-quantum spiking neurons

International Nuclear Information System (INIS)

Hirose, T.; Asai, T.; Amemiya, Y.

2007-01-01

An inhibitory pulsed neural network was developed for brain-like information processing, by using single-flux-quantum (SFQ) circuits. It consists of spiking neuron devices that are coupled to each other through all-to-all inhibitory connections. The network selects neural activity. The operation of the neural network was confirmed by computer simulation. SFQ neuron devices can imitate the operation of the inhibition phenomenon of neural networks

Complex Chemical Reaction Networks from Heuristics-Aided Quantum Chemistry.

Science.gov (United States)

Rappoport, Dmitrij; Galvin, Cooper J; Zubarev, Dmitry Yu; Aspuru-Guzik, Alán

2014-03-11

While structures and reactivities of many small molecules can be computed efficiently and accurately using quantum chemical methods, heuristic approaches remain essential for modeling complex structures and large-scale chemical systems. Here, we present a heuristics-aided quantum chemical methodology applicable to complex chemical reaction networks such as those arising in cell metabolism and prebiotic chemistry. Chemical heuristics offer an expedient way of traversing high-dimensional reactive potential energy surfaces and are combined here with quantum chemical structure optimizations, which yield the structures and energies of the reaction intermediates and products. Application of heuristics-aided quantum chemical methodology to the formose reaction reproduces the experimentally observed reaction products, major reaction pathways, and autocatalytic cycles.

A Quantum Implementation Model for Artificial Neural Networks

OpenAIRE

Ammar Daskin

2018-01-01

The learning process for multilayered neural networks with many nodes makes heavy demands on computational resources. In some neural network models, the learning formulas, such as the Widrow–Hoff formula, do not change the eigenvectors of the weight matrix while flatting the eigenvalues. In infinity, these iterative formulas result in terms formed by the principal components of the weight matrix, namely, the eigenvectors corresponding to the non-zero eigenvalues. In quantum computing, the pha...

State transfer in highly connected networks and a quantum Babinet principle

Science.gov (United States)

Tsomokos, D. I.; Plenio, M. B.; de Vega, I.; Huelga, S. F.

2008-12-01

The transfer of a quantum state between distant nodes in two-dimensional networks is considered. The fidelity of state transfer is calculated as a function of the number of interactions in networks that are described by regular graphs. It is shown that perfect state transfer is achieved in a network of size N , whose structure is that of an (N/2) -cross polytope graph, if N is a multiple of 4 . The result is reminiscent of the Babinet principle of classical optics. A quantum Babinet principle is derived, which allows for the identification of complementary graphs leading to the same fidelity of state transfer, in analogy with complementary screens providing identical diffraction patterns.

Quantum gravity vacuum and invariants of embedded spin networks

International Nuclear Information System (INIS)

Mikovic, A

2003-01-01

We show that the path integral for the three-dimensional SU(2) BF theory with a Wilson loop or a spin network function inserted can be understood as the Rovelli-Smolin loop transform of a wavefunction in the Ashtekar connection representation, where the wavefunction satisfies the constraints of quantum general relativity with zero cosmological constant. This wavefunction is given as a product of the delta functions of the SU(2) field strength and therefore it can be naturally associated with a flat connection spacetime. The loop transform can be defined rigorously via the quantum SU(2) group, as a spin foam state sum model, so that one obtains invariants of spin networks embedded in a three-manifold. These invariants define a flat connection vacuum state in the q-deformed spin network basis. We then propose a modification of this construction in order to obtain a vacuum state corresponding to the flat metric spacetime

Recoverability in quantum information theory

Science.gov (United States)

Wilde, Mark

The fact that the quantum relative entropy is non-increasing with respect to quantum physical evolutions lies at the core of many optimality theorems in quantum information theory and has applications in other areas of physics. In this work, we establish improvements of this entropy inequality in the form of physically meaningful remainder terms. One of the main results can be summarized informally as follows: if the decrease in quantum relative entropy between two quantum states after a quantum physical evolution is relatively small, then it is possible to perform a recovery operation, such that one can perfectly recover one state while approximately recovering the other. This can be interpreted as quantifying how well one can reverse a quantum physical evolution. Our proof method is elementary, relying on the method of complex interpolation, basic linear algebra, and the recently introduced Renyi generalization of a relative entropy difference. The theorem has a number of applications in quantum information theory, which have to do with providing physically meaningful improvements to many known entropy inequalities. This is based on arXiv:1505.04661, now accepted for publication in Proceedings of the Royal Society A. I acknowledge support from startup funds from the Department of Physics and Astronomy at LSU, the NSF under Award No. CCF-1350397, and the DARPA Quiness Program through US Army Research Office award W31P4Q-12-1-0019.

Quantum Logic Network for Cloning a State Near a Given One Based on Cavity QED

International Nuclear Information System (INIS)

Da-Wei, Zhang; Xiao-Qiang, Shao; Ai-Dong, Zhu

2008-01-01

A quantum logic network is constructed to simulate a cloning machine which copies states near a given one. Meanwhile, a scheme for implementing this cloning network based on the technique of cavity quantum electrodynamics (QED) is presented. It is easy to implement this network of cloning machine in the framework of cavity QED and feasible in the experiment. (general)

Quantum secure direct communication network with Einstein-Podolsky-Rosen pairs

International Nuclear Information System (INIS)

Deng Fuguo; Li Xihan; Li Chunyan; Zhou Ping; Zhou Hongyu

2006-01-01

We discuss the four requirements for a real point-to-point quantum secure direct communication (QSDC) first, and then present two efficient QSDC network schemes with an N ordered Einstein-Podolsky-Rosen pairs. Any one of the authorized users can communicate another one on the network securely and directly

Deterministic Single-Photon Source for Distributed Quantum Networking

International Nuclear Information System (INIS)

Kuhn, Axel; Hennrich, Markus; Rempe, Gerhard

2002-01-01

A sequence of single photons is emitted on demand from a single three-level atom strongly coupled to a high-finesse optical cavity. The photons are generated by an adiabatically driven stimulated Raman transition between two atomic ground states, with the vacuum field of the cavity stimulating one branch of the transition, and laser pulses deterministically driving the other branch. This process is unitary and therefore intrinsically reversible, which is essential for quantum communication and networking, and the photons should be appropriate for all-optical quantum information processing

A cost-effective measurement-device-independent quantum key distribution system for quantum networks

Science.gov (United States)

Valivarthi, Raju; Zhou, Qiang; John, Caleb; Marsili, Francesco; Verma, Varun B.; Shaw, Matthew D.; Nam, Sae Woo; Oblak, Daniel; Tittel, Wolfgang

2017-12-01

We experimentally realize a measurement-device-independent quantum key distribution (MDI-QKD) system. It is based on cost-effective and commercially available hardware such as distributed feedback lasers and field-programmable gate arrays that enable time-bin qubit preparation and time-tagging, and active feedback systems that allow for compensation of time-varying properties of photons after transmission through deployed fiber. We examine the performance of our system, and conclude that its design does not compromise performance. Our demonstration paves the way for MDI-QKD-based quantum networks in star-type topology that extend over more than 100 km distance.

A Quantum Implementation Model for Artificial Neural Networks

OpenAIRE

Daskin, Ammar

2016-01-01

The learning process for multi layered neural networks with many nodes makes heavy demands on computational resources. In some neural network models, the learning formulas, such as the Widrow-Hoff formula, do not change the eigenvectors of the weight matrix while flatting the eigenvalues. In infinity, this iterative formulas result in terms formed by the principal components of the weight matrix: i.e., the eigenvectors corresponding to the non-zero eigenvalues. In quantum computing, the phase...

Secure networking quantum key distribution schemes with Greenberger-Horne-Zeilinger states

Energy Technology Data Exchange (ETDEWEB)

Guo, Ying; Shi, Ronghua [School of Information Science and Engineering, Central South University, Changsha 410083 (China); Zeng, Guihua [Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai 200030 (China)], E-mail: sdguoying@gmail.com, E-mail: rhshi@mail.edu.com, E-mail: ghzeng@sjtu.edu.cn

2010-04-15

A novel approach to quantum cryptography to be called NQKD, networking quantum key distribution, has been developed for secure quantum communication schemes on the basis of the complementary relations of entanglement Greenberger-Horne-Zeilinger (GHZ) triplet states. One scheme distributes the private key among legal participants in a probabilistic manner, while another transmits the deterministic message with some certainty. Some decoy photons are employed for preventing a potential eavesdropper from attacking quantum channels. The present schemes are efficient as there exists an elegant method for key distributions. The security of the proposed schemes is exactly guaranteed by the entanglement of the GHZ quantum system, which is illustrated in security analysis.

Secure networking quantum key distribution schemes with Greenberger-Horne-Zeilinger states

International Nuclear Information System (INIS)

Guo, Ying; Shi, Ronghua; Zeng, Guihua

2010-01-01

A novel approach to quantum cryptography to be called NQKD, networking quantum key distribution, has been developed for secure quantum communication schemes on the basis of the complementary relations of entanglement Greenberger-Horne-Zeilinger (GHZ) triplet states. One scheme distributes the private key among legal participants in a probabilistic manner, while another transmits the deterministic message with some certainty. Some decoy photons are employed for preventing a potential eavesdropper from attacking quantum channels. The present schemes are efficient as there exists an elegant method for key distributions. The security of the proposed schemes is exactly guaranteed by the entanglement of the GHZ quantum system, which is illustrated in security analysis.

Developing a Speaker Identification System for the DARPA RATS Project

DEFF Research Database (Denmark)

Plchot, O; Matsoukas, S; Matejka, P

2013-01-01

This paper describes the speaker identification (SID) system developed by the Patrol team for the first phase of the DARPA RATS (Robust Automatic Transcription of Speech) program, which seeks to advance state of the art detection capabilities on audio from highly degraded communication channels. ...... such as CFCCs out-perform MFCC front-ends on noisy audio, and (c) fusion of multiple systems provides 24% relative improvement in EER compared to the single best system when using a novel SVM-based fusion algorithm that uses side information such as gender, language, and channel id....

Logical spin-filtering in a triangular network of quantum nanorings with a Rashba spin-orbit interaction

Science.gov (United States)

Dehghan, E.; Sanavi Khoshnoud, D.; Naeimi, A. S.

2018-01-01

The spin-resolved electron transport through a triangular network of quantum nanorings is studied in the presence of Rashba spin-orbit interaction (RSOI) and a magnetic flux using quantum waveguide theory. This study illustrates that, by tuning Rashba constant, magnetic flux and incoming electron energy, the triangular network of quantum rings can act as a perfect logical spin-filtering with high efficiency. By changing in the energy of incoming electron, at a proper value of the Rashba constant and magnetic flux, a reverse in the direction of spin can take place in the triangular network of quantum nanorings. Furthermore, the triangular network of quantum nanorings can be designed as a device and shows several simultaneous spintronic properties such as spin-splitter and spin-inverter. This spin-splitting is dependent on the energy of the incoming electron. Additionally, different polarizations can be achieved in the two outgoing leads from an originally incoming spin state that simulates a Stern-Gerlach apparatus.

A new approach to shortest paths on networks based on the quantum bosonic mechanism

Energy Technology Data Exchange (ETDEWEB)

Jiang Xin; Wang Hailong; Tang Shaoting; Ma Lili; Zhang Zhanli; Zheng Zhiming, E-mail: jiangxin@ss.buaa.edu.cn [Key Laboratory of Mathematics, Informatics and Behavioral Semantics, Ministry of Education, Beijing University of Aeronautics and Astronautics, 100191 Beijing (China)

2011-01-15

This paper presents quantum bosonic shortest path searching (QBSPS), a natural, practical and highly heuristic physical algorithm for reasoning about the recognition of network structure via quantum dynamics. QBSPS is based on an Anderson-like itinerant bosonic system in which a boson's Green function is used as a navigation pointer for one to accurately approach the terminals. QBSPS is demonstrated by rigorous mathematical and physical proofs and plenty of simulations, showing how it can be used as a greedy routing to seek the shortest path between different locations. In methodology, it is an interesting and new algorithm rooted in the quantum mechanism other than combinatorics. In practice, for the all-pairs shortest-path problem in a random scale-free network with N vertices, QBSPS runs in O({mu}(N) ln ln N) time. In application, we suggest that the corresponding experimental realizations are feasible by considering path searching in quantum optical communication networks; in this situation, the method performs a pure local search on networks without requiring the global structure that is necessary for current graph algorithms.

Bidirectional Quantum Secure Direct Communication Network Protocol with Hyperentanglement

International Nuclear Information System (INIS)

Gu Bin; Chen Yulin; Huang Yugai; Fang Xia

2011-01-01

We propose a bidirectional quantum secure direct communication (QSDC) network protocol with the hyperentanglment in both the spatial-mode ad the polarization degrees of freedom of photon pairs which can in principle be produced with a beta barium borate crystal. The secret message can be encoded on the photon pairs with unitary operations in these two degrees of freedom independently. Compared with other QSDC network protocols, our QSDC network protocol has a higher capacity as each photon pair can carry 4 bits of information. Also, we discuss the security of our QSDC network protocol and its feasibility with current techniques. (general)

Routing protocol for wireless quantum multi-hop mesh backbone network based on partially entangled GHZ state

Science.gov (United States)

Xiong, Pei-Ying; Yu, Xu-Tao; Zhang, Zai-Chen; Zhan, Hai-Tao; Hua, Jing-Yu

2017-08-01

Quantum multi-hop teleportation is important in the field of quantum communication. In this study, we propose a quantum multi-hop communication model and a quantum routing protocol with multihop teleportation for wireless mesh backbone networks. Based on an analysis of quantum multi-hop protocols, a partially entangled Greenberger-Horne-Zeilinger (GHZ) state is selected as the quantum channel for the proposed protocol. Both quantum and classical wireless channels exist between two neighboring nodes along the route. With the proposed routing protocol, quantum information can be transmitted hop by hop from the source node to the destination node. Based on multi-hop teleportation based on the partially entangled GHZ state, a quantum route established with the minimum number of hops. The difference between our routing protocol and the classical one is that in the former, the processes used to find a quantum route and establish quantum channel entanglement occur simultaneously. The Bell state measurement results of each hop are piggybacked to quantum route finding information. This method reduces the total number of packets and the magnitude of air interface delay. The deduction of the establishment of a quantum channel between source and destination is also presented here. The final success probability of quantum multi-hop teleportation in wireless mesh backbone networks was simulated and analyzed. Our research shows that quantum multi-hop teleportation in wireless mesh backbone networks through a partially entangled GHZ state is feasible.

Controllable quantum information network with a superconducting system

International Nuclear Information System (INIS)

Zhang, Feng-yang; Liu, Bao; Chen, Zi-hong; Wu, Song-lin; Song, He-shan

2014-01-01

We propose a controllable and scalable architecture for quantum information processing using a superconducting system network, which is composed of current-biased Josephson junctions (CBJJs) as tunable couplers between the two superconducting transmission line resonators (TLRs), each coupling to multiple superconducting qubits (SQs). We explicitly demonstrate that the entangled state, the phase gate, and the information transfer between any two selected SQs can be implemented, respectively. Lastly, numerical simulation shows that our scheme is robust against the decoherence of the system. -- Highlights: •An architecture for quantum information processing is proposed. •The quantum information transfer between any two selected SQs is implemented. •This proposal is robust against the decoherence of the system. •This architecture can be fabricated on a chip down to the micrometer scale

Field and long-term demonstration of a wide area quantum key distribution network.

Science.gov (United States)

Wang, Shuang; Chen, Wei; Yin, Zhen-Qiang; Li, Hong-Wei; He, De-Yong; Li, Yu-Hu; Zhou, Zheng; Song, Xiao-Tian; Li, Fang-Yi; Wang, Dong; Chen, Hua; Han, Yun-Guang; Huang, Jing-Zheng; Guo, Jun-Fu; Hao, Peng-Lei; Li, Mo; Zhang, Chun-Mei; Liu, Dong; Liang, Wen-Ye; Miao, Chun-Hua; Wu, Ping; Guo, Guang-Can; Han, Zheng-Fu

2014-09-08

A wide area quantum key distribution (QKD) network deployed on communication infrastructures provided by China Mobile Ltd. is demonstrated. Three cities and two metropolitan area QKD networks were linked up to form the Hefei-Chaohu-Wuhu wide area QKD network with over 150 kilometers coverage area, in which Hefei metropolitan area QKD network was a typical full-mesh core network to offer all-to-all interconnections, and Wuhu metropolitan area QKD network was a representative quantum access network with point-to-multipoint configuration. The whole wide area QKD network ran for more than 5000 hours, from 21 December 2011 to 19 July 2012, and part of the network stopped until last December. To adapt to the complex and volatile field environment, the Faraday-Michelson QKD system with several stability measures was adopted when we designed QKD devices. Through standardized design of QKD devices, resolution of symmetry problem of QKD devices, and seamless switching in dynamic QKD network, we realized the effective integration between point-to-point QKD techniques and networking schemes.

Aggregating quantum repeaters for the quantum internet

Science.gov (United States)

Azuma, Koji; Kato, Go

2017-09-01

The quantum internet holds promise for accomplishing quantum teleportation and unconditionally secure communication freely between arbitrary clients all over the globe, as well as the simulation of quantum many-body systems. For such a quantum internet protocol, a general fundamental upper bound on the obtainable entanglement or secret key has been derived [K. Azuma, A. Mizutani, and H.-K. Lo, Nat. Commun. 7, 13523 (2016), 10.1038/ncomms13523]. Here we consider its converse problem. In particular, we present a universal protocol constructible from any given quantum network, which is based on running quantum repeater schemes in parallel over the network. For arbitrary lossy optical channel networks, our protocol has no scaling gap with the upper bound, even based on existing quantum repeater schemes. In an asymptotic limit, our protocol works as an optimal entanglement or secret-key distribution over any quantum network composed of practical channels such as erasure channels, dephasing channels, bosonic quantum amplifier channels, and lossy optical channels.

Quantum Malware

OpenAIRE

Wu, Lian-Ao; Lidar, Daniel A.

2005-01-01

When quantum communication networks proliferate they will likely be subject to a new type of attack: by hackers, virus makers, and other malicious intruders. Here we introduce the concept of "quantum malware" to describe such human-made intrusions. We offer a simple solution for storage of quantum information in a manner which protects quantum networks from quantum malware. This solution involves swapping the quantum information at random times between the network and isolated, distributed an...

Tactile Gloves for Autonomous Grasping With the NASA/DARPA Robonaut

Science.gov (United States)

Martin, T. B.; Ambrose, R. O.; Diftler, M. A.; Platt, R., Jr.; Butzer, M. J.

2004-01-01

Tactile data from rugged gloves are providing the foundation for developing autonomous grasping skills for the NASA/DARPA Robonaut, a dexterous humanoid robot. These custom gloves compliment the human like dexterity available in the Robonaut hands. Multiple versions of the gloves are discussed, showing a progression in using advanced materials and construction techniques to enhance sensitivity and overall sensor coverage. The force data provided by the gloves can be used to improve dexterous, tool and power grasping primitives. Experiments with the latest gloves focus on the use of tools, specifically a power drill used to approximate an astronaut's torque tool.

Quantum breathers in small networks: dynamics, tunneling, correlations, and application to Josephson cells

International Nuclear Information System (INIS)

Pinto Rengifo, Ricardo Alberto

2008-02-01

We address the excitation of quantum breathers in small nonlinear networks of two and three degrees of freedom, in order to study their properties. The invariance under permutation of two sites of these networks substitutes the translation invariance that is present in nonlinear lattices, where (classical) discrete breathers are time periodic space localized solutions of the underlying classical equations of motion. We do a systematic analysis of the spectrum and eigenstates of such small systems, characterizing quantum breather states by their tunneling rate (energy splitting), site correlations, fluctuations of the number of quanta, and entanglement. We observe how these properties are reflected in the time evolution of initially localized excitations. Quantum breathers manifest as pairs of nearly degenerate eigenstates that show strong site correlation of quanta, and are characterized by a strong excitation of quanta on one site of the network which perform slow coherent tunneling motion from one site to another. They enhance the fluctuations of quanta, and are the least entangled states among the group of eigenstates in the same range of the energy spectrum. We use our analysis methods to consider the excitation of quantum breathers in a cell of two coupled Josephson junctions, and study their properties as compared with those in the previous cases. We describe how quantum breathers could be experimentally observed by employing the already developed techniques for quantum information processing with Josephson junctions. (orig.)

Quantum breathers in small networks: dynamics, tunneling, correlations, and application to Josephson cells

Energy Technology Data Exchange (ETDEWEB)

Pinto Rengifo, Ricardo Alberto

2008-02-15

We address the excitation of quantum breathers in small nonlinear networks of two and three degrees of freedom, in order to study their properties. The invariance under permutation of two sites of these networks substitutes the translation invariance that is present in nonlinear lattices, where (classical) discrete breathers are time periodic space localized solutions of the underlying classical equations of motion. We do a systematic analysis of the spectrum and eigenstates of such small systems, characterizing quantum breather states by their tunneling rate (energy splitting), site correlations, fluctuations of the number of quanta, and entanglement. We observe how these properties are reflected in the time evolution of initially localized excitations. Quantum breathers manifest as pairs of nearly degenerate eigenstates that show strong site correlation of quanta, and are characterized by a strong excitation of quanta on one site of the network which perform slow coherent tunneling motion from one site to another. They enhance the fluctuations of quanta, and are the least entangled states among the group of eigenstates in the same range of the energy spectrum. We use our analysis methods to consider the excitation of quantum breathers in a cell of two coupled Josephson junctions, and study their properties as compared with those in the previous cases. We describe how quantum breathers could be experimentally observed by employing the already developed techniques for quantum information processing with Josephson junctions. (orig.)

Nonreciprocal signal routing in an active quantum network

Science.gov (United States)

Metelmann, A.; Türeci, H. E.

2018-04-01

As superconductor quantum technologies are moving towards large-scale integrated circuits, a robust and flexible approach to routing photons at the quantum level becomes a critical problem. Active circuits, which contain parametrically driven elements selectively embedded in the circuit, offer a viable solution. Here, we present a general strategy for routing nonreciprocally quantum signals between two sites of a given lattice of oscillators, implementable with existing superconducting circuit components. Our approach makes use of a dual lattice of overdamped oscillators linking the nodes of the main lattice. Solutions for spatially selective driving of the lattice elements can be found, which optimally balance coherent and dissipative hopping of microwave photons to nonreciprocally route signals between two given nodes. In certain lattices these optimal solutions are obtained at the exceptional point of the dynamical matrix of the network. We also demonstrate that signal and noise transmission characteristics can be separately optimized.

Trapped-ion quantum simulation of excitation transport: Disordered, noisy, and long-range connected quantum networks

Science.gov (United States)

Trautmann, N.; Hauke, P.

2018-02-01

The transport of excitations governs fundamental properties of matter. Particularly rich physics emerges in the interplay between disorder and environmental noise, even in small systems such as photosynthetic biomolecules. Counterintuitively, noise can enhance coherent quantum transport, which has been proposed as a mechanism behind the high transport efficiencies observed in photosynthetic complexes. This effect has been called "environment-assisted quantum transport". Here, we propose a quantum simulation of the excitation transport in an open quantum network, taking advantage of the high controllability of current trapped-ion experiments. Our scheme allows for the controlled study of various different aspects of the excitation transfer, ranging from the influence of static disorder and interaction range, over the effect of Markovian and non-Markovian dephasing, to the impact of a continuous insertion of excitations. Our paper discusses experimental error sources and realistic parameters, showing that it can be implemented in state-of-the-art ion-chain experiments.

Consideration of analogies between magnetic and quantum notices for molecular network

Directory of Open Access Journals (Sweden)

Piech Henryk

2018-01-01

Full Text Available Magnetic properties of spin glass materials [9,13] are close to quantum interpretation in their nature description [17]. Therefore, we can look for possible kinds of analogies in process of defining theoretic and practice conventions, rules and applications of the specific characteristics in elaboration quantum calculation strategies. We have not investigated possibilities to create directly quantum calculation units and practice calculation structures like qubits, registers, gates etc. [4,18], but dealing with spin and quantum definitions and descriptions we can try to involve these notices from different domains. Such a pragmatic approach only intuitively gives chances to create the transition theory and implement it even partially. Obviously, almost all of us have heard about quantum factorization, cryptography or teleportation but it is obtained as a result of exploration casually selected quantum properties and adapting them to mathematic problems. In our approach, we carefully investigate involutions among spin and quantum nature looking at possible implementation in molecular network.

Entanglement routers via a wireless quantum network based on arbitrary two qubit systems

International Nuclear Information System (INIS)

Metwally, N

2014-01-01

A wireless quantum network is generated between multi-hops, where each hop consists of two entangled nodes. These nodes share a finite number of entangled two-qubit systems randomly. Different types of wireless quantum bridges (WQBS) are generated between the non-connected nodes. The efficiency of these WQBS to be used as quantum channels between its terminals to perform quantum teleportation is investigated. We suggest a theoretical wireless quantum communication protocol to teleport unknown quantum signals from one node to another, where the more powerful WQBS are used as quantum channels. It is shown that, by increasing the efficiency of the sources that emit the initial partial entangled states, one can increase the efficiency of the wireless quantum communication protocol. (paper)

WPG-Controlled Quantum BDD Circuits with BDD Architecture on GaAs-Based Hexagonal Nanowire Network Structure

Directory of Open Access Journals (Sweden)

Hong-Quan ZHao

2012-01-01

Full Text Available One-dimensional nanowire quantum devices and basic quantum logic AND and OR unit on hexagonal nanowire units controlled by wrap gate (WPG were designed and fabricated on GaAs-based one-dimensional electron gas (1-DEG regular nanowire network with hexagonal topology. These basic quantum logic units worked correctly at 35 K, and clear quantum conductance was achieved on the node device, logic AND circuit unit, and logic OR circuit unit. Binary-decision-diagram- (BDD- based arithmetic logic unit (ALU is realized on GaAs-based regular nanowire network with hexagonal topology by the same fabrication method as that of the quantum devices and basic circuits. This BDD-based ALU circuit worked correctly at room temperature. Since these quantum devices and circuits are basic units of the BDD ALU combinational circuit, the possibility of integrating these quantum devices and basic quantum circuits into the BDD-based quantum circuit with more complicated structures was discussed. We are prospecting the realization of quantum BDD combinational circuitries with very small of energy consumption and very high density of integration.

Optimal and secure measurement protocols for quantum sensor networks

Science.gov (United States)

Eldredge, Zachary; Foss-Feig, Michael; Gross, Jonathan A.; Rolston, S. L.; Gorshkov, Alexey V.

2018-04-01

Studies of quantum metrology have shown that the use of many-body entangled states can lead to an enhancement in sensitivity when compared with unentangled states. In this paper, we quantify the metrological advantage of entanglement in a setting where the measured quantity is a linear function of parameters individually coupled to each qubit. We first generalize the Heisenberg limit to the measurement of nonlocal observables in a quantum network, deriving a bound based on the multiparameter quantum Fisher information. We then propose measurement protocols that can make use of Greenberger-Horne-Zeilinger (GHZ) states or spin-squeezed states and show that in the case of GHZ states the protocol is optimal, i.e., it saturates our bound. We also identify nanoscale magnetic resonance imaging as a promising setting for this technology.

The SECOQC quantum key distribution network in Vienna

International Nuclear Information System (INIS)

Peev, M; Pacher, C; Boxleitner, W; Happe, A; Hasani, Y; Alleaume, R; Diamanti, E; Barreiro, C; Fasel, S; Gautier, J-D; Gisin, N; Bouda, J; Debuisschert, T; Fossier, S; Dianati, M; Dynes, J F; Fuerst, M; Gay, O; Grangier, P; Hentschel, M

2009-01-01

In this paper, we present the quantum key distribution (QKD) network designed and implemented by the European project SEcure COmmunication based on Quantum Cryptography (SECOQC) (2004-2008), unifying the efforts of 41 research and industrial organizations. The paper summarizes the SECOQC approach to QKD networks with a focus on the trusted repeater paradigm. It discusses the architecture and functionality of the SECOQC trusted repeater prototype, which has been put into operation in Vienna in 2008 and publicly demonstrated in the framework of a SECOQC QKD conference held from October 8 to 10, 2008. The demonstration involved one-time pad encrypted telephone communication, a secure (AES encryption protected) video-conference with all deployed nodes and a number of rerouting experiments, highlighting basic mechanisms of the SECOQC network functionality. The paper gives an overview of the eight point-to-point network links in the prototype and their underlying technology: three plug and play systems by id Quantique, a one way weak pulse system from Toshiba Research in the UK, a coherent one-way system by GAP Optique with the participation of id Quantique and the AIT Austrian Institute of Technology (formerly ARC ), an entangled photons system by University of Vienna and the AIT, a continuous-variables system by Centre National de la Recherche Scientifique (CNRS) and THALES Research and Technology with the participation of Universite Libre de Bruxelles, and a free space link by the Ludwig Maximillians University in Munich connecting two nodes situated in adjacent buildings (line of sight 80 m). The average link length is between 20 and 30 km, the longest link being 83 km. The paper presents the architecture and functionality of the principal networking agent-the SECOQC node module, which enables the authentic classical communication required for key distillation, manages the generated key material, determines a communication path between any destinations in the network

Prior entanglement between senders enables perfect quantum network coding with modification

International Nuclear Information System (INIS)

Hayashi, Masahito

2007-01-01

We find a protocol transmitting two quantum states crossly in the butterfly network only with prior entanglement between two senders. This protocol requires only one qubit transmission or two classical bits (cbits) transmission in each channel in the butterfly network. It is also proved that it is impossible without prior entanglement. More precisely, an upper bound of average fidelity is given in the butterfly network when prior entanglement is not allowed. The presented result concerns only the butterfly network, but our techniques can be applied to a more general graph

Real-Coded Quantum-Inspired Genetic Algorithm-Based BP Neural Network Algorithm

Directory of Open Access Journals (Sweden)

Jianyong Liu

2015-01-01

Full Text Available The method that the real-coded quantum-inspired genetic algorithm (RQGA used to optimize the weights and threshold of BP neural network is proposed to overcome the defect that the gradient descent method makes the algorithm easily fall into local optimal value in the learning process. Quantum genetic algorithm (QGA is with good directional global optimization ability, but the conventional QGA is based on binary coding; the speed of calculation is reduced by the coding and decoding processes. So, RQGA is introduced to explore the search space, and the improved varied learning rate is adopted to train the BP neural network. Simulation test shows that the proposed algorithm is effective to rapidly converge to the solution conformed to constraint conditions.

Free-Space Quantum Communication with a Portable Quantum Memory

Science.gov (United States)

Namazi, Mehdi; Vallone, Giuseppe; Jordaan, Bertus; Goham, Connor; Shahrokhshahi, Reihaneh; Villoresi, Paolo; Figueroa, Eden

2017-12-01

The realization of an elementary quantum network that is intrinsically secure and operates over long distances requires the interconnection of several quantum modules performing different tasks. In this work, we report the realization of a communication network functioning in a quantum regime, consisting of four different quantum modules: (i) a random polarization qubit generator, (ii) a free-space quantum-communication channel, (iii) an ultralow-noise portable quantum memory, and (iv) a qubit decoder, in a functional elementary quantum network possessing all capabilities needed for quantum-information distribution protocols. We create weak coherent pulses at the single-photon level encoding polarization states |H ⟩ , |V ⟩, |D ⟩, and |A ⟩ in a randomized sequence. The random qubits are sent over a free-space link and coupled into a dual-rail room-temperature quantum memory and after storage and retrieval are analyzed in a four-detector polarization analysis akin to the requirements of the BB84 protocol. We also show ultralow noise and fully portable operation, paving the way towards memory-assisted all-environment free-space quantum cryptographic networks.

Combining Topological Hardware and Topological Software: Color-Code Quantum Computing with Topological Superconductor Networks

Science.gov (United States)

Litinski, Daniel; Kesselring, Markus S.; Eisert, Jens; von Oppen, Felix

2017-07-01

We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes and topological color codes for error correction. Color codes have a set of transversal gates which coincides with the set of topologically protected gates in Majorana-based systems, namely, the Clifford gates. In this way, we establish color codes as providing a natural setting in which advantages offered by topological hardware can be combined with those arising from topological error-correcting software for full-fledged fault-tolerant quantum computing. We provide a complete description of our architecture, including the underlying physical ingredients. We start by showing that in topological superconductor networks, hexagonal cells can be employed to serve as physical qubits for universal quantum computation, and we present protocols for realizing topologically protected Clifford gates. These hexagonal-cell qubits allow for a direct implementation of open-boundary color codes with ancilla-free syndrome read-out and logical T gates via magic-state distillation. For concreteness, we describe how the necessary operations can be implemented using networks of Majorana Cooper pair boxes, and we give a feasibility estimate for error correction in this architecture. Our approach is motivated by nanowire-based networks of topological superconductors, but it could also be realized in alternative settings such as quantum-Hall-superconductor hybrids.

Combining Topological Hardware and Topological Software: Color-Code Quantum Computing with Topological Superconductor Networks

Directory of Open Access Journals (Sweden)

Daniel Litinski

2017-09-01

Full Text Available We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes and topological color codes for error correction. Color codes have a set of transversal gates which coincides with the set of topologically protected gates in Majorana-based systems, namely, the Clifford gates. In this way, we establish color codes as providing a natural setting in which advantages offered by topological hardware can be combined with those arising from topological error-correcting software for full-fledged fault-tolerant quantum computing. We provide a complete description of our architecture, including the underlying physical ingredients. We start by showing that in topological superconductor networks, hexagonal cells can be employed to serve as physical qubits for universal quantum computation, and we present protocols for realizing topologically protected Clifford gates. These hexagonal-cell qubits allow for a direct implementation of open-boundary color codes with ancilla-free syndrome read-out and logical T gates via magic-state distillation. For concreteness, we describe how the necessary operations can be implemented using networks of Majorana Cooper pair boxes, and we give a feasibility estimate for error correction in this architecture. Our approach is motivated by nanowire-based networks of topological superconductors, but it could also be realized in alternative settings such as quantum-Hall–superconductor hybrids.

Squeezed light in an optical parametric oscillator network with coherent feedback quantum control.

Science.gov (United States)

Crisafulli, Orion; Tezak, Nikolas; Soh, Daniel B S; Armen, Michael A; Mabuchi, Hideo

2013-07-29

We present squeezing and anti-squeezing spectra of the output from a degenerate optical parametric oscillator (OPO) network arranged in different coherent quantum feedback configurations. One OPO serves as a quantum plant, the other as a quantum controller. The addition of coherent feedback enables shaping of the output squeezing spectrum of the plant, and is found to be capable of pushing the frequency of maximum squeezing away from the optical driving frequency and broadening the spectrum over a wider frequency band. The experimental results are in excellent agreement with the developed theory, and illustrate the use of coherent quantum feedback to engineer the quantum-optical properties of the plant OPO output.

Entanglement entropy in the quantum networks of a coupled quantum harmonic oscillator

International Nuclear Information System (INIS)

Jafarizadeh, M A; Nami, S; Eghbalifam, F

2015-01-01

We investigate the entanglement of the ground state in the quantum networks that their nodes are considered as quantum harmonic oscillators. To this aim, the Schmidt numbers and entanglement entropy between two arbitrary partitions of a network are calculated.In partitioning an arbitrary graph into two parts there are some nodes in each part which are not connected to the nodes of the other part. So, these nodes of each part can be in distinct subsets. Therefore, the graph is separated into four subsets. The nodes of the first and last subsets are those which are not connected to the nodes of the other part. In theorem 1, by using the generalized Schur complement method in these four subsets, we prove that all the graphs whose connections between the two alternative subsets are complete, have the same entropy. A large number of graphs satisfy this theorem. Then the entanglement entropy in the limit of the large coupling and large size of the system is investigated in these graphs. Also, the asymptotic behaviors of the Schmidt numbers and entanglement entropy in the limit of infinite coupling are shown.One important quantity about partitioning is the conductance of the graph. The conductance of the graph is considered in various graphs. In these graphs we compare the conductance of the graph and the entanglement entropy. (paper)

Quantum logic networks for controlled teleportation of a single particle via W state

Institute of Scientific and Technical Information of China (English)

Yuan Hong-Chun; Qi Kai-Guo

2005-01-01

We discuss the scheme for probabilistic and controlled teleportation of an unknown state of one particle using the general three-particle W state as the quantum channel. The feature of this scheme is that teleportation between two sides depends on the agreement of the third side (Charlie), who may participate the process of quantum teleportation as a supervisor. In addition, we also construct efficient quantum logic networks for implementing the new scheme by means of the primitive operations.

Implementation of quantum key distribution network simulation module in the network simulator NS-3

Science.gov (United States)

Mehic, Miralem; Maurhart, Oliver; Rass, Stefan; Voznak, Miroslav

2017-10-01

As the research in quantum key distribution (QKD) technology grows larger and becomes more complex, the need for highly accurate and scalable simulation technologies becomes important to assess the practical feasibility and foresee difficulties in the practical implementation of theoretical achievements. Due to the specificity of the QKD link which requires optical and Internet connection between the network nodes, to deploy a complete testbed containing multiple network hosts and links to validate and verify a certain network algorithm or protocol would be very costly. Network simulators in these circumstances save vast amounts of money and time in accomplishing such a task. The simulation environment offers the creation of complex network topologies, a high degree of control and repeatable experiments, which in turn allows researchers to conduct experiments and confirm their results. In this paper, we described the design of the QKD network simulation module which was developed in the network simulator of version 3 (NS-3). The module supports simulation of the QKD network in an overlay mode or in a single TCP/IP mode. Therefore, it can be used to simulate other network technologies regardless of QKD.

Handbook of natural language processing and machine translation DARPA global autonomous language exploitation

CERN Document Server

Olive, Joseph P; McCary, John

2011-01-01

This comprehensive handbook, written by leading experts in the field, details the groundbreaking research conducted under the breakthrough GALE program - The Global Autonomous Language Exploitation within the Defense Advanced Research Projects Agency (DARPA), while placing it in the context of previous research in the fields of natural language and signal processing, artificial intelligence and machine translation. The most fundamental contrast between GALE and its predecessor programs was its holistic integration of previously separate or sequential processes. In earlier language research pro

Quantum Cybernetics and Complex Quantum Systems Science - A Quantum Connectionist Exploration

OpenAIRE

Gonçalves, Carlos Pedro

2014-01-01

Quantum cybernetics and its connections to complex quantum systems science is addressed from the perspective of complex quantum computing systems. In this way, the notion of an autonomous quantum computing system is introduced in regards to quantum artificial intelligence, and applied to quantum artificial neural networks, considered as autonomous quantum computing systems, which leads to a quantum connectionist framework within quantum cybernetics for complex quantum computing systems. Sever...

Quantum and semiclassical spin networks: from atomic and molecular physics to quantum computing and gravity

Science.gov (United States)

Aquilanti, Vincenzo; Bitencourt, Ana Carla P.; Ferreira, Cristiane da S.; Marzuoli, Annalisa; Ragni, Mirco

2008-11-01

The mathematical apparatus of quantum-mechanical angular momentum (re)coupling, developed originally to describe spectroscopic phenomena in atomic, molecular, optical and nuclear physics, is embedded in modern algebraic settings which emphasize the underlying combinatorial aspects. SU(2) recoupling theory, involving Wigner's 3nj symbols, as well as the related problems of their calculations, general properties, asymptotic limits for large entries, nowadays plays a prominent role also in quantum gravity and quantum computing applications. We refer to the ingredients of this theory—and of its extension to other Lie and quantum groups—by using the collective term of 'spin networks'. Recent progress is recorded about the already established connections with the mathematical theory of discrete orthogonal polynomials (the so-called Askey scheme), providing powerful tools based on asymptotic expansions, which correspond on the physical side to various levels of semi-classical limits. These results are useful not only in theoretical molecular physics but also in motivating algorithms for the computationally demanding problems of molecular dynamics and chemical reaction theory, where large angular momenta are typically involved. As for quantum chemistry, applications of these techniques include selection and classification of complete orthogonal basis sets in atomic and molecular problems, either in configuration space (Sturmian orbitals) or in momentum space. In this paper, we list and discuss some aspects of these developments—such as for instance the hyperquantization algorithm—as well as a few applications to quantum gravity and topology, thus providing evidence of a unifying background structure.

Quantum measurement and entanglement of spin quantum bits in diamond

NARCIS (Netherlands)

Pfaff, W.

2013-01-01

This thesis presents a set of experiments that explore the possible realisation of a macroscopic quantum network based on solid-state quantum bits. Such a quantum network would allow for studying quantum mechanics on large scales (meters, or even kilometers), and can open new possibilities for

The SECOQC quantum key distribution network in Vienna

Science.gov (United States)

Peev, M.; Pacher, C.; Alléaume, R.; Barreiro, C.; Bouda, J.; Boxleitner, W.; Debuisschert, T.; Diamanti, E.; Dianati, M.; Dynes, J. F.; Fasel, S.; Fossier, S.; Fürst, M.; Gautier, J.-D.; Gay, O.; Gisin, N.; Grangier, P.; Happe, A.; Hasani, Y.; Hentschel, M.; Hübel, H.; Humer, G.; Länger, T.; Legré, M.; Lieger, R.; Lodewyck, J.; Lorünser, T.; Lütkenhaus, N.; Marhold, A.; Matyus, T.; Maurhart, O.; Monat, L.; Nauerth, S.; Page, J.-B.; Poppe, A.; Querasser, E.; Ribordy, G.; Robyr, S.; Salvail, L.; Sharpe, A. W.; Shields, A. J.; Stucki, D.; Suda, M.; Tamas, C.; Themel, T.; Thew, R. T.; Thoma, Y.; Treiber, A.; Trinkler, P.; Tualle-Brouri, R.; Vannel, F.; Walenta, N.; Weier, H.; Weinfurter, H.; Wimberger, I.; Yuan, Z. L.; Zbinden, H.; Zeilinger, A.

2009-07-01

In this paper, we present the quantum key distribution (QKD) network designed and implemented by the European project SEcure COmmunication based on Quantum Cryptography (SECOQC) (2004-2008), unifying the efforts of 41 research and industrial organizations. The paper summarizes the SECOQC approach to QKD networks with a focus on the trusted repeater paradigm. It discusses the architecture and functionality of the SECOQC trusted repeater prototype, which has been put into operation in Vienna in 2008 and publicly demonstrated in the framework of a SECOQC QKD conference held from October 8 to 10, 2008. The demonstration involved one-time pad encrypted telephone communication, a secure (AES encryption protected) video-conference with all deployed nodes and a number of rerouting experiments, highlighting basic mechanisms of the SECOQC network functionality. The paper gives an overview of the eight point-to-point network links in the prototype and their underlying technology: three plug and play systems by id Quantique, a one way weak pulse system from Toshiba Research in the UK, a coherent one-way system by GAP Optique with the participation of id Quantique and the AIT Austrian Institute of Technology (formerly ARCAustrian Research Centers GmbH—ARC is now operating under the new name AIT Austrian Institute of Technology GmbH following a restructuring initiative.), an entangled photons system by the University of Vienna and the AIT, a continuous-variables system by Centre National de la Recherche Scientifique (CNRS) and THALES Research and Technology with the participation of Université Libre de Bruxelles, and a free space link by the Ludwig Maximillians University in Munich connecting two nodes situated in adjacent buildings (line of sight 80 m). The average link length is between 20 and 30 km, the longest link being 83 km. The paper presents the architecture and functionality of the principal networking agent—the SECOQC node module, which enables the authentic

Quantum copying and simplification of the quantum Fourier transform

Science.gov (United States)

Niu, Chi-Sheng

Theoretical studies of quantum computation and quantum information theory are presented in this thesis. Three topics are considered: simplification of the quantum Fourier transform in Shor's algorithm, optimal eavesdropping in the BB84 quantum cryptographic protocol, and quantum copying of one qubit. The quantum Fourier transform preceding the final measurement in Shor's algorithm is simplified by replacing a network of quantum gates with one that has fewer and simpler gates controlled by classical signals. This simplification results from an analysis of the network using the consistent history approach to quantum mechanics. The optimal amount of information which an eavesdropper can gain, for a given level of noise in the communication channel, is worked out for the BB84 quantum cryptographic protocol. The optimal eavesdropping strategy is expressed in terms of various quantum networks. A consistent history analysis of these networks using two conjugate quantum bases shows how the information gain in one basis influences the noise level in the conjugate basis. The no-cloning property of quantum systems, which is the physics behind quantum cryptography, is studied by considering copying machines that generate two imperfect copies of one qubit. The best qualities these copies can have are worked out with the help of the Bloch sphere representation for one qubit, and a quantum network is worked out for an optimal copying machine. If the copying machine does not have additional ancillary qubits, the copying process can be viewed using a 2-dimensional subspace in a product space of two qubits. A special representation of such a two-dimensional subspace makes possible a complete characterization of this type of copying. This characterization in turn leads to simplified eavesdropping strategies in the BB84 and the B92 quantum cryptographic protocols.

Stochastic differential equations for quantum dynamics of spin-boson networks

International Nuclear Information System (INIS)

Mandt, Stephan; Sadri, Darius; Houck, Andrew A; Türeci, Hakan E

2015-01-01

A popular approach in quantum optics is to map a master equation to a stochastic differential equation, where quantum effects manifest themselves through noise terms. We generalize this approach based on the positive-P representation to systems involving spin, in particular networks or lattices of interacting spins and bosons. We test our approach on a driven dimer of spins and photons, compare it to the master equation, and predict a novel dynamic phase transition in this system. Our numerical approach has scaling advantages over existing methods, but typically requires regularization in terms of drive and dissipation. (paper)

Unifying neural-network quantum states and correlator product states via tensor networks

Science.gov (United States)

Clark, Stephen R.

2018-04-01

Correlator product states (CPS) are a powerful and very broad class of states for quantum lattice systems whose (unnormalised) amplitudes in a fixed basis can be sampled exactly and efficiently. They work by gluing together states of overlapping clusters of sites on the lattice, called correlators. Recently Carleo and Troyer (2017 Science 355 602) introduced a new type sampleable ansatz called neural-network quantum states (NQS) that are inspired by the restricted Boltzmann model used in machine learning. By employing the formalism of tensor networks we show that NQS are a special form of CPS with novel properties. Diagramatically a number of simple observations become transparent. Namely, that NQS are CPS built from extensively sized GHZ-form correlators making them uniquely unbiased geometrically. The appearance of GHZ correlators also relates NQS to canonical polyadic decompositions of tensors. Another immediate implication of the NQS equivalence to CPS is that we are able to formulate exact NQS representations for a wide range of paradigmatic states, including superpositions of weighed-graph states, the Laughlin state, toric code states, and the resonating valence bond state. These examples reveal the potential of using higher dimensional hidden units and a second hidden layer in NQS. The major outlook of this study is the elevation of NQS to correlator operators allowing them to enhance conventional well-established variational Monte Carlo approaches for strongly correlated fermions.

Quantum Genetics in terms of Quantum Reversible Automata and Quantum Computation of Genetic Codes and Reverse Transcription

CERN Document Server

Baianu,I C

2004-01-01

The concepts of quantum automata and quantum computation are studied in the context of quantum genetics and genetic networks with nonlinear dynamics. In previous publications (Baianu,1971a, b) the formal concept of quantum automaton and quantum computation, respectively, were introduced and their possible implications for genetic processes and metabolic activities in living cells and organisms were considered. This was followed by a report on quantum and abstract, symbolic computation based on the theory of categories, functors and natural transformations (Baianu,1971b; 1977; 1987; 2004; Baianu et al, 2004). The notions of topological semigroup, quantum automaton, or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. Further, detailed studies of nonlinear dynamics in genetic networks were carried out in categories of n-valued, Lukasiewicz Logic Algebra...

SAFETY ON UNTRUSTED NETWORK DEVICES (SOUND)

Science.gov (United States)

2017-10-10

and LSD-41 labs to show how it can work at scale to protect a ship network. 15. SUBJECT TERMS Communities of trust, SAFE architecture, adaptable... environment . Then, SOUND development would extend the SAFE implementation from the CRASH program to allow SAFE hosts to operate in a heterogeneous...hardware level on a SAFE processor (developed under the DARPA CRASH program). This section summarizes our work ; more details can be found in [K+14

A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks.

Science.gov (United States)

Li, Yuhong; Gong, Guanghong; Li, Ni

2018-01-01

In this paper, we propose a novel algorithm-parallel adaptive quantum genetic algorithm-which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes.

A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks

Science.gov (United States)

Li, Yuhong

2018-01-01

In this paper, we propose a novel algorithm—parallel adaptive quantum genetic algorithm—which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes. PMID:29554140

Compact Interconnection Networks Based on Quantum Dots

Science.gov (United States)

Fijany, Amir; Toomarian, Nikzad; Modarress, Katayoon; Spotnitz, Matthew

2003-01-01

Architectures that would exploit the distinct characteristics of quantum-dot cellular automata (QCA) have been proposed for digital communication networks that connect advanced digital computing circuits. In comparison with networks of wires in conventional very-large-scale integrated (VLSI) circuitry, the networks according to the proposed architectures would be more compact. The proposed architectures would make it possible to implement complex interconnection schemes that are required for some advanced parallel-computing algorithms and that are difficult (and in many cases impractical) to implement in VLSI circuitry. The difficulty of implementation in VLSI and the major potential advantage afforded by QCA were described previously in Implementing Permutation Matrices by Use of Quantum Dots (NPO-20801), NASA Tech Briefs, Vol. 25, No. 10 (October 2001), page 42. To recapitulate: Wherever two wires in a conventional VLSI circuit cross each other and are required not to be in electrical contact with each other, there must be a layer of electrical insulation between them. This, in turn, makes it necessary to resort to a noncoplanar and possibly a multilayer design, which can be complex, expensive, and even impractical. As a result, much of the cost of designing VLSI circuits is associated with minimization of data routing and assignment of layers to minimize crossing of wires. Heretofore, these considerations have impeded the development of VLSI circuitry to implement complex, advanced interconnection schemes. On the other hand, with suitable design and under suitable operating conditions, QCA-based signal paths can be allowed to cross each other in the same plane without adverse effect. In principle, this characteristic could be exploited to design compact, coplanar, simple (relative to VLSI) QCA-based networks to implement complex, advanced interconnection schemes. The proposed architectures require two advances in QCA-based circuitry beyond basic QCA-based binary

A quantum logic network for implementing optimal symmetric universal and phase-covariant telecloning of a bipartite entangled state

International Nuclear Information System (INIS)

Meng Fanyu; Zhu Aidong

2008-01-01

A quantum logic network to implement quantum telecloning is presented in this paper. The network includes two parts: the first part is used to create the telecloning channel and the second part to teleport the state. It can be used not only to implement universal telecloning for a bipartite entangled state which is completely unknown, but also to implement the phase-covariant telecloning for one that is partially known. Furthermore, the network can also be used to construct a tele-triplicator. It can easily be implemented in experiment because only single- and two-qubit operations are used in the network.

Scheme for teleporting an unknown atomic state to any node in a quantum communication network

Institute of Scientific and Technical Information of China (English)

宋克慧; 张为俊; 郭光灿

2002-01-01

We propose a scheme for teleporting an unknown atomic state. In order to realize the teleportation to any node ina quantum communication network, an n-atom Greenberger-Horne-Zeilinger (GHZ) state is needed, which is utilizedas the quantum channel. From this n-atom GHZ state, two-node entanglement of processing and receiving teleportedstates can be obtained through the quantum logic gate manipulation. Finally, for the unequally weighted GHZ state,probabilistic teleportation is shown.

Combining neural networks and signed particles to simulate quantum systems more efficiently

Science.gov (United States)

Sellier, Jean Michel

2018-04-01

Recently a new formulation of quantum mechanics has been suggested which describes systems by means of ensembles of classical particles provided with a sign. This novel approach mainly consists of two steps: the computation of the Wigner kernel, a multi-dimensional function describing the effects of the potential over the system, and the field-less evolution of the particles which eventually create new signed particles in the process. Although this method has proved to be extremely advantageous in terms of computational resources - as a matter of fact it is able to simulate in a time-dependent fashion many-body systems on relatively small machines - the Wigner kernel can represent the bottleneck of simulations of certain systems. Moreover, storing the kernel can be another issue as the amount of memory needed is cursed by the dimensionality of the system. In this work, we introduce a new technique which drastically reduces the computation time and memory requirement to simulate time-dependent quantum systems which is based on the use of an appropriately tailored neural network combined with the signed particle formalism. In particular, the suggested neural network is able to compute efficiently and reliably the Wigner kernel without any training as its entire set of weights and biases is specified by analytical formulas. As a consequence, the amount of memory for quantum simulations radically drops since the kernel does not need to be stored anymore as it is now computed by the neural network itself, only on the cells of the (discretized) phase-space which are occupied by particles. As its is clearly shown in the final part of this paper, not only this novel approach drastically reduces the computational time, it also remains accurate. The author believes this work opens the way towards effective design of quantum devices, with incredible practical implications.

Quantum Logic Networks for Probabilistic Teleportation of an Arbitrary Three-Particle State

Institute of Scientific and Technical Information of China (English)

QIAN Xue-Min; FANG Jian-Xing; ZHU Shi-Qun; XI Yong-Jun

2005-01-01

The scheme for probabilistic teleportation of an arbitrary three-particle state is proposed. By using single qubit gate and three two-qubit gates, efficient quantum logic networks for probabilistic teleportation of an arbitrary three-particle state are constructed.

Quantum communication network utilizing quadripartite entangled states of optical field

International Nuclear Information System (INIS)

Shen Heng; Su Xiaolong; Jia Xiaojun; Xie Changde

2009-01-01

We propose two types of quantum dense coding communication networks with optical continuous variables, in which a quadripartite entangled state of the optical field with totally three-party correlations of quadrature amplitudes is utilized. In the networks, the exchange of information between any two participants can be manipulated by one or two of the remaining participants. The channel capacities for a variety of communication protocols are numerically calculated. Due to the fact that the quadripartite entangled states applied in the communication systems have been successfully prepared already in the laboratory, the proposed schemes are experimentally accessible at present.

Quantum Graphical Models and Belief Propagation

International Nuclear Information System (INIS)

Leifer, M.S.; Poulin, D.

2008-01-01

Belief Propagation algorithms acting on Graphical Models of classical probability distributions, such as Markov Networks, Factor Graphs and Bayesian Networks, are amongst the most powerful known methods for deriving probabilistic inferences amongst large numbers of random variables. This paper presents a generalization of these concepts and methods to the quantum case, based on the idea that quantum theory can be thought of as a noncommutative, operator-valued, generalization of classical probability theory. Some novel characterizations of quantum conditional independence are derived, and definitions of Quantum n-Bifactor Networks, Markov Networks, Factor Graphs and Bayesian Networks are proposed. The structure of Quantum Markov Networks is investigated and some partial characterization results are obtained, along the lines of the Hammersley-Clifford theorem. A Quantum Belief Propagation algorithm is presented and is shown to converge on 1-Bifactor Networks and Markov Networks when the underlying graph is a tree. The use of Quantum Belief Propagation as a heuristic algorithm in cases where it is not known to converge is discussed. Applications to decoding quantum error correcting codes and to the simulation of many-body quantum systems are described

Neural network approach to modelling the behaviour of quantum tunnelling composites as multifunctional sensors

International Nuclear Information System (INIS)

Lantada, Andrés Díaz; Morgado, Pilar Lafont; Otero, Javier Echavarri; Munoz-Guijosa, Juan Manuel; Sanz, José Luis Muñoz

2010-01-01

Quantum tunnelling composites, or 'QTCs', are composites with an elastomeric polymer matrix and a metal particle filling (usually nickel). At rest, these metal particles do not touch each other and the polymer acts as an insulator. When the material is suitably deformed, however, the particles come together (without actually touching) and the quantum tunnelling effect is promoted, which causes the electrical resistance to fall drastically. This paper contains a detailed description of neural networks for a faster, simpler and more accurate modelling and simulation of QTC behaviour that is based on properly training these neural models with the help of data from characterization tests. Instead of using analytical equations that integrate different quantum and thermomechanical effects, neural networks are used here due to the notable nonlinearity of the aforementioned effects, which involve developing analytical models that are too complex to be of practical use. By conducting tests under different pressures and temperatures that encompass a wide range of operating conditions for these materials, different neural networks are trained and compared as the number of neurons is increased. The results of these tests have also enabled certain previously described phenomena to be simulated with more accuracy, especially those involving the response of QTCs to changes in pressure and temperature

Quantum cryptography: Theoretical protocols for quantum key distribution and tests of selected commercial QKD systems in commercial fiber networks

Science.gov (United States)

Jacak, Monika; Jacak, Janusz; Jóźwiak, Piotr; Jóźwiak, Ireneusz

2016-06-01

The overview of the current status of quantum cryptography is given in regard to quantum key distribution (QKD) protocols, implemented both on nonentangled and entangled flying qubits. Two commercial R&D platforms of QKD systems are described (the Clavis II platform by idQuantique implemented on nonentangled photons and the EPR S405 Quelle platform by AIT based on entangled photons) and tested for feasibility of their usage in commercial TELECOM fiber metropolitan networks. The comparison of systems efficiency, stability and resistivity against noise and hacker attacks is given with some suggestion toward system improvement, along with assessment of two models of QKD.

Julius Edgar Lilienfeld Prize Talk: Quantum spintronics: abandoning perfection for new technologies

Science.gov (United States)

Awschalom, David D.

2015-03-01

There is a growing interest in exploiting the quantum properties of electronic and nuclear spins for the manipulation and storage of information in the solid state. Such schemes offer qualitatively new scientific and technological opportunities by leveraging elements of standard electronics to precisely control coherent interactions between electrons, nuclei, and electromagnetic fields. We provide an overview of the field, including a discussion of temporally- and spatially-resolved magneto-optical measurements designed for probing local moment dynamics in electrically and magnetically doped semiconductor nanostructures. These early studies provided a surprising proof-of-concept that quantum spin states can be created and controlled with high-speed optoelectronic techniques. However, as electronic structures approach the atomic scale, small amounts of disorder begin to have outsized negative effects. An intriguing solution to this conundrum is emerging from recent efforts to embrace semiconductor defects themselves as a route towards quantum machines. Individual defects in carbon-based materials possess an electronic spin state that can be employed as a solid state quantum bit at and above room temperature. Developments at the frontier of this field include gigahertz coherent control, nanofabricated spin arrays, nuclear spin quantum memories, and nanometer-scale sensing. We will describe advances towards quantum information processing driven by both physics and materials science to explore electronic, photonic, and magnetic control of spin. Work supported by the AFOSR, ARO, DARPA, NSF, and ONR.

Application of AVK and selective encryption in improving performance of quantum cryptography and networks

International Nuclear Information System (INIS)

Bhunia, C.T.

2006-07-01

The subject of quantum cryptography has emerged as an important area of research. Reported theoretical and practical investigations have conclusively established the reliable quantum key distribution (QKD) protocols with a higher level of security. For perfect security, the implementation of a time variant key is essential. The nature of cost and operation involved in quantum key distribution to distribute a time variant key from session to session/message to message has yet to be addressed from an implementation angle, yet it is understood to be hard with current available technology. Besides, the disadvantages of the subject quantum cryptanalysis, in the name of 'quantum cheating' and quantum error are demonstrated in the literature. This calls for an investigation for an affordable hybrid solution using QKD with conventional classical methods of key distribution to implement a time variant key. The paper proposes a hybrid solution towards this investigation. The solutions suggested will improve the performance of computer networks for secure transport of data in general. (author)

Network Anomaly Detection Based on Wavelet Analysis

Directory of Open Access Journals (Sweden)

Ali A. Ghorbani

2008-11-01

Full Text Available Signal processing techniques have been applied recently for analyzing and detecting network anomalies due to their potential to find novel or unknown intrusions. In this paper, we propose a new network signal modelling technique for detecting network anomalies, combining the wavelet approximation and system identification theory. In order to characterize network traffic behaviors, we present fifteen features and use them as the input signals in our system. We then evaluate our approach with the 1999 DARPA intrusion detection dataset and conduct a comprehensive analysis of the intrusions in the dataset. Evaluation results show that the approach achieves high-detection rates in terms of both attack instances and attack types. Furthermore, we conduct a full day's evaluation in a real large-scale WiFi ISP network where five attack types are successfully detected from over 30 millions flows.

Network Anomaly Detection Based on Wavelet Analysis

Science.gov (United States)

Lu, Wei; Ghorbani, Ali A.

2008-12-01

Signal processing techniques have been applied recently for analyzing and detecting network anomalies due to their potential to find novel or unknown intrusions. In this paper, we propose a new network signal modelling technique for detecting network anomalies, combining the wavelet approximation and system identification theory. In order to characterize network traffic behaviors, we present fifteen features and use them as the input signals in our system. We then evaluate our approach with the 1999 DARPA intrusion detection dataset and conduct a comprehensive analysis of the intrusions in the dataset. Evaluation results show that the approach achieves high-detection rates in terms of both attack instances and attack types. Furthermore, we conduct a full day's evaluation in a real large-scale WiFi ISP network where five attack types are successfully detected from over 30 millions flows.

Quantum Clique Gossiping.

Science.gov (United States)

Li, Bo; Li, Shuang; Wu, Junfeng; Qi, Hongsheng

2018-02-09

This paper establishes a framework of quantum clique gossiping by introducing local clique operations to networks of interconnected qubits. Cliques are local structures in complex networks being complete subgraphs, which can be used to accelerate classical gossip algorithms. Based on cyclic permutations, clique gossiping leads to collective multi-party qubit interactions. We show that at reduced states, these cliques have the same acceleration effects as their roles in accelerating classical gossip algorithms. For randomized selection of cliques, such improved rate of convergence is precisely characterized. On the other hand, the rate of convergence at the coherent states of the overall quantum network is proven to be decided by the spectrum of a mean-square error evolution matrix. Remarkably, the use of larger quantum cliques does not necessarily increase the speed of the network density aggregation, suggesting quantum network dynamics is not entirely decided by its classical topology.

Search of the Deep and Dark Web via DARPA Memex

Science.gov (United States)

Mattmann, C. A.

2015-12-01

Search has progressed through several stages due to the increasing size of the Web. Search engines first focused on text and its rate of occurrence; then focused on the notion of link analysis and citation then on interactivity and guided search; and now on the use of social media - who we interact with, what we comment on, and who we follow (and who follows us). The next stage, referred to as "deep search," requires solutions that can bring together text, images, video, importance, interactivity, and social media to solve this challenging problem. The Apache Nutch project provides an open framework for large-scale, targeted, vertical search with capabilities to support all past and potential future search engine foci. Nutch is a flexible infrastructure allowing open access to ranking; URL selection and filtering approaches, to the link graph generated from search, and Nutch has spawned entire sub communities including Apache Hadoop and Apache Tika. It addresses many current needs with the capability to support new technologies such as image and video. On the DARPA Memex project, we are creating create specific extensions to Nutch that will directly improve its overall technological superiority for search and that will directly allow us to address complex search problems including human trafficking. We are integrating state-of-the-art algorithms developed by Kitware for IARPA Aladdin combined with work by Harvard to provide image and video understanding support allowing automatic detection of people and things and massive deployment via Nutch. We are expanding Apache Tika for scene understanding, object/person detection and classification in images/video. We are delivering an interactive and visual interface for initiating Nutch crawls. The interface uses Python technologies to expose Nutch data and to provide a domain specific language for crawls. With the Bokeh visualization library the interface we are delivering simple interactive crawl visualization and

Neural-network quantum state tomography

Science.gov (United States)

Torlai, Giacomo; Mazzola, Guglielmo; Carrasquilla, Juan; Troyer, Matthias; Melko, Roger; Carleo, Giuseppe

2018-05-01

The experimental realization of increasingly complex synthetic quantum systems calls for the development of general theoretical methods to validate and fully exploit quantum resources. Quantum state tomography (QST) aims to reconstruct the full quantum state from simple measurements, and therefore provides a key tool to obtain reliable analytics1-3. However, exact brute-force approaches to QST place a high demand on computational resources, making them unfeasible for anything except small systems4,5. Here we show how machine learning techniques can be used to perform QST of highly entangled states with more than a hundred qubits, to a high degree of accuracy. We demonstrate that machine learning allows one to reconstruct traditionally challenging many-body quantities—such as the entanglement entropy—from simple, experimentally accessible measurements. This approach can benefit existing and future generations of devices ranging from quantum computers to ultracold-atom quantum simulators6-8.

Phase I Report: DARPA Exoskeleton Program

Energy Technology Data Exchange (ETDEWEB)

Jansen, J.F.

2004-01-21

The Defense Advanced Research Projects Agency (DARPA) inaugurated a program addressing research and development for an Exoskeleton for Human Performance Augmentation in FY!2001. A team consisting of Oak Ridge National Laboratory, the prime contractor, AeroVironment, Inc., the Army Research Laboratory, the University of Minnesota, and the Virginia Polytechnic Institute has recently completed an 18-month Phase I effort in support of this DARPA program. The Phase I effort focused on the development and proof-of-concept demonstrations for key enabling technologies, laying the foundation for subsequently building and demonstrating a prototype exoskeleton. The overall approach was driven by the need to optimize energy efficiency while providing a system that augmented the operator in as transparent manner as possible (non-impeding). These needs led to the evolution of two key distinguishing features of this team's approach. The first is the ''no knee contact'' concept. This concept is dependent on a unique Cartesian-based control scheme that uses force sensing at the foot and backpack attachments to allow the exoskeleton to closely follow the operator while avoiding the difficulty of connecting and sensing position at the knee. The second is an emphasis on energy efficiency manifested by an energetic, power, actuation and controls approach designed to enhance energy efficiency as well as a reconfigurable kinematic structure that provides a non-anthropomorphic configuration to support an energy saving long-range march/transport mode. The enabling technologies addressed in the first phase were controls and sensing, the soft tissue interface between the machine and the operator, the power system, and actuation. The controller approach was implemented and demonstrated on a test stand with an actual operator. Control stability, low operator fatigue, force amplification and the human interface were all successfully demonstrated, validating the controls

Quantum Max-flow/Min-cut

Science.gov (United States)

Cui, Shawn X.; Freedman, Michael H.; Sattath, Or; Stong, Richard; Minton, Greg

2016-06-01

The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating an integral capacity to each edge and a tensor to each vertex in a flow network, we can also interpret it as a tensor network and, more specifically, as a linear map from the input space to the output space. The quantum max-flow is defined to be the maximal rank of this linear map over all choices of tensors. The quantum min-cut is defined to be the minimum product of the capacities of edges over all cuts of the tensor network. We show that unlike the classical case, the quantum max-flow=min-cut conjecture is not true in general. Under certain conditions, e.g., when the capacity on each edge is some power of a fixed integer, the quantum max-flow is proved to equal the quantum min-cut. However, concrete examples are also provided where the equality does not hold. We also found connections of quantum max-flow/min-cut with entropy of entanglement and the quantum satisfiability problem. We speculate that the phenomena revealed may be of interest both in spin systems in condensed matter and in quantum gravity.

Quantum Max-flow/Min-cut

Energy Technology Data Exchange (ETDEWEB)

Cui, Shawn X., E-mail: xingshan@math.ucsb.edu [Department of Mathematics, University of California, Santa Barbara, California 93106 (United States); Quantum Architectures and Computation Group, Microsoft Research, Redmond, Washington 98052 (United States); Freedman, Michael H., E-mail: michaelf@microsoft.com [Department of Mathematics, University of California, Santa Barbara, California 93106 (United States); Microsoft Research, Station Q, University of California, Santa Barbara, California 93106 (United States); Sattath, Or, E-mail: sattath@gmail.com [Computer Science Division, University of California, Berkeley, California 94720 (United States); Stong, Richard, E-mail: stong@ccrwest.org; Minton, Greg, E-mail: gtminto@ccrwest.org [Center for Communications Research, La Jolla, California 92121 (United States)

2016-06-15

The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating an integral capacity to each edge and a tensor to each vertex in a flow network, we can also interpret it as a tensor network and, more specifically, as a linear map from the input space to the output space. The quantum max-flow is defined to be the maximal rank of this linear map over all choices of tensors. The quantum min-cut is defined to be the minimum product of the capacities of edges over all cuts of the tensor network. We show that unlike the classical case, the quantum max-flow=min-cut conjecture is not true in general. Under certain conditions, e.g., when the capacity on each edge is some power of a fixed integer, the quantum max-flow is proved to equal the quantum min-cut. However, concrete examples are also provided where the equality does not hold. We also found connections of quantum max-flow/min-cut with entropy of entanglement and the quantum satisfiability problem. We speculate that the phenomena revealed may be of interest both in spin systems in condensed matter and in quantum gravity.

A Summary of the Rendezvous, Proximity Operations, Docking, and Undocking (RPODU) Lessons Learned from the Defense Advanced Research Project Agency (DARPA) Orbital Express (OE) Demonstration System Mission

Science.gov (United States)

Dennehy, Cornelius J.; Carpenter, James R.

2011-01-01

The Guidance, Navigation, and Control (GN&C) Technical Discipline Team (TDT) sponsored Dr. J. Russell Carpenter, a Navigation and Rendezvous Subject Matter Expert (SME) from NASA's Goddard Space Flight Center (GSFC), to provide support to the Defense Advanced Research Project Agency (DARPA) Orbital Express (OE) rendezvous and docking flight test that was conducted in 2007. When that DARPA OE mission was completed, Mr. Neil Dennehy, NASA Technical Fellow for GN&C, requested Dr. Carpenter document his findings (lessons learned) and recommendations for future rendezvous missions resulting from his OE support experience. This report captures lessons specifically from anomalies that occurred during one of OE's unmated operations.

Modeling the quantum to classical crossover in topologically disordered networks

International Nuclear Information System (INIS)

Schijven, P; Kohlberger, J; Blumen, A; Mülken, O

2012-01-01

We model transport in topologically disordered networks that are subjected to an environment that induces classical diffusion. The dynamics is phenomenologically described within the framework of the recently introduced quantum stochastic walk, allowing study of the crossover between coherent transport and purely classical diffusion. To study the transport efficiency, we connect our system with a source and a drain and provide a detailed analysis of their effects. We find that the coupling to the environment removes all effects of localization and quickly leads to classical transport. Furthermore, we find that on the level of the transport efficiency, the system can be well described by reducing it to a two-node network (a dimer). (paper)

The DARPA compact Superconducting X-Ray Lithography Source features

International Nuclear Information System (INIS)

Heese, R.; Kalsi, S.; Leung, E.

1991-01-01

Under DARPA sponsorship, a compact Superconducting X-Ray Lithography Source (SXLS) is being designed and built by the Brookhaven National Laboratory (BNL) with industry participation from Grumman Corporation and General Dynamics. This source is optimized for lithography work for sub-micron high density computer chips, and is about the size of a billiard table (1.5 m x 4.0 m). The machine has a racetrack configuration with two 180 degree bending magnets being designed and built by General Dynamics under a subcontract with Grumman Corporation. The machine will have 18 photon ports which would deliver light peaked at a wave length of 10 Angstroms. Grumman is commercializing the SXLS device and plans to book orders for delivery of industrialized SXLS (ISXLS) versions in 1995. This paper will describe the major features of this device. The commercial machine will be equipped with a fully automated user-friendly control systems, major features of which are already working on a compact warm dipole ring at BNL. This ring has normal dipole magnets with dimensions identical to the SXLS device, and has been successfully commissioned

Field test of a practical secure communication network with decoy-state quantum cryptography.

Science.gov (United States)

Chen, Teng-Yun; Liang, Hao; Liu, Yang; Cai, Wen-Qi; Ju, Lei; Liu, Wei-Yue; Wang, Jian; Yin, Hao; Chen, Kai; Chen, Zeng-Bing; Peng, Cheng-Zhi; Pan, Jian-Wei

2009-04-13

We present a secure network communication system that operated with decoy-state quantum cryptography in a real-world application scenario. The full key exchange and application protocols were performed in real time among three nodes, in which two adjacent nodes were connected by approximate 20 km of commercial telecom optical fiber. The generated quantum keys were immediately employed and demonstrated for communication applications, including unbreakable real-time voice telephone between any two of the three communication nodes, or a broadcast from one node to the other two nodes by using one-time pad encryption.

A surprisingly simple correlation between the classical and quantum structural networks in liquid water

Science.gov (United States)

Hamm, Peter; Fanourgakis, George S.; Xantheas, Sotiris S.

2017-08-01

Nuclear quantum effects in liquid water have profound implications for several of its macroscopic properties related to the structure, dynamics, spectroscopy, and transport. Although several of water's macroscopic properties can be reproduced by classical descriptions of the nuclei using interaction potentials effectively parameterized for a narrow range of its phase diagram, a proper account of the nuclear quantum effects is required to ensure that the underlying molecular interactions are transferable across a wide temperature range covering different regions of that diagram. When performing an analysis of the hydrogen-bonded structural networks in liquid water resulting from the classical (class) and quantum (qm) descriptions of the nuclei with two interaction potentials that are at the two opposite ends of the range in describing quantum effects, namely the flexible, pair-wise additive q-TIP4P/F, and the flexible, polarizable TTM3-F, we found that the (class) and (qm) results can be superimposed over the temperature range T = 250-350 K using a surprisingly simple, linear scaling of the two temperatures according to T(qm) = α T(class) + ΔT, where α = 0.99 and ΔT = -6 K for q-TIP4P/F and α = 1.24 and ΔT = -64 K for TTM3-F. This simple relationship suggests that the structural networks resulting from the quantum and classical treatment of the nuclei with those two very different interaction potentials are essentially similar to each other over this extended temperature range once a model-dependent linear temperature scaling law is applied.

Semihierarchical quantum repeaters based on moderate lifetime quantum memories

Science.gov (United States)

Liu, Xiao; Zhou, Zong-Quan; Hua, Yi-Lin; Li, Chuan-Feng; Guo, Guang-Can

2017-01-01

The construction of large-scale quantum networks relies on the development of practical quantum repeaters. Many approaches have been proposed with the goal of outperforming the direct transmission of photons, but most of them are inefficient or difficult to implement with current technology. Here, we present a protocol that uses a semihierarchical structure to improve the entanglement distribution rate while reducing the requirement of memory time to a range of tens of milliseconds. This protocol can be implemented with a fixed distance of elementary links and fixed requirements on quantum memories, which are independent of the total distance. This configuration is especially suitable for scalable applications in large-scale quantum networks.

Non-additive dissipation in open quantum networks out of equilibrium

Science.gov (United States)

Mitchison, Mark T.; Plenio, Martin B.

2018-03-01

We theoretically study a simple non-equilibrium quantum network whose dynamics can be expressed and exactly solved in terms of a time-local master equation. Specifically, we consider a pair of coupled fermionic modes, each one locally exchanging energy and particles with an independent, macroscopic thermal reservoir. We show that the generator of the asymptotic master equation is not additive, i.e. it cannot be expressed as a sum of contributions describing the action of each reservoir alone. Instead, we identify an additional interference term that generates coherences in the energy eigenbasis, associated with the current of conserved particles flowing in the steady state. Notably, non-additivity arises even for wide-band reservoirs coupled arbitrarily weakly to the system. Our results shed light on the non-trivial interplay between multiple thermal noise sources in modular open quantum systems.

Quantum Nano-Automata (QNA) : Towards Microphysical Measurements with Quantum, Nanoscale 'Instruments'

CERN Document Server

Baianu, IC

2004-01-01

Two important concepts for nanoscience and nanotechnology-- the quantum automaton and quantum computation--were introduced in the context of quantum genetics and complex genetic networks with nonlinear dynamics. In previous publications (Baianu,1971a, b) the formal definition of quantum automaton was initially presented in the Schrodinger representation of quantum mechanics, and several possible implications for genetic processes and metabolic activities in living cells and organisms were considered. This was followed by reports on quantum, as well as symbolic, abstract computations based on the theory of categories, functors and natural transformations (Baianu,1971b; 1977; 1987; 2004; Baianu et al, 2004). The notions of quantum topological semigroup, quantum automaton, and/or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. A representation of inter...

Quantum autoencoders for efficient compression of quantum data

Science.gov (United States)

Romero, Jonathan; Olson, Jonathan P.; Aspuru-Guzik, Alan

2017-12-01

Classical autoencoders are neural networks that can learn efficient low-dimensional representations of data in higher-dimensional space. The task of an autoencoder is, given an input x, to map x to a lower dimensional point y such that x can likely be recovered from y. The structure of the underlying autoencoder network can be chosen to represent the data on a smaller dimension, effectively compressing the input. Inspired by this idea, we introduce the model of a quantum autoencoder to perform similar tasks on quantum data. The quantum autoencoder is trained to compress a particular data set of quantum states, where a classical compression algorithm cannot be employed. The parameters of the quantum autoencoder are trained using classical optimization algorithms. We show an example of a simple programmable circuit that can be trained as an efficient autoencoder. We apply our model in the context of quantum simulation to compress ground states of the Hubbard model and molecular Hamiltonians.

Quantum information to the home

International Nuclear Information System (INIS)

Choi, Iris; Young, Robert J; Townsend, Paul D

2011-01-01

Information encoded on individual quanta will play an important role in our future lives, much as classically encoded digital information does today. Combining quantum information carried by single photons with classical signals encoded on strong laser pulses in modern fibre-to-the-home (FTTH) networks is a significant challenge, the solution to which will facilitate the global distribution of quantum information to the home and with it a quantum internet. In real-world networks, spontaneous Raman scattering in the optical fibre would induce crosstalk between the high-power classical channels and a single-photon quantum channel, such that the latter is unable to operate. Here, we show that the integration of quantum and classical information on an FTTH network is possible by performing quantum key distribution (QKD) on a network while simultaneously transferring realistic levels of classical data. Our novel scheme involves synchronously interleaving a channel of quantum data with the Raman scattered photons from a classical channel, exploiting the periodic minima in the instantaneous crosstalk and thereby enabling secure QKD to be performed.

Quantum information to the home

Science.gov (United States)

Choi, Iris; Young, Robert J.; Townsend, Paul D.

2011-06-01

Information encoded on individual quanta will play an important role in our future lives, much as classically encoded digital information does today. Combining quantum information carried by single photons with classical signals encoded on strong laser pulses in modern fibre-to-the-home (FTTH) networks is a significant challenge, the solution to which will facilitate the global distribution of quantum information to the home and with it a quantum internet [1]. In real-world networks, spontaneous Raman scattering in the optical fibre would induce crosstalk between the high-power classical channels and a single-photon quantum channel, such that the latter is unable to operate. Here, we show that the integration of quantum and classical information on an FTTH network is possible by performing quantum key distribution (QKD) on a network while simultaneously transferring realistic levels of classical data. Our novel scheme involves synchronously interleaving a channel of quantum data with the Raman scattered photons from a classical channel, exploiting the periodic minima in the instantaneous crosstalk and thereby enabling secure QKD to be performed.

Quantum information to the home

Energy Technology Data Exchange (ETDEWEB)

Choi, Iris; Young, Robert J; Townsend, Paul D, E-mail: paul.townsend@tyndall.ie [Photonic Systems Group, Tyndall National Institute and Department of Physics, University College Cork, Cork (Ireland)

2011-06-15

Information encoded on individual quanta will play an important role in our future lives, much as classically encoded digital information does today. Combining quantum information carried by single photons with classical signals encoded on strong laser pulses in modern fibre-to-the-home (FTTH) networks is a significant challenge, the solution to which will facilitate the global distribution of quantum information to the home and with it a quantum internet. In real-world networks, spontaneous Raman scattering in the optical fibre would induce crosstalk between the high-power classical channels and a single-photon quantum channel, such that the latter is unable to operate. Here, we show that the integration of quantum and classical information on an FTTH network is possible by performing quantum key distribution (QKD) on a network while simultaneously transferring realistic levels of classical data. Our novel scheme involves synchronously interleaving a channel of quantum data with the Raman scattered photons from a classical channel, exploiting the periodic minima in the instantaneous crosstalk and thereby enabling secure QKD to be performed.

Efficient networks for quantum factoring

International Nuclear Information System (INIS)

Beckman, D.; Chari, A.N.; Devabhaktuni, S.; Preskill, J.

1996-01-01

We consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory quantum bits (qubits) and the number of operations required to perform factorization, using the algorithm suggested by Shor [in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, edited by S. Goldwasser (IEEE Computer Society, Los Alamitos, CA, 1994), p. 124]. A K-bit number can be factored in time of order K 3 using a machine capable of storing 5K+1 qubits. Evaluation of the modular exponential function (the bottleneck of Shor close-quote s algorithm) could be achieved with about 72K 3 elementary quantum gates; implementation using a linear ion trap would require about 396K 3 laser pulses. A proof-of-principle demonstration of quantum factoring (factorization of 15) could be performed with only 6 trapped ions and 38 laser pulses. Though the ion trap may never be a useful computer, it will be a powerful device for exploring experimentally the properties of entangled quantum states. copyright 1996 The American Physical Society

Diamond NV centers for quantum computing and quantum networks

NARCIS (Netherlands)

Childress, L.; Hanson, R.

2013-01-01

The exotic features of quantum mechanics have the potential to revolutionize information technologies. Using superposition and entanglement, a quantum processor could efficiently tackle problems inaccessible to current-day computers. Nonlocal correlations may be exploited for intrinsically secure

Defence and security applications of quantum cascade lasers

Science.gov (United States)

Grasso, Robert J.

2016-09-01

Quantum Cascade Lasers (QCL) have seen tremendous recent application in the realm of Defence and Security. And, in many instances replacing traditional solid state lasers as the source of choice for Countermeasures, Remote Sensing, In-situ Sensing, Through-Barrier Sensing, and many others. Following their development and demonstration in the early 1990's, QCL's reached some maturity and specific defence and security application prior to 2005; with much initial development fostered by DARPA initiatives in the US, dstl, MoD, and EOARD funding initiatives in the UK, and University level R&D such as those by Prof Manijeh Razeghi at Northwestern University [1], and Prof Ted Masselink at Humboldt University [2]. As QCL's provide direct mid-IR laser output for electrical input, they demonstrate high quantum efficiency compared with diode pumped solid state lasers with optical parametric oscillators (OPOs) to generate mid-Infrared output. One particular advantage of QCL's is their very broad operational bandwidth, extending from the terahertz to the near-infrared spectral regions. Defence and Security areas benefiting from QCL's include: Countermeasures, Remote Sensing, Through-the-Wall Sensing, and Explosive Detection. All information used to construct this paper obtained from open sources.

Interfacing external quantum devices to a universal quantum computer.

Directory of Open Access Journals (Sweden)

Antonio A Lagana

Full Text Available We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer.

Nanophotonic quantum computer based on atomic quantum transistor

International Nuclear Information System (INIS)

Andrianov, S N; Moiseev, S A

2015-01-01

We propose a scheme of a quantum computer based on nanophotonic elements: two buses in the form of nanowaveguide resonators, two nanosized units of multiatom multiqubit quantum memory and a set of nanoprocessors in the form of photonic quantum transistors, each containing a pair of nanowaveguide ring resonators coupled via a quantum dot. The operation modes of nanoprocessor photonic quantum transistors are theoretically studied and the execution of main logical operations by means of them is demonstrated. We also discuss the prospects of the proposed nanophotonic quantum computer for operating in high-speed optical fibre networks. (quantum computations)

Nanophotonic quantum computer based on atomic quantum transistor

Energy Technology Data Exchange (ETDEWEB)

Andrianov, S N [Institute of Advanced Research, Academy of Sciences of the Republic of Tatarstan, Kazan (Russian Federation); Moiseev, S A [Kazan E. K. Zavoisky Physical-Technical Institute, Kazan Scientific Center, Russian Academy of Sciences, Kazan (Russian Federation)

2015-10-31

We propose a scheme of a quantum computer based on nanophotonic elements: two buses in the form of nanowaveguide resonators, two nanosized units of multiatom multiqubit quantum memory and a set of nanoprocessors in the form of photonic quantum transistors, each containing a pair of nanowaveguide ring resonators coupled via a quantum dot. The operation modes of nanoprocessor photonic quantum transistors are theoretically studied and the execution of main logical operations by means of them is demonstrated. We also discuss the prospects of the proposed nanophotonic quantum computer for operating in high-speed optical fibre networks. (quantum computations)

Quantum memory for images: A quantum hologram

International Nuclear Information System (INIS)

Vasilyev, Denis V.; Sokolov, Ivan V.; Polzik, Eugene S.

2008-01-01

Matter-light quantum interface and quantum memory for light are important ingredients of quantum information protocols, such as quantum networks, distributed quantum computation, etc. [P. Zoller et al., Eur. Phys. J. D 36, 203 (2005)]. In this paper we present a spatially multimode scheme for quantum memory for light, which we call a quantum hologram. Our approach uses a multiatom ensemble which has been shown to be efficient for a single spatial mode quantum memory. Due to the multiatom nature of the ensemble and to the optical parallelism it is capable of storing many spatial modes, a feature critical for the present proposal. A quantum hologram with the fidelity exceeding that of classical hologram will be able to store quantum features of an image, such as multimode superposition and entangled quantum states, something that a standard hologram is unable to achieve

Wireless networks of opportunity in support of secure field operations

Science.gov (United States)

Stehle, Roy H.; Lewis, Mark

1997-02-01

Under funding from the Defense Advanced Research Projects Agency (DARPA) for joint military and law enforcement technologies, demonstrations of secure information transfer in support of law enforcement and military operations other than war, using wireless and wired technology, were held in September 1996 at several locations in the United States. In this paper, the network architecture, protocols, and equipment supporting the demonstration's scenarios are presented, together with initial results, including lessons learned and desired system enhancements. Wireless networks of opportunity encompassed in-building (wireless-LAN), campus-wide (Metricom Inc.), metropolitan (AMPS cellular, CDPD), and national (one- and two-way satellite) systems. Evolving DARPA-sponsored packet radio technology was incorporated. All data was encrypted, using multilevel information system security initiative (MISSI)FORTEZZA technology, for carriage over unsecured and unclassified commercial networks. The identification and authentication process inherent in the security system permitted logging for database accesses and provided an audit trail useful in evidence gathering. Wireless and wireline communications support, to and between modeled crisis management centers, was demonstrated. Mechanisms for the guarded transport of data through the secret-high military tactical Internet were included, to support joint law enforcement and crisis management missions. A secure World Wide Web (WWW) browser forms the primary, user-friendly interface for information retrieval and submission. The WWW pages were structured to be sensitive to the bandwidth, error rate, and cost of the communications medium in use (e.g., the use of and resolution for graphical data). Both still and motion compressed video were demonstrated, along with secure voice transmission from laptop computers in the field. Issues of network bandwidth, airtime costs, and deployment status are discussed.

Low-cost autonomous perceptron neural network inspired by quantum computation

Science.gov (United States)

Zidan, Mohammed; Abdel-Aty, Abdel-Haleem; El-Sadek, Alaa; Zanaty, E. A.; Abdel-Aty, Mahmoud

2017-11-01

Achieving low cost learning with reliable accuracy is one of the important goals to achieve intelligent machines to save time, energy and perform learning process over limited computational resources machines. In this paper, we propose an efficient algorithm for a perceptron neural network inspired by quantum computing composite from a single neuron to classify inspirable linear applications after a single training iteration O(1). The algorithm is applied over a real world data set and the results are outer performs the other state-of-the art algorithms.

Topological quantum computing with a very noisy network and local error rates approaching one percent.

Science.gov (United States)

Nickerson, Naomi H; Li, Ying; Benjamin, Simon C

2013-01-01

A scalable quantum computer could be built by networking together many simple processor cells, thus avoiding the need to create a single complex structure. The difficulty is that realistic quantum links are very error prone. A solution is for cells to repeatedly communicate with each other and so purify any imperfections; however prior studies suggest that the cells themselves must then have prohibitively low internal error rates. Here we describe a method by which even error-prone cells can perform purification: groups of cells generate shared resource states, which then enable stabilization of topologically encoded data. Given a realistically noisy network (≥10% error rate) we find that our protocol can succeed provided that intra-cell error rates for initialisation, state manipulation and measurement are below 0.82%. This level of fidelity is already achievable in several laboratory systems.

A versatile source of polarization entangled photons for quantum network applications

International Nuclear Information System (INIS)

Kaiser, Florian; Issautier, Amandine; Ngah, Lutfi A; Alibart, Olivier; Martin, Anthony; Tanzilli, Sébastien

2013-01-01

We report a versatile and practical approach for the generation of high-quality polarization entanglement in a fully guided-wave fashion. Our setup relies on a high-brilliance type-0 waveguide generator producing paired photons at a telecom wavelength associated with an advanced energy-time to polarization transcriber. The latter is capable of creating any pure polarization entangled state, and allows manipulation of single-photon bandwidths that can be chosen at will over five orders of magnitude, ranging from tens of MHz to several THz. We achieve excellent entanglement fidelities for particular spectral bandwidths, i.e. 25 MHz, 540 MHz and 80 GHz, proving the relevance of our approach. Our scheme stands as an ideal candidate for a wide range of network applications, ranging from dense division multiplexing quantum key distribution to heralded optical quantum memories and repeaters. (letter)

Quantum photonic networks in diamond

KAUST Repository

Lončar, Marko

2013-02-01

Advances in nanotechnology have enabled the opportunity to fabricate nanoscale optical devices and chip-scale systems in diamond that can generate, manipulate, and store optical signals at the single-photon level. In particular, nanophotonics has emerged as a powerful interface between optical elements such as optical fibers and lenses, and solid-state quantum objects such as luminescent color centers in diamond that can be used effectively to manipulate quantum information. While quantum science and technology has been the main driving force behind recent interest in diamond nanophotonics, such a platform would have many applications that go well beyond the quantum realm. For example, diamond\\'s transparency over a wide wavelength range, large third-order nonlinearity, and excellent thermal properties are of great interest for the implementation of frequency combs and integrated Raman lasers. Diamond is also an inert material that makes it well suited for biological applications and for devices that must operate in harsh environments. Copyright © Materials Research Society 2013.

COmmunications and Networking with QUantum Operationally-Secure Technology for Maritime Deployment (CONQUEST)

Science.gov (United States)

2017-03-06

15 minutes 48 Efficient post -processing for CV QKD Saikat Guha BBN Review Meeting Feb 17, 2017 Communications and Networking with Quantum Operationally...Raytheon BBN Technologies; Dr. Saikat Guha Contractor Address: 10 Moulton Street, Cambridge, MA 02138 Title of the Project: COmmunications and...Equipment Purchased No equipment has been purchased or constructed at this time. Section D. Key Personnel There have been no changes in

Comparing classical and quantum PageRanks

Science.gov (United States)

Loke, T.; Tang, J. W.; Rodriguez, J.; Small, M.; Wang, J. B.

2017-01-01

Following recent developments in quantum PageRanking, we present a comparative analysis of discrete-time and continuous-time quantum-walk-based PageRank algorithms. Relative to classical PageRank and to different extents, the quantum measures better highlight secondary hubs and resolve ranking degeneracy among peripheral nodes for all networks we studied in this paper. For the discrete-time case, we investigated the periodic nature of the walker's probability distribution for a wide range of networks and found that the dominant period does not grow with the size of these networks. Based on this observation, we introduce a new quantum measure using the maximum probabilities of the associated walker during the first couple of periods. This is particularly important, since it leads to a quantum PageRanking scheme that is scalable with respect to network size.

Controlled Photon Switch Assisted by Coupled Quantum Dots

Science.gov (United States)

Luo, Ming-Xing; Ma, Song-Ya; Chen, Xiu-Bo; Wang, Xiaojun

2015-01-01

Quantum switch is a primitive element in quantum network communication. In contrast to previous switch schemes on one degree of freedom (DOF) of quantum systems, we consider controlled switches of photon system with two DOFs. These controlled photon switches are constructed by exploring the optical selection rules derived from the quantum-dot spins in one-sided optical microcavities. Several double controlled-NOT gate on different joint systems are greatly simplified with an auxiliary DOF of the controlling photon. The photon switches show that two DOFs of photons can be independently transmitted in quantum networks. This result reduces the quantum resources for quantum network communication. PMID:26095049

Forecast on Water Locking Damage of Low Permeable Reservoir with Quantum Neural Network

Science.gov (United States)

Zhao, Jingyuan; Sun, Yuxue; Feng, Fuping; Zhao, Fulei; Sui, Dianjie; Xu, Jianjun

2018-01-01

It is of great importance in oil-gas reservoir protection to timely and correctly forecast the water locking damage, the greatest damage for low permeable reservoir. An analysis is conducted on the production mechanism and various influence factors of water locking damage, based on which a quantum neuron is constructed based on the information processing manner of a biological neuron and the principle of quantum neural algorithm, besides, the quantum neural network model forecasting the water locking of the reservoir is established and related software is also made to forecast the water locking damage of the gas reservoir. This method has overcome the defects of grey correlation analysis that requires evaluation matrix analysis and complicated operation. According to the practice in Longxi Area of Daqing Oilfield, this method is characterized by fast operation, few system parameters and high accuracy rate (the general incidence rate may reach 90%), which can provide reliable support for the protection technique of low permeable reservoir.

Effects of adaptive degrees of trust on coevolution of quantum strategies on scale-free networks

Science.gov (United States)

Li, Qiang; Chen, Minyou; Perc, Matjaž; Iqbal, Azhar; Abbott, Derek

2013-10-01

We study the impact of adaptive degrees of trust on the evolution of cooperation in the quantum prisoner's dilemma game. In addition to the strategies, links between players are also subject to evolution. Starting with a scale-free interaction network, players adjust trust towards their neighbors based on received payoffs. The latter governs the strategy adoption process, while trust governs the rewiring of links. As soon as the degree of trust towards a neighbor drops to zero, the link is rewired to another randomly chosen player within the network. We find that for small temptations to defect cooperators always dominate, while for intermediate and strong temptations a single quantum strategy is able to outperform all other strategies. In general, reciprocal trust remains within close relationships and favors the dominance of a single strategy. Due to coevolution, the power-law degree distributions transform to Poisson distributions.

A fully automated entanglement-based quantum cryptography system for telecom fiber networks

International Nuclear Information System (INIS)

Treiber, Alexander; Ferrini, Daniele; Huebel, Hannes; Zeilinger, Anton; Poppe, Andreas; Loruenser, Thomas; Querasser, Edwin; Matyus, Thomas; Hentschel, Michael

2009-01-01

We present in this paper a quantum key distribution (QKD) system based on polarization entanglement for use in telecom fibers. A QKD exchange up to 50 km was demonstrated in the laboratory with a secure key rate of 550 bits s -1 . The system is compact and portable with a fully automated start-up, and stabilization modules for polarization, synchronization and photon coupling allow hands-off operation. Stable and reliable key exchange in a deployed optical fiber of 16 km length was demonstrated. In this fiber network, we achieved over 2 weeks an automatic key generation with an average key rate of 2000 bits s -1 without manual intervention. During this period, the system had an average entanglement visibility of 93%, highlighting the technical level and stability achieved for entanglement-based quantum cryptography.

Quantum Secure Group Communication.

Science.gov (United States)

Li, Zheng-Hong; Zubairy, M Suhail; Al-Amri, M

2018-03-01

We propose a quantum secure group communication protocol for the purpose of sharing the same message among multiple authorized users. Our protocol can remove the need for key management that is needed for the quantum network built on quantum key distribution. Comparing with the secure quantum network based on BB84, we show our protocol is more efficient and securer. Particularly, in the security analysis, we introduce a new way of attack, i.e., the counterfactual quantum attack, which can steal information by "invisible" photons. This invisible photon can reveal a single-photon detector in the photon path without triggering the detector. Moreover, the photon can identify phase operations applied to itself, thereby stealing information. To defeat this counterfactual quantum attack, we propose a quantum multi-user authorization system. It allows us to precisely control the communication time so that the attack can not be completed in time.

Long distance quantum teleportation

Science.gov (United States)

Xia, Xiu-Xiu; Sun, Qi-Chao; Zhang, Qiang; Pan, Jian-Wei

2018-01-01

Quantum teleportation is a core protocol in quantum information science. Besides revealing the fascinating feature of quantum entanglement, quantum teleportation provides an ultimate way to distribute quantum state over extremely long distance, which is crucial for global quantum communication and future quantum networks. In this review, we focus on the long distance quantum teleportation experiments, especially those employing photonic qubits. From the viewpoint of real-world application, both the technical advantages and disadvantages of these experiments are discussed.

Capacity on wireless quantum cellular communication system

Science.gov (United States)

Zhou, Xiang-Zhen; Yu, Xu-Tao; Zhang, Zai-Chen

2018-03-01

Quantum technology is making excellent prospects in future communication networks. Entanglement generation and purification are two major components in quantum networks. Combining these two techniques with classical cellular mobile communication, we proposed a novel wireless quantum cellular(WQC) communication system which is possible to realize commercial mobile quantum communication. In this paper, the architecture and network topology of WQC communication system are discussed, the mathematical model of WQC system is extracted and the serving capacity, indicating the ability to serve customers, is defined and calculated under certain circumstances.

Diamond-based Fabry-Perot microcavities for quantum networks

NARCIS (Netherlands)

Bogdanovic, S.

2017-01-01

A quantumnetwork would allow the distribution of a quantum state over many spatially separated quantum nodes which individually possess the ability to generate, process and store quantum information. Connecting these nodes through quantum communication channels would enable sending quantum

Fuzzy wavelet plus a quantum neural network as a design base for power system stability enhancement.

Science.gov (United States)

Ganjefar, Soheil; Tofighi, Morteza; Karami, Hamidreza

2015-11-01

In this study, we introduce an indirect adaptive fuzzy wavelet neural controller (IAFWNC) as a power system stabilizer to damp inter-area modes of oscillations in a multi-machine power system. Quantum computing is an efficient method for improving the computational efficiency of neural networks, so we developed an identifier based on a quantum neural network (QNN) to train the IAFWNC in the proposed scheme. All of the controller parameters are tuned online based on the Lyapunov stability theory to guarantee the closed-loop stability. A two-machine, two-area power system equipped with a static synchronous series compensator as a series flexible ac transmission system was used to demonstrate the effectiveness of the proposed controller. The simulation and experimental results demonstrated that the proposed IAFWNC scheme can achieve favorable control performance. Copyright © 2015 Elsevier Ltd. All rights reserved.

Quantum correlations in connected multipartite Bell experiments

International Nuclear Information System (INIS)

Tavakoli, Armin

2016-01-01

Bell experiments measure correlations between outcomes of a number of observers measuring on a shared physical state emitted from a single source. Quantum correlations arising in such Bell experiments have been intensively studied over the last decades. Much less is known about the nature of quantum correlations arising in network structures beyond Bell experiments. Such networks can involve many independent sources emitting states to observers in accordance with the network configuration. Here, we will study classical and quantum correlations in a family of networks which can be regarded as compositions of several independent multipartite Bell experiments connected together through a central node. For such networks we present tight Bell-type inequalities which are satisfied by all classical correlations. We study properties of the violations of our inequalities by probability distributions arising in quantum theory. (paper)

Quantum Secure Direct Communication with Quantum Memory.

Science.gov (United States)

Zhang, Wei; Ding, Dong-Sheng; Sheng, Yu-Bo; Zhou, Lan; Shi, Bao-Sen; Guo, Guang-Can

2017-06-02

Quantum communication provides an absolute security advantage, and it has been widely developed over the past 30 years. As an important branch of quantum communication, quantum secure direct communication (QSDC) promotes high security and instantaneousness in communication through directly transmitting messages over a quantum channel. The full implementation of a quantum protocol always requires the ability to control the transfer of a message effectively in the time domain; thus, it is essential to combine QSDC with quantum memory to accomplish the communication task. In this Letter, we report the experimental demonstration of QSDC with state-of-the-art atomic quantum memory for the first time in principle. We use the polarization degrees of freedom of photons as the information carrier, and the fidelity of entanglement decoding is verified as approximately 90%. Our work completes a fundamental step toward practical QSDC and demonstrates a potential application for long-distance quantum communication in a quantum network.

Dynamics, morphogenesis and convergence of evolutionary quantum Prisoner's Dilemma games on networks

Science.gov (United States)

Yong, Xi

2016-01-01

The authors proposed a quantum Prisoner's Dilemma (PD) game as a natural extension of the classic PD game to resolve the dilemma. Here, we establish a new Nash equilibrium principle of the game, propose the notion of convergence and discover the convergence and phase-transition phenomena of the evolutionary games on networks. We investigate the many-body extension of the game or evolutionary games in networks. For homogeneous networks, we show that entanglement guarantees a quick convergence of super cooperation, that there is a phase transition from the convergence of defection to the convergence of super cooperation, and that the threshold for the phase transitions is principally determined by the Nash equilibrium principle of the game, with an accompanying perturbation by the variations of structures of networks. For heterogeneous networks, we show that the equilibrium frequencies of super-cooperators are divergent, that entanglement guarantees emergence of super-cooperation and that there is a phase transition of the emergence with the threshold determined by the Nash equilibrium principle, accompanied by a perturbation by the variations of structures of networks. Our results explore systematically, for the first time, the dynamics, morphogenesis and convergence of evolutionary games in interacting and competing systems. PMID:27118882

Experimental realization of quantum cheque using a five-qubit quantum computer

Science.gov (United States)

Behera, Bikash K.; Banerjee, Anindita; Panigrahi, Prasanta K.

2017-12-01

Quantum cheques could be a forgery-free way to make transaction in a quantum networked banking system with perfect security against any no-signalling adversary. Here, we demonstrate the implementation of quantum cheque, proposed by Moulick and Panigrahi (Quantum Inf Process 15:2475-2486, 2016), using the five-qubit IBM quantum computer. Appropriate single qubit, CNOT and Fredkin gates are used in an optimized configuration. The accuracy of implementation is checked and verified through quantum state tomography by comparing results from the theoretical and experimental density matrices.

Machine Learning and Quantum Mechanics

Science.gov (United States)

Chapline, George

The author has previously pointed out some similarities between selforganizing neural networks and quantum mechanics. These types of neural networks were originally conceived of as away of emulating the cognitive capabilities of the human brain. Recently extensions of these networks, collectively referred to as deep learning networks, have strengthened the connection between self-organizing neural networks and human cognitive capabilities. In this note we consider whether hardware quantum devices might be useful for emulating neural networks with human-like cognitive capabilities, or alternatively whether implementations of deep learning neural networks using conventional computers might lead to better algorithms for solving the many body Schrodinger equation.

Control Theoretical Expression of Quantum Systems And Lower Bound of Finite Horizon Quantum Algorithms

OpenAIRE

Yanagisawa, Masahiro

2007-01-01

We provide a control theoretical method for a computational lower bound of quantum algorithms based on quantum walks of a finite time horizon. It is shown that given a quantum network, there exists a control theoretical expression of the quantum system and the transition probability of the quantum walk is related to a norm of the associated transfer function.

Neural Network Molecule: a Solution of the Inverse Biometry Problem through Software Support of Quantum Superposition on Outputs of the Network of Artificial Neurons

Directory of Open Access Journals (Sweden)

Vladimir I. Volchikhin

2017-12-01

Full Text Available Introduction: The aim of the study is to accelerate the solution of neural network biometrics inverse problem on an ordinary desktop computer. Materials and Methods: To speed up the calculations, the artificial neural network is introduced into the dynamic mode of “jittering” of the states of all 256 output bits. At the same time, too many output states of the neural network are logarithmically folded by transitioning to the Hamming distance space between the code of the image “Own” and the codes of the images “Alien”. From the database of images of “Alien” 2.5 % of the most similar images are selected. In the next generation, 97.5 % of the discarded images are restored with GOST R 52633.2-2010 procedures by crossing parent images and obtaining descendant images from them. Results: Over a period of about 10 minutes, 60 generations of directed search for the solution of the inverse problem can be realized that allows inversing matrices of neural network functionals of dimension 416 inputs to 256 outputs with restoration of up to 97 % information on unknown biometric parameters of the image “Own”. Discussion and Conclusions: Supporting for 10 minutes of computer time the 256 qubit quantum superposition allows on a conventional computer to bypass the actual infinity of analyzed states in 5050 (50 to 50 times more than the same computer could process realizing the usual calculations. The increase in the length of the supported quantum superposition by 40 qubits is equivalent to increasing the processor clock speed by about a billion times. It is for this reason that it is more profitable to increase the number of quantum superpositions supported by the software emulator in comparison with the creation of a more powerful processor.

Twitter, Facebook, and Ten Red Balloons: Social Network Problem Solving and Homeland Security

OpenAIRE

Ford, Christopher M.

2011-01-01

This article appeared in Homeland Security Affairs (February 2011), v.7 no.1 This essay, the winner of the Center for Homeland Defense and Security (CHDS) Essay Contest in 2010, looks at how homeland security could benefit from crowd-sourced applications accessed through social networking tools such as Twitter and Facebook. Christopher M. Ford looks at the apparent efficacy of two such endeavors: the Defense Advanced Research Projects Agency'۪s (DARPA) competition to find ten 8-foot balloo...

Overcoming the sign problem at finite temperature: Quantum tensor network for the orbital eg model on an infinite square lattice

Science.gov (United States)

Czarnik, Piotr; Dziarmaga, Jacek; Oleś, Andrzej M.

2017-07-01

The variational tensor network renormalization approach to two-dimensional (2D) quantum systems at finite temperature is applied to a model suffering the notorious quantum Monte Carlo sign problem—the orbital eg model with spatially highly anisotropic orbital interactions. Coarse graining of the tensor network along the inverse temperature β yields a numerically tractable 2D tensor network representing the Gibbs state. Its bond dimension D —limiting the amount of entanglement—is a natural refinement parameter. Increasing D we obtain a converged order parameter and its linear susceptibility close to the critical point. They confirm the existence of finite order parameter below the critical temperature Tc, provide a numerically exact estimate of Tc, and give the critical exponents within 1 % of the 2D Ising universality class.

Hierarchical surface code for network quantum computing with modules of arbitrary size

Science.gov (United States)

Li, Ying; Benjamin, Simon C.

2016-10-01

The network paradigm for quantum computing involves interconnecting many modules to form a scalable machine. Typically it is assumed that the links between modules are prone to noise while operations within modules have a significantly higher fidelity. To optimize fault tolerance in such architectures we introduce a hierarchical generalization of the surface code: a small "patch" of the code exists within each module and constitutes a single effective qubit of the logic-level surface code. Errors primarily occur in a two-dimensional subspace, i.e., patch perimeters extruded over time, and the resulting noise threshold for intermodule links can exceed ˜10 % even in the absence of purification. Increasing the number of qubits within each module decreases the number of qubits necessary for encoding a logical qubit. But this advantage is relatively modest, and broadly speaking, a "fine-grained" network of small modules containing only about eight qubits is competitive in total qubit count versus a "course" network with modules containing many hundreds of qubits.

Nanophotonic rare-earth quantum memory with optically controlled retrieval

Science.gov (United States)

Zhong, Tian; Kindem, Jonathan M.; Bartholomew, John G.; Rochman, Jake; Craiciu, Ioana; Miyazono, Evan; Bettinelli, Marco; Cavalli, Enrico; Verma, Varun; Nam, Sae Woo; Marsili, Francesco; Shaw, Matthew D.; Beyer, Andrew D.; Faraon, Andrei

2017-09-01

Optical quantum memories are essential elements in quantum networks for long-distance distribution of quantum entanglement. Scalable development of quantum network nodes requires on-chip qubit storage functionality with control of the readout time. We demonstrate a high-fidelity nanophotonic quantum memory based on a mesoscopic neodymium ensemble coupled to a photonic crystal cavity. The nanocavity enables >95% spin polarization for efficient initialization of the atomic frequency comb memory and time bin-selective readout through an enhanced optical Stark shift of the comb frequencies. Our solid-state memory is integrable with other chip-scale photon source and detector devices for multiplexed quantum and classical information processing at the network nodes.

Towards a quantum internet

Science.gov (United States)

Dür, Wolfgang; Lamprecht, Raphael; Heusler, Stefan

2017-07-01

A long-range quantum communication network is among the most promising applications of emerging quantum technologies. We discuss the potential of such a quantum internet for the secure transmission of classical and quantum information, as well as theoretical and experimental approaches and recent advances to realize them. We illustrate the involved concepts such as error correction, teleportation or quantum repeaters and consider an approach to this topic based on catchy visualizations as a context-based, modern treatment of quantum theory at high school.

Experimental entanglement of 25 individually accessible atomic quantum interfaces.

Science.gov (United States)

Pu, Yunfei; Wu, Yukai; Jiang, Nan; Chang, Wei; Li, Chang; Zhang, Sheng; Duan, Luming

2018-04-01

A quantum interface links the stationary qubits in a quantum memory with flying photonic qubits in optical transmission channels and constitutes a critical element for the future quantum internet. Entanglement of quantum interfaces is an important step for the realization of quantum networks. Through heralded detection of photon interference, we generate multipartite entanglement between 25 (or 9) individually addressable quantum interfaces in a multiplexed atomic quantum memory array and confirm genuine 22-partite (or 9-partite) entanglement. This experimental entanglement of a record-high number of individually addressable quantum interfaces makes an important step toward the realization of quantum networks, long-distance quantum communication, and multipartite quantum information processing.

Two-dimensional quantum repeaters

Science.gov (United States)

Wallnöfer, J.; Zwerger, M.; Muschik, C.; Sangouard, N.; Dür, W.

2016-11-01

The endeavor to develop quantum networks gave rise to a rapidly developing field with far-reaching applications such as secure communication and the realization of distributed computing tasks. This ultimately calls for the creation of flexible multiuser structures that allow for quantum communication between arbitrary pairs of parties in the network and facilitate also multiuser applications. To address this challenge, we propose a two-dimensional quantum repeater architecture to establish long-distance entanglement shared between multiple communication partners in the presence of channel noise and imperfect local control operations. The scheme is based on the creation of self-similar multiqubit entanglement structures at growing scale, where variants of entanglement swapping and multiparty entanglement purification are combined to create high-fidelity entangled states. We show how such networks can be implemented using trapped ions in cavities.

Emergent Braided Matter of Quantum Geometry

Directory of Open Access Journals (Sweden)

Sundance Bilson-Thompson

2012-03-01

Full Text Available We review and present a few new results of the program of emergent matter as braid excitations of quantum geometry that is represented by braided ribbon networks. These networks are a generalisation of the spin networks proposed by Penrose and those in models of background independent quantum gravity theories, such as Loop Quantum Gravity and Spin Foam models. This program has been developed in two parallel but complimentary schemes, namely the trivalent and tetravalent schemes. The former studies the braids on trivalent braided ribbon networks, while the latter investigates the braids on tetravalent braided ribbon networks. Both schemes have been fruitful. The trivalent scheme has been quite successful at establishing a correspondence between braids and Standard Model particles, whereas the tetravalent scheme has naturally substantiated a rich, dynamical theory of interactions and propagation of braids, which is ruled by topological conservation laws. Some recent advances in the program indicate that the two schemes may converge to yield a fundamental theory of matter in quantum spacetime.

Quantum transport with long-range steps on Watts-Strogatz networks

Science.gov (United States)

Wang, Yan; Xu, Xin-Jian

2016-07-01

We study transport dynamics of quantum systems with long-range steps on the Watts-Strogatz network (WSN) which is generated by rewiring links of the regular ring. First, we probe physical systems modeled by the discrete nonlinear schrödinger (DNLS) equation. Using the localized initial condition, we compute the time-averaged occupation probability of the initial site, which is related to the nonlinearity, the long-range steps and rewiring links. Self-trapping transitions occur at large (small) nonlinear parameters for coupling ɛ=-1 (1), as long-range interactions are intensified. The structure disorder induced by random rewiring, however, has dual effects for ɛ=-1 and inhibits the self-trapping behavior for ɛ=1. Second, we investigate continuous-time quantum walks (CTQW) on the regular ring ruled by the discrete linear schrödinger (DLS) equation. It is found that only the presence of the long-range steps does not affect the efficiency of the coherent exciton transport, while only the allowance of random rewiring enhances the partial localization. If both factors are considered simultaneously, localization is greatly strengthened, and the transport becomes worse.

Implementing controlled-unitary operations over the butterfly network

Energy Technology Data Exchange (ETDEWEB)

Soeda, Akihito; Kinjo, Yoshiyuki; Turner, Peter S. [Department of Physics, Graduate School of Science, The University of Tokyo, Tokyo (Japan); Murao, Mio [Department of Physics, Graduate School of Science, The University of Tokyo, Tokyo, Japan and NanoQuine, The University of Tokyo, Tokyo (Japan)

2014-12-04

We introduce a multiparty quantum computation task over a network in a situation where the capacities of both the quantum and classical communication channels of the network are limited and a bottleneck occurs. Using a resource setting introduced by Hayashi [1], we present an efficient protocol for performing controlled-unitary operations between two input nodes and two output nodes over the butterfly network, one of the most fundamental networks exhibiting the bottleneck problem. This result opens the possibility of developing a theory of quantum network coding for multiparty quantum computation, whereas the conventional network coding only treats multiparty quantum communication.

Uncertainty measurement with belief entropy on interference effect in Quantum-Like Bayesian Networks

OpenAIRE

Huang, Zhiming; Yang, Lin; Jiang, Wen

2017-01-01

Social dilemmas have been regarded as the essence of evolution game theory, in which the prisoner's dilemma game is the most famous metaphor for the problem of cooperation. Recent findings revealed people's behavior violated the Sure Thing Principle in such games. Classic probability methodologies have difficulty explaining the underlying mechanisms of people's behavior. In this paper, a novel quantum-like Bayesian Network was proposed to accommodate the paradoxical phenomenon. The special ne...

Demonstration of measurement-only blind quantum computing

Science.gov (United States)

Greganti, Chiara; Roehsner, Marie-Christine; Barz, Stefanie; Morimae, Tomoyuki; Walther, Philip

2016-01-01

Blind quantum computing allows for secure cloud networks of quasi-classical clients and a fully fledged quantum server. Recently, a new protocol has been proposed, which requires a client to perform only measurements. We demonstrate a proof-of-principle implementation of this measurement-only blind quantum computing, exploiting a photonic setup to generate four-qubit cluster states for computation and verification. Feasible technological requirements for the client and the device-independent blindness make this scheme very applicable for future secure quantum networks.

Control, measurement and entanglement of remote quantum spin registers in diamond

NARCIS (Netherlands)

Bernien, H.

2014-01-01

A quantum network is the essential resource for distributed quantum computation and the enabling technology for secure quantum communication over large distances. Setting up such a network would require establishing quantum connections between local nodes which are capable of generating, processing

Phase Diagrams of Three-Dimensional Anderson and Quantum Percolation Models Using Deep Three-Dimensional Convolutional Neural Network

Science.gov (United States)

Mano, Tomohiro; Ohtsuki, Tomi

2017-11-01

The three-dimensional Anderson model is a well-studied model of disordered electron systems that shows the delocalization-localization transition. As in our previous papers on two- and three-dimensional (2D, 3D) quantum phase transitions [J. Phys. Soc. Jpn. 85, 123706 (2016), 86, 044708 (2017)], we used an image recognition algorithm based on a multilayered convolutional neural network. However, in contrast to previous papers in which 2D image recognition was used, we applied 3D image recognition to analyze entire 3D wave functions. We show that a full phase diagram of the disorder-energy plane is obtained once the 3D convolutional neural network has been trained at the band center. We further demonstrate that the full phase diagram for 3D quantum bond and site percolations can be drawn by training the 3D Anderson model at the band center.

Correlations in star networks: from Bell inequalities to network inequalities

International Nuclear Information System (INIS)

Tavakoli, Armin; Renou, Marc Olivier; Gisin, Nicolas; Brunner, Nicolas

2017-01-01

The problem of characterizing classical and quantum correlations in networks is considered. Contrary to the usual Bell scenario, where distant observers share a physical system emitted by one common source, a network features several independent sources, each distributing a physical system to a subset of observers. In the quantum setting, the observers can perform joint measurements on initially independent systems, which may lead to strong correlations across the whole network. In this work, we introduce a technique to systematically map a Bell inequality to a family of Bell-type inequalities bounding classical correlations on networks in a star-configuration. Also, we show that whenever a given Bell inequality can be violated by some entangled state ρ , then all the corresponding network inequalities can be violated by considering many copies of ρ distributed in the star network. The relevance of these ideas is illustrated by applying our method to a specific multi-setting Bell inequality. We derive the corresponding network inequalities, and study their quantum violations. (paper)

Demonstration of measurement-only blind quantum computing

International Nuclear Information System (INIS)

Greganti, Chiara; Roehsner, Marie-Christine; Barz, Stefanie; Walther, Philip; Morimae, Tomoyuki

2016-01-01

Blind quantum computing allows for secure cloud networks of quasi-classical clients and a fully fledged quantum server. Recently, a new protocol has been proposed, which requires a client to perform only measurements. We demonstrate a proof-of-principle implementation of this measurement-only blind quantum computing, exploiting a photonic setup to generate four-qubit cluster states for computation and verification. Feasible technological requirements for the client and the device-independent blindness make this scheme very applicable for future secure quantum networks. (paper)

Key on demand (KoD) for software-defined optical networks secured by quantum key distribution (QKD).

Science.gov (United States)

Cao, Yuan; Zhao, Yongli; Colman-Meixner, Carlos; Yu, Xiaosong; Zhang, Jie

2017-10-30

Software-defined optical networking (SDON) will become the next generation optical network architecture. However, the optical layer and control layer of SDON are vulnerable to cyberattacks. While, data encryption is an effective method to minimize the negative effects of cyberattacks, secure key interchange is its major challenge which can be addressed by the quantum key distribution (QKD) technique. Hence, in this paper we discuss the integration of QKD with WDM optical networks to secure the SDON architecture by introducing a novel key on demand (KoD) scheme which is enabled by a novel routing, wavelength and key assignment (RWKA) algorithm. The QKD over SDON with KoD model follows two steps to provide security: i) quantum key pools (QKPs) construction for securing the control channels (CChs) and data channels (DChs); ii) the KoD scheme uses RWKA algorithm to allocate and update secret keys for different security requirements. To test our model, we define a security probability index which measures the security gain in CChs and DChs. Simulation results indicate that the security performance of CChs and DChs can be enhanced by provisioning sufficient secret keys in QKPs and performing key-updating considering potential cyberattacks. Also, KoD is beneficial to achieve a positive balance between security requirements and key resource usage.

Multiscale Quantum Mechanics/Molecular Mechanics Simulations with Neural Networks.

Science.gov (United States)

Shen, Lin; Wu, Jingheng; Yang, Weitao

2016-10-11

Molecular dynamics simulation with multiscale quantum mechanics/molecular mechanics (QM/MM) methods is a very powerful tool for understanding the mechanism of chemical and biological processes in solution or enzymes. However, its computational cost can be too high for many biochemical systems because of the large number of ab initio QM calculations. Semiempirical QM/MM simulations have much higher efficiency. Its accuracy can be improved with a correction to reach the ab initio QM/MM level. The computational cost on the ab initio calculation for the correction determines the efficiency. In this paper we developed a neural network method for QM/MM calculation as an extension of the neural-network representation reported by Behler and Parrinello. With this approach, the potential energy of any configuration along the reaction path for a given QM/MM system can be predicted at the ab initio QM/MM level based on the semiempirical QM/MM simulations. We further applied this method to three reactions in water to calculate the free energy changes. The free-energy profile obtained from the semiempirical QM/MM simulation is corrected to the ab initio QM/MM level with the potential energies predicted with the constructed neural network. The results are in excellent accordance with the reference data that are obtained from the ab initio QM/MM molecular dynamics simulation or corrected with direct ab initio QM/MM potential energies. Compared with the correction using direct ab initio QM/MM potential energies, our method shows a speed-up of 1 or 2 orders of magnitude. It demonstrates that the neural network method combined with the semiempirical QM/MM calculation can be an efficient and reliable strategy for chemical reaction simulations.

Efficient quantum circuits for Szegedy quantum walks

Science.gov (United States)

Loke, T.; Wang, J. B.

2017-07-01

A major advantage in using Szegedy's formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov chain on a directed or weighted graph. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two classes of Markov chains that are amenable to this construction are cyclic permutations and complete bipartite graphs, for which we provide explicit efficient quantum circuit implementations. We also prove that our scheme can be applied to Markov chains formed by a tensor product. We also briefly discuss the implementation of Markov chains based on weighted interdependent networks. In addition, we apply this scheme to construct efficient quantum circuits simulating the Szegedy walks used in the quantum Pagerank algorithm for some classes of non-trivial graphs, providing a necessary tool for experimental demonstration of the quantum Pagerank algorithm.

Quantum cloning machines for equatorial qubits

International Nuclear Information System (INIS)

Fan Heng; Matsumoto, Keiji; Wang Xiangbin; Wadati, Miki

2002-01-01

Quantum cloning machines for equatorial qubits are studied. For the case of a one to two phase-covariant quantum cloning machine, we present the networks consisting of quantum gates to realize the quantum cloning transformations. The copied equatorial qubits are shown to be separable by using Peres-Horodecki criterion. The optimal one to M phase-covariant quantum cloning transformations are given

Quantum stopwatch: how to store time in a quantum memory.

Science.gov (United States)

Yang, Yuxiang; Chiribella, Giulio; Hayashi, Masahito

2018-05-01

Quantum mechanics imposes a fundamental trade-off between the accuracy of time measurements and the size of the systems used as clocks. When the measurements of different time intervals are combined, the errors due to the finite clock size accumulate, resulting in an overall inaccuracy that grows with the complexity of the set-up. Here, we introduce a method that, in principle, eludes the accumulation of errors by coherently transferring information from a quantum clock to a quantum memory of the smallest possible size. Our method could be used to measure the total duration of a sequence of events with enhanced accuracy, and to reduce the amount of quantum communication needed to stabilize clocks in a quantum network.

Measurement-device-independent quantum communication with an untrusted source

Science.gov (United States)

Xu, Feihu

2015-07-01

Measurement-device-independent quantum key distribution (MDI-QKD) can provide enhanced security compared to traditional QKD, and it constitutes an important framework for a quantum network with an untrusted network server. Still, a key assumption in MDI-QKD is that the sources are trusted. We propose here a MDI quantum network with a single untrusted source. We have derived a complete proof of the unconditional security of MDI-QKD with an untrusted source. Using simulations, we have considered various real-life imperfections in its implementation, and the simulation results show that MDI-QKD with an untrusted source provides a key generation rate that is close to the rate of initial MDI-QKD in the asymptotic setting. Our work proves the feasibility of the realization of a quantum network. The network users need only low-cost modulation devices, and they can share both an expensive detector and a complicated laser provided by an untrusted network server.

DARPA ADAMS Project

Science.gov (United States)

2015-05-11

it means that Mary distrusts John. We showed that it is possible to analyze such trust- distrust relationships within signed social networks in... relationship problems) − Professional Problems (negative changes at workplace, interpersonal conflicts) Furthermore, we encode in 2nd degree variables...a social media forum data. • Processed initial set of Vegas metrics data (clustering coefficient, # similar users, # skip levels) through time

Categorical Tensor Network States

Directory of Open Access Journals (Sweden)

Jacob D. Biamonte

2011-12-01

Full Text Available We examine the use of string diagrams and the mathematics of category theory in the description of quantum states by tensor networks. This approach lead to a unification of several ideas, as well as several results and methods that have not previously appeared in either side of the literature. Our approach enabled the development of a tensor network framework allowing a solution to the quantum decomposition problem which has several appealing features. Specifically, given an n-body quantum state |ψ〉, we present a new and general method to factor |ψ〉 into a tensor network of clearly defined building blocks. We use the solution to expose a previously unknown and large class of quantum states which we prove can be sampled efficiently and exactly. This general framework of categorical tensor network states, where a combination of generic and algebraically defined tensors appear, enhances the theory of tensor network states.

Quantum dot-based local field imaging reveals plasmon-based interferometric logic in silver nanowire networks.

Science.gov (United States)

Wei, Hong; Li, Zhipeng; Tian, Xiaorui; Wang, Zhuoxian; Cong, Fengzi; Liu, Ning; Zhang, Shunping; Nordlander, Peter; Halas, Naomi J; Xu, Hongxing

2011-02-09

We show that the local electric field distribution of propagating plasmons along silver nanowires can be imaged by coating the nanowires with a layer of quantum dots, held off the surface of the nanowire by a nanoscale dielectric spacer layer. In simple networks of silver nanowires with two optical inputs, control of the optical polarization and phase of the input fields directs the guided waves to a specific nanowire output. The QD-luminescent images of these structures reveal that a complete family of phase-dependent, interferometric logic functions can be performed on these simple networks. These results show the potential for plasmonic waveguides to support compact interferometric logic operations.

Utilizing Maximal Independent Sets as Dominating Sets in Scale-Free Networks

Science.gov (United States)

Derzsy, N.; Molnar, F., Jr.; Szymanski, B. K.; Korniss, G.

Dominating sets provide key solution to various critical problems in networked systems, such as detecting, monitoring, or controlling the behavior of nodes. Motivated by graph theory literature [Erdos, Israel J. Math. 4, 233 (1966)], we studied maximal independent sets (MIS) as dominating sets in scale-free networks. We investigated the scaling behavior of the size of MIS in artificial scale-free networks with respect to multiple topological properties (size, average degree, power-law exponent, assortativity), evaluated its resilience to network damage resulting from random failure or targeted attack [Molnar et al., Sci. Rep. 5, 8321 (2015)], and compared its efficiency to previously proposed dominating set selection strategies. We showed that, despite its small set size, MIS provides very high resilience against network damage. Using extensive numerical analysis on both synthetic and real-world (social, biological, technological) network samples, we demonstrate that our method effectively satisfies four essential requirements of dominating sets for their practical applicability on large-scale real-world systems: 1.) small set size, 2.) minimal network information required for their construction scheme, 3.) fast and easy computational implementation, and 4.) resiliency to network damage. Supported by DARPA, DTRA, and NSF.

Strategies for state-dependent quantum deleting

International Nuclear Information System (INIS)

Song Wei; Yang Ming; Cao Zhuoliang

2004-01-01

A quantum state-dependent quantum deleting machine is constructed. We obtain a upper bound of the global fidelity on N-to-M quantum deleting from a set of K non-orthogonal states. Quantum networks are constructed for the above state-dependent quantum deleting machine when K=2. Our deleting protocol only involves a unitary interaction among the initial copies, with no ancilla. We also present some analogies between quantum cloning and deleting

Cryptanalysis and improvement of quantum secure communication network protocol with entangled photons for mobile communications

International Nuclear Information System (INIS)

Gao, Gan

2014-01-01

Recently, a communication protocol called controlled bidirectional quantum secret direct communication for mobile networks was proposed by Chou et al (2014 Mobile Netw. Appl. 19 121). We study the security of the proposed communication protocol and find that it is not secure. The controller, Telecom Company, may eavesdrop secret messages from mobile devices without being detected. Finally, we give a possible improvement of the communication protocol. (paper)

A dynamically reconfigurable logic cell: from artificial neural networks to quantum-dot cellular automata

Science.gov (United States)

Naqvi, Syed Rameez; Akram, Tallha; Iqbal, Saba; Haider, Sajjad Ali; Kamran, Muhammad; Muhammad, Nazeer

2018-02-01

Considering the lack of optimization support for Quantum-dot Cellular Automata, we propose a dynamically reconfigurable logic cell capable of implementing various logic operations by means of artificial neural networks. The cell can be reconfigured to any 2-input combinational logic gate by altering the strength of connections, called weights and biases. We demonstrate how these cells may appositely be organized to perform multi-bit arithmetic and logic operations. The proposed work is important in that it gives a standard implementation of an 8-bit arithmetic and logic unit for quantum-dot cellular automata with minimal area and latency overhead. We also compare the proposed design with a few existing arithmetic and logic units, and show that it is more area efficient than any equivalent available in literature. Furthermore, the design is adaptable to 16, 32, and 64 bit architectures.

Efficient quantum circuits for Szegedy quantum walks

International Nuclear Information System (INIS)

Loke, T.; Wang, J.B.

2017-01-01

A major advantage in using Szegedy’s formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov chain on a directed or weighted graph. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two classes of Markov chains that are amenable to this construction are cyclic permutations and complete bipartite graphs, for which we provide explicit efficient quantum circuit implementations. We also prove that our scheme can be applied to Markov chains formed by a tensor product. We also briefly discuss the implementation of Markov chains based on weighted interdependent networks. In addition, we apply this scheme to construct efficient quantum circuits simulating the Szegedy walks used in the quantum Pagerank algorithm for some classes of non-trivial graphs, providing a necessary tool for experimental demonstration of the quantum Pagerank algorithm. - Highlights: • A general theoretical framework for implementing Szegedy walks using quantum circuits. • Explicit efficient quantum circuit implementation of the Szegedy walk for several classes of graphs. • Efficient implementation of Szegedy walks for quantum page-ranking of a certain class of graphs.

Modern Quantum Technologies of Information Security

OpenAIRE

Korchenko, Oleksandr; Vasiliu, Yevhen; Gnatyuk, Sergiy

2010-01-01

In this paper, the systematisation and classification of modern quantum technologies of information security against cyber-terrorist attack are carried out. The characteristic of the basic directions of quantum cryptography from the viewpoint of the quantum technologies used is given. A qualitative analysis of the advantages and disadvantages of concrete quantum protocols is made. The current status of the problem of practical quantum cryptography use in telecommunication networks is consider...

Applied quantum cryptography

International Nuclear Information System (INIS)

Kollmitzer, Christian; Pivk, Mario

2010-01-01

Using the quantum properties of single photons to exchange binary keys between two partners for subsequent encryption of secret data is an absolutely novel technology. Only a few years ago quantum cryptography - or better: quantum key distribution - was the domain of basic research laboratories at universities. But during the last few years things changed. QKD left the laboratories and was picked up by more practical oriented teams that worked hard to develop a practically applicable technology out of the astonishing results of basic research. One major milestone towards a QKD technology was a large research and development project funded by the European Commission that aimed at combining quantum physics with complementary technologies that are necessary to create a technical solution: electronics, software, and network components were added within the project SECOQC (Development of a Global Network for Secure Communication based on Quantum Cryptography) that teamed up all expertise on European level to get a technology for future encryption. The practical application of QKD in a standard optical fibre network was demonstrated October 2008 in Vienna, giving a glimpse of the future of secure communication. Although many steps have still to be done in order to achieve a real mature technology, the corner stone for future secure communication is already laid. QKD will not be the Holy Grail of security, it will not be able to solve all problems for evermore. But QKD has the potential to replace one of the weakest parts of symmetric encryption: the exchange of the key. It can be proven that the key exchange process cannot be corrupted and that keys that are generated and exchanged quantum cryptographically will be secure for ever (as long as some additional conditions are kept). This book will show the state of the art of Quantum Cryptography and it will sketch how it can be implemented in standard communication infrastructure. The growing vulnerability of sensitive

Remote quantum entanglement between two micromechanical oscillators.

Science.gov (United States)

Riedinger, Ralf; Wallucks, Andreas; Marinković, Igor; Löschnauer, Clemens; Aspelmeyer, Markus; Hong, Sungkun; Gröblacher, Simon

2018-04-01

Entanglement, an essential feature of quantum theory that allows for inseparable quantum correlations to be shared between distant parties, is a crucial resource for quantum networks 1 . Of particular importance is the ability to distribute entanglement between remote objects that can also serve as quantum memories. This has been previously realized using systems such as warm 2,3 and cold atomic vapours 4,5 , individual atoms 6 and ions 7,8 , and defects in solid-state systems 9-11 . Practical communication applications require a combination of several advantageous features, such as a particular operating wavelength, high bandwidth and long memory lifetimes. Here we introduce a purely micromachined solid-state platform in the form of chip-based optomechanical resonators made of nanostructured silicon beams. We create and demonstrate entanglement between two micromechanical oscillators across two chips that are separated by 20 centimetres . The entangled quantum state is distributed by an optical field at a designed wavelength near 1,550 nanometres. Therefore, our system can be directly incorporated in a realistic fibre-optic quantum network operating in the conventional optical telecommunication band. Our results are an important step towards the development of large-area quantum networks based on silicon photonics.

Channel capacities versus entanglement measures in multiparty quantum states

International Nuclear Information System (INIS)

Sen, Aditi; Sen, Ujjwal

2010-01-01

For quantum states of two subsystems, highly entangled states have a higher capacity of transmitting classical as well as quantum information, and vice versa. We show that this is no more the case in general: Quantum capacities of multiaccess channels, motivated by communication in quantum networks, do not have any relation with genuine multiparty entanglement measures. Importantly, the statement is demonstrated for arbitrary multipartite entanglement measures. Along with revealing the structural richness of multiaccess channels, this gives us a tool to classify multiparty quantum states from the perspective of its usefulness in quantum networks, which cannot be visualized by any genuine multiparty entanglement measure.

Quantum Steering Beyond Instrumental Causal Networks

Science.gov (United States)

Nery, R. V.; Taddei, M. M.; Chaves, R.; Aolita, L.

2018-04-01

We theoretically predict, and experimentally verify with entangled photons, that outcome communication is not enough for hidden-state models to reproduce quantum steering. Hidden-state models with outcome communication correspond, in turn, to the well-known instrumental processes of causal inference but in the one-sided device-independent scenario of one black-box measurement device and one well-characterized quantum apparatus. We introduce one-sided device-independent instrumental inequalities to test against these models, with the appealing feature of detecting entanglement even when communication of the black box's measurement outcome is allowed. We find that, remarkably, these inequalities can also be violated solely with steering, i.e., without outcome communication. In fact, an efficiently computable formal quantifier—the robustness of noninstrumentality—naturally arises, and we prove that steering alone is enough to maximize it. Our findings imply that quantum theory admits a stronger form of steering than known until now, with fundamental as well as practical potential implications.

High-speed noise-free optical quantum memory

Science.gov (United States)

Kaczmarek, K. T.; Ledingham, P. M.; Brecht, B.; Thomas, S. E.; Thekkadath, G. S.; Lazo-Arjona, O.; Munns, J. H. D.; Poem, E.; Feizpour, A.; Saunders, D. J.; Nunn, J.; Walmsley, I. A.

2018-04-01

Optical quantum memories are devices that store and recall quantum light and are vital to the realization of future photonic quantum networks. To date, much effort has been put into improving storage times and efficiencies of such devices to enable long-distance communications. However, less attention has been devoted to building quantum memories which add zero noise to the output. Even small additional noise can render the memory classical by destroying the fragile quantum signatures of the stored light. Therefore, noise performance is a critical parameter for all quantum memories. Here we introduce an intrinsically noise-free quantum memory protocol based on two-photon off-resonant cascaded absorption (ORCA). We demonstrate successful storage of GHz-bandwidth heralded single photons in a warm atomic vapor with no added noise, confirmed by the unaltered photon-number statistics upon recall. Our ORCA memory meets the stringent noise requirements for quantum memories while combining high-speed and room-temperature operation with technical simplicity, and therefore is immediately applicable to low-latency quantum networks.

Quantum centrality testing on directed graphs via P T -symmetric quantum walks

Science.gov (United States)

Izaac, J. A.; Wang, J. B.; Abbott, P. C.; Ma, X. S.

2017-09-01

Various quantum-walk-based algorithms have been proposed to analyze and rank the centrality of graph vertices. However, issues arise when working with directed graphs: the resulting non-Hermitian Hamiltonian leads to nonunitary dynamics, and the total probability of the quantum walker is no longer conserved. In this paper, we discuss a method for simulating directed graphs using P T -symmetric quantum walks, allowing probability-conserving nonunitary evolution. This method is equivalent to mapping the directed graph to an undirected, yet weighted, complete graph over the same vertex set, and can be extended to cover interdependent networks of directed graphs. Previous work has shown centrality measures based on the continuous-time quantum walk provide an eigenvectorlike quantum centrality; using the P T -symmetric framework, we extend these centrality algorithms to directed graphs with a significantly reduced Hilbert space compared to previous proposals. In certain cases, this centrality measure provides an advantage over classical algorithms used in network analysis, for example, by breaking vertex rank degeneracy. Finally, we perform a statistical analysis over ensembles of random graphs, and show strong agreement with the classical PageRank measure on directed acyclic graphs.

Photonic Quantum Information Processing

International Nuclear Information System (INIS)

Walther, P.

2012-01-01

The advantage of the photon's mobility makes optical quantum system ideally suited for delegated quantum computation. I will present results for the realization for a measurement-based quantum network in a client-server environment, where quantum information is securely communicated and computed. Related to measurement-based quantum computing I will discuss a recent experiment showing that quantum discord can be used as resource for the remote state preparation, which might shine new light on the requirements for quantum-enhanced information processing. Finally, I will briefly review recent photonic quantum simulation experiments of four frustrated Heisenberg-interactions spins and present an outlook of feasible simulation experiments with more complex interactions or random walk structures. As outlook I will discuss the current status of new quantum technology for improving the scalability of photonic quantum systems by using superconducting single-photon detectors and tailored light-matter interactions. (author)

Quantum-information processing in disordered and complex quantum systems

International Nuclear Information System (INIS)

Sen, Aditi; Sen, Ujjwal; Ahufinger, Veronica; Briegel, Hans J.; Sanpera, Anna; Lewenstein, Maciej

2006-01-01

We study quantum information processing in complex disordered many body systems that can be implemented by using lattices of ultracold atomic gases and trapped ions. We demonstrate, first in the short range case, the generation of entanglement and the local realization of quantum gates in a disordered magnetic model describing a quantum spin glass. We show that in this case it is possible to achieve fidelities of quantum gates higher than in the classical case. Complex systems with long range interactions, such as ions chains or dipolar atomic gases, can be used to model neural network Hamiltonians. For such systems, where both long range interactions and disorder appear, it is possible to generate long range bipartite entanglement. We provide an efficient analytical method to calculate the time evolution of a given initial state, which in turn allows us to calculate its quantum correlations

Interdisciplinary and physics challenges of network theory

Science.gov (United States)

Bianconi, Ginestra

2015-09-01

Network theory has unveiled the underlying structure of complex systems such as the Internet or the biological networks in the cell. It has identified universal properties of complex networks, and the interplay between their structure and dynamics. After almost twenty years of the field, new challenges lie ahead. These challenges concern the multilayer structure of most of the networks, the formulation of a network geometry and topology, and the development of a quantum theory of networks. Making progress on these aspects of network theory can open new venues to address interdisciplinary and physics challenges including progress on brain dynamics, new insights into quantum technologies, and quantum gravity.

Sampling networks with prescribed degree correlations

Science.gov (United States)

Del Genio, Charo; Bassler, Kevin; Erdos, Péter; Miklos, István; Toroczkai, Zoltán

2014-03-01

A feature of a network known to affect its structural and dynamical properties is the presence of correlations amongst the node degrees. Degree correlations are a measure of how much the connectivity of a node influences the connectivity of its neighbours, and they are fundamental in the study of processes such as the spreading of information or epidemics, the cascading failures of damaged systems and the evolution of social relations. We introduce a method, based on novel mathematical results, that allows the exact sampling of networks where the number of connections between nodes of any given connectivity is specified. Our algorithm provides a weight associated to each sample, thereby allowing network observables to be measured according to any desired distribution, and it is guaranteed to always terminate successfully in polynomial time. Thus, our new approach provides a preferred tool for scientists to model complex systems of current relevance, and enables researchers to precisely study correlated networks with broad societal importance. CIDG acknowledges support by the European Commission's FP7 through grant No. 288021. KEB acknowledges support from the NSF through grant DMR?1206839. KEB, PE, IM and ZT acknowledge support from AFSOR and DARPA through grant FA?9550-12-1-0405.

High-rate measurement-device-independent quantum cryptography

DEFF Research Database (Denmark)

Pirandola, Stefano; Ottaviani, Carlo; Spedalieri, Gaetana

2015-01-01

Quantum cryptography achieves a formidable task - the remote distribution of secret keys by exploiting the fundamental laws of physics. Quantum cryptography is now headed towards solving the practical problem of constructing scalable and secure quantum networks. A significant step in this direction...

Quantum neural network-based EEG filtering for a brain-computer interface.

Science.gov (United States)

Gandhi, Vaibhav; Prasad, Girijesh; Coyle, Damien; Behera, Laxmidhar; McGinnity, Thomas Martin

2014-02-01

A novel neural information processing architecture inspired by quantum mechanics and incorporating the well-known Schrodinger wave equation is proposed in this paper. The proposed architecture referred to as recurrent quantum neural network (RQNN) can characterize a nonstationary stochastic signal as time-varying wave packets. A robust unsupervised learning algorithm enables the RQNN to effectively capture the statistical behavior of the input signal and facilitates the estimation of signal embedded in noise with unknown characteristics. The results from a number of benchmark tests show that simple signals such as dc, staircase dc, and sinusoidal signals embedded within high noise can be accurately filtered and particle swarm optimization can be employed to select model parameters. The RQNN filtering procedure is applied in a two-class motor imagery-based brain-computer interface where the objective was to filter electroencephalogram (EEG) signals before feature extraction and classification to increase signal separability. A two-step inner-outer fivefold cross-validation approach is utilized to select the algorithm parameters subject-specifically for nine subjects. It is shown that the subject-specific RQNN EEG filtering significantly improves brain-computer interface performance compared to using only the raw EEG or Savitzky-Golay filtered EEG across multiple sessions.

Experimental plug and play quantum coin flipping

Science.gov (United States)

Pappa, Anna; Jouguet, Paul; Lawson, Thomas; Chailloux, André; Legré, Matthieu; Trinkler, Patrick; Kerenidis, Iordanis; Diamanti, Eleni

2014-04-01

Performing complex cryptographic tasks will be an essential element in future quantum communication networks. These tasks are based on a handful of fundamental primitives, such as coin flipping, where two distrustful parties wish to agree on a randomly generated bit. Although it is known that quantum versions of these primitives can offer information-theoretic security advantages with respect to classical protocols, a demonstration of such an advantage in a practical communication scenario has remained elusive. Here we experimentally implement a quantum coin flipping protocol that performs strictly better than classically possible over a distance suitable for communication over metropolitan area optical networks. The implementation is based on a practical plug and play system, developed by significantly enhancing a commercial quantum key distribution device. Moreover, we provide combined quantum coin flipping protocols that are almost perfectly secure against bounded adversaries. Our results offer a useful toolbox for future secure quantum communications.

Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization

Energy Technology Data Exchange (ETDEWEB)

Imam, Neena [ORNL; Humble, Travis S. [ORNL; McCaskey, Alex [ORNL; Schrock, Jonathan [ORNL; Hamilton, Kathleen E. [ORNL

2017-09-01

A content-addressable memory (CAM) stores key-value associations such that the key is recalled by providing its associated value. While CAM recall is traditionally performed using recurrent neural network models, we show how to solve this problem using adiabatic quantum optimization. Our approach maps the recurrent neural network to a commercially available quantum processing unit by taking advantage of the common underlying Ising spin model. We then assess the accuracy of the quantum processor to store key-value associations by quantifying recall performance against an ensemble of problem sets. We observe that different learning rules from the neural network community influence recall accuracy but performance appears to be limited by potential noise in the processor. The strong connection established between quantum processors and neural network problems supports the growing intersection of these two ideas.

Genuine quantum correlations in quantum many-body systems: a review of recent progress.

Science.gov (United States)

De Chiara, Gabriele; Sanpera, Anna

2018-04-19

Quantum information theory has considerably helped in the understanding of quantum many-body systems. The role of quantum correlations and in particular, bipartite entanglement, has become crucial to characterise, classify and simulate quantum many body systems. Furthermore, the scaling of entanglement has inspired modifications to numerical techniques for the simulation of many-body systems leading to the, now established, area of tensor networks. However, the notions and methods brought by quantum information do not end with bipartite entanglement. There are other forms of correlations embedded in the ground, excited and thermal states of quantum many-body systems that also need to be explored and might be utilised as potential resources for quantum technologies. The aim of this work is to review the most recent developments regarding correlations in quantum many-body systems focussing on multipartite entanglement, quantum nonlocality, quantum discord, mutual information but also other non classical measures of correlations based on quantum coherence. Moreover, we also discuss applications of quantum metrology in quantum many-body systems. © 2018 IOP Publishing Ltd.

Chiral quantum optics.

Science.gov (United States)

Lodahl, Peter; Mahmoodian, Sahand; Stobbe, Søren; Rauschenbeutel, Arno; Schneeweiss, Philipp; Volz, Jürgen; Pichler, Hannes; Zoller, Peter

2017-01-25

Advanced photonic nanostructures are currently revolutionizing the optics and photonics that underpin applications ranging from light technology to quantum-information processing. The strong light confinement in these structures can lock the local polarization of the light to its propagation direction, leading to propagation-direction-dependent emission, scattering and absorption of photons by quantum emitters. The possibility of such a propagation-direction-dependent, or chiral, light-matter interaction is not accounted for in standard quantum optics and its recent discovery brought about the research field of chiral quantum optics. The latter offers fundamentally new functionalities and applications: it enables the assembly of non-reciprocal single-photon devices that can be operated in a quantum superposition of two or more of their operational states and the realization of deterministic spin-photon interfaces. Moreover, engineered directional photonic reservoirs could lead to the development of complex quantum networks that, for example, could simulate novel classes of quantum many-body systems.

Application of back-propagation artificial neural network (ANN) to predict crystallite size and band gap energy of ZnO quantum dots

Science.gov (United States)

Pelicano, Christian Mark; Rapadas, Nick; Cagatan, Gerard; Magdaluyo, Eduardo

2017-12-01

Herein, the crystallite size and band gap energy of zinc oxide (ZnO) quantum dots were predicted using artificial neural network (ANN). Three input factors including reagent ratio, growth time, and growth temperature were examined with respect to crystallite size and band gap energy as response factors. The generated results from neural network model were then compared with the experimental results. Experimental crystallite size and band gap energy of ZnO quantum dots were measured from TEM images and absorbance spectra, respectively. The Levenberg-Marquardt (LM) algorithm was used as the learning algorithm for the ANN model. The performance of the ANN model was then assessed through mean square error (MSE) and regression values. Based on the results, the ANN modelling results are in good agreement with the experimental data.

Quantum Transduction with Adaptive Control

Science.gov (United States)

Zhang, Mengzhen; Zou, Chang-Ling; Jiang, Liang

2018-01-01

Quantum transducers play a crucial role in hybrid quantum networks. A good quantum transducer can faithfully convert quantum signals from one mode to another with minimum decoherence. Most investigations of quantum transduction are based on the protocol of direct mode conversion. However, the direct protocol requires the matching condition, which in practice is not always feasible. Here we propose an adaptive protocol for quantum transducers, which can convert quantum signals without requiring the matching condition. The adaptive protocol only consists of Gaussian operations, feasible in various physical platforms. Moreover, we show that the adaptive protocol can be robust against imperfections associated with finite squeezing, thermal noise, and homodyne detection, and it can be implemented to realize quantum state transfer between microwave and optical modes.

Quantum Transduction with Adaptive Control.

Science.gov (United States)

Zhang, Mengzhen; Zou, Chang-Ling; Jiang, Liang

2018-01-12

Quantum transducers play a crucial role in hybrid quantum networks. A good quantum transducer can faithfully convert quantum signals from one mode to another with minimum decoherence. Most investigations of quantum transduction are based on the protocol of direct mode conversion. However, the direct protocol requires the matching condition, which in practice is not always feasible. Here we propose an adaptive protocol for quantum transducers, which can convert quantum signals without requiring the matching condition. The adaptive protocol only consists of Gaussian operations, feasible in various physical platforms. Moreover, we show that the adaptive protocol can be robust against imperfections associated with finite squeezing, thermal noise, and homodyne detection, and it can be implemented to realize quantum state transfer between microwave and optical modes.

Double Super-Exchange in Silicon Quantum Dots Connected by Short-Bridged Networks

Science.gov (United States)

Li, Huashan; Wu, Zhigang; Lusk, Mark

2013-03-01

Silicon quantum dots (QDs) with diameters in the range of 1-2 nm are attractive for photovoltaic applications. They absorb photons more readily, transport excitons with greater efficiency, and show greater promise in multiple-exciton generation and hot carrier collection paradigms. However, their high excitonic binding energy makes it difficult to dissociate excitons into separate charge carriers. One possible remedy is to create dot assemblies in which a second material creates a Type-II heterojunction with the dot so that exciton dissociation occurs locally. This talk will focus on such a Type-II heterojunction paradigm in which QDs are connected via covalently bonded, short-bridge molecules. For such interpenetrating networks of dots and molecules, our first principles computational investigation shows that it is possible to rapidly and efficiently separate electrons to QDs and holes to bridge units. The bridge network serves as an efficient mediator of electron superexchange between QDs while the dots themselves play the complimentary role of efficient hole superexchange mediators. Dissociation, photoluminescence and carrier transport rates will be presented for bridge networks of silicon QDs that exhibit such double superexchange. This material is based upon work supported by the Renewable Energy Materials Research Science and Engineering Center (REMRSEC) under Grant No. DMR-0820518 and Golden Energy Computing Organization (GECO).

An Identity-Based Anti-Quantum Privacy-Preserving Blind Authentication in Wireless Sensor Networks.

Science.gov (United States)

Zhu, Hongfei; Tan, Yu-An; Zhu, Liehuang; Wang, Xianmin; Zhang, Quanxin; Li, Yuanzhang

2018-05-22

With the development of wireless sensor networks, IoT devices are crucial for the Smart City; these devices change people's lives such as e-payment and e-voting systems. However, in these two systems, the state-of-art authentication protocols based on traditional number theory cannot defeat a quantum computer attack. In order to protect user privacy and guarantee trustworthy of big data, we propose a new identity-based blind signature scheme based on number theorem research unit lattice, this scheme mainly uses a rejection sampling theorem instead of constructing a trapdoor. Meanwhile, this scheme does not depend on complex public key infrastructure and can resist quantum computer attack. Then we design an e-payment protocol using the proposed scheme. Furthermore, we prove our scheme is secure in the random oracle, and satisfies confidentiality, integrity, and non-repudiation. Finally, we demonstrate that the proposed scheme outperforms the other traditional existing identity-based blind signature schemes in signing speed and verification speed, outperforms the other lattice-based blind signature in signing speed, verification speed, and signing secret key size.

An Identity-Based Anti-Quantum Privacy-Preserving Blind Authentication in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Hongfei Zhu

2018-05-01

Full Text Available With the development of wireless sensor networks, IoT devices are crucial for the Smart City; these devices change people’s lives such as e-payment and e-voting systems. However, in these two systems, the state-of-art authentication protocols based on traditional number theory cannot defeat a quantum computer attack. In order to protect user privacy and guarantee trustworthy of big data, we propose a new identity-based blind signature scheme based on number theorem research unit lattice, this scheme mainly uses a rejection sampling theorem instead of constructing a trapdoor. Meanwhile, this scheme does not depend on complex public key infrastructure and can resist quantum computer attack. Then we design an e-payment protocol using the proposed scheme. Furthermore, we prove our scheme is secure in the random oracle, and satisfies confidentiality, integrity, and non-repudiation. Finally, we demonstrate that the proposed scheme outperforms the other traditional existing identity-based blind signature schemes in signing speed and verification speed, outperforms the other lattice-based blind signature in signing speed, verification speed, and signing secret key size.

Temporal compression of quantum-information-carrying photons using a photon-echo quantum memory approach

International Nuclear Information System (INIS)

Moiseev, S. A.; Tittel, W.

2010-01-01

We study quantum compression and decompression of light pulses that carry quantum information using a photon-echo quantum memory technique with controllable inhomogeneous broadening of an isolated atomic absorption line. We investigate media with differently broadened absorption profiles, transverse and longitudinal, finding that the recall efficiency can be as large as unity and that the quantum information encoded into the photonic qubits can remain unperturbed. Our results provide insight into reversible light-atom interaction and are interesting in view of future quantum communication networks, where pulse compression and decompression may play an important role in increasing the qubit rate or in mapping quantum information from photonic carriers with large optical bandwidth into atomic memories with smaller bandwidth.

Photon-Mediated Quantum Gate between Two Neutral Atoms in an Optical Cavity

Science.gov (United States)

Welte, Stephan; Hacker, Bastian; Daiss, Severin; Ritter, Stephan; Rempe, Gerhard

2018-02-01

Quantum logic gates are fundamental building blocks of quantum computers. Their integration into quantum networks requires strong qubit coupling to network channels, as can be realized with neutral atoms and optical photons in cavity quantum electrodynamics. Here we demonstrate that the long-range interaction mediated by a flying photon performs a gate between two stationary atoms inside an optical cavity from which the photon is reflected. This single step executes the gate in 2 μ s . We show an entangling operation between the two atoms by generating a Bell state with 76(2)% fidelity. The gate also operates as a cnot. We demonstrate 74.1(1.6)% overlap between the observed and the ideal gate output, limited by the state preparation fidelity of 80.2(0.8)%. As the atoms are efficiently connected to a photonic channel, our gate paves the way towards quantum networking with multiqubit nodes and the distribution of entanglement in repeater-based long-distance quantum networks.

Photon-Mediated Quantum Gate between Two Neutral Atoms in an Optical Cavity

Directory of Open Access Journals (Sweden)

Stephan Welte

2018-02-01

Full Text Available Quantum logic gates are fundamental building blocks of quantum computers. Their integration into quantum networks requires strong qubit coupling to network channels, as can be realized with neutral atoms and optical photons in cavity quantum electrodynamics. Here we demonstrate that the long-range interaction mediated by a flying photon performs a gate between two stationary atoms inside an optical cavity from which the photon is reflected. This single step executes the gate in 2  μs. We show an entangling operation between the two atoms by generating a Bell state with 76(2% fidelity. The gate also operates as a cnot. We demonstrate 74.1(1.6% overlap between the observed and the ideal gate output, limited by the state preparation fidelity of 80.2(0.8%. As the atoms are efficiently connected to a photonic channel, our gate paves the way towards quantum networking with multiqubit nodes and the distribution of entanglement in repeater-based long-distance quantum networks.

Improving Continuous-Variable Measurement-Device-Independent Multipartite Quantum Communication with Optical Amplifiers*

Science.gov (United States)

Guo, Ying; Zhao, Wei; Li, Fei; Huang, Duan; Liao, Qin; Xie, Cai-Lang

2017-08-01

The developing tendency of continuous-variable (CV) measurement-device-independent (MDI) quantum cryptography is to cope with the practical issue of implementing scalable quantum networks. Up to now, most theoretical and experimental researches on CV-MDI QKD are focused on two-party protocols. However, we suggest a CV-MDI multipartite quantum secret sharing (QSS) protocol use the EPR states coupled with optical amplifiers. More remarkable, QSS is the real application in multipartite CV-MDI QKD, in other words, is the concrete implementation method of multipartite CV-MDI QKD. It can implement a practical quantum network scheme, under which the legal participants create the secret correlations by using EPR states connecting to an untrusted relay via insecure links and applying the multi-entangled Greenberger-Horne-Zeilinger (GHZ) state analysis at relay station. Even if there is a possibility that the relay may be completely tampered, the legal participants are still able to extract a secret key from network communication. The numerical simulation indicates that the quantum network communication can be achieved in an asymmetric scenario, fulfilling the demands of a practical quantum network. Additionally, we illustrate that the use of optical amplifiers can compensate the partial inherent imperfections of detectors and increase the transmission distance of the CV-MDI quantum system.

Authenticated multi-user quantum key distribution with single particles

Science.gov (United States)

Lin, Song; Wang, Hui; Guo, Gong-De; Ye, Guo-Hua; Du, Hong-Zhen; Liu, Xiao-Fen

2016-03-01

Quantum key distribution (QKD) has been growing rapidly in recent years and becomes one of the hottest issues in quantum information science. During the implementation of QKD on a network, identity authentication has been one main problem. In this paper, an efficient authenticated multi-user quantum key distribution (MQKD) protocol with single particles is proposed. In this protocol, any two users on a quantum network can perform mutual authentication and share a secure session key with the assistance of a semi-honest center. Meanwhile, the particles, which are used as quantum information carriers, are not required to be stored, therefore the proposed protocol is feasible with current technology. Finally, security analysis shows that this protocol is secure in theory.

Quantum transport through complex networks - from light-harvesting proteins to semiconductor devices

Energy Technology Data Exchange (ETDEWEB)

Kreisbeck, Christoph

2012-06-18

Electron transport through small systems in semiconductor devices plays an essential role for many applications in micro-electronics. One focus of current research lies on establishing conceptually new devices based on ballistic transport in high mobility AlGaAs/AlGa samples. In the ballistic regime, the transport characteristics are determined by coherent interference effects. In order to guide experimentalists to an improved device design, the characterization and understanding of intrinsic device properties is crucial. We develop a time-dependent approach that allows us to simulate experimentally fabricated, complex devicegeometries with an extension of up to a few micrometers. Particularly, we explore the physical origin of unexpected effects that have been detected in recent experiments on transport through Aharonov-Bohm waveguide-interferometers. Such interferometers can be configured as detectors for transfer properties of embedded quantum systems. We demonstrate that a four-terminal waveguide-ring is a suitable setup for measuring the transmission phase of a harmonic quantum dot. Quantum effects are not restricted exclusively to artificial devices but have been found in biological systems as well. Pioneering experiments reveal quantum effects in light-harvesting complexes, the building blocks of photosynthesis. We discuss the Fenna-Matthews-Olson complex, which is a network of coupled bacteriochlorophylls. It acts as an energy wire in the photosynthetic apparatus of green sulfur bacteria. Recent experimental findings suggest that energy transfer takes place in the form of coherent wave-like motion, rather than through classical hopping from one bacteriochlorophyll to the next. However, the question of why and how coherent transfer emerges in light-harvesting complexes is still open. The challenge is to merge seemingly contradictory features that are observed in experiments on two-dimensional spectroscopy into a consistent theory. Here, we provide such a

How to Build a Quantum Computer

Science.gov (United States)

Sanders, Barry C.

2017-11-01

Quantum computer technology is progressing rapidly with dozens of qubits and hundreds of quantum logic gates now possible. Although current quantum computer technology is distant from being able to solve computational problems beyond the reach of non-quantum computers, experiments have progressed well beyond simply demonstrating the requisite components. We can now operate small quantum logic processors with connected networks of qubits and quantum logic gates, which is a great stride towards functioning quantum computers. This book aims to be accessible to a broad audience with basic knowledge of computers, electronics and physics. The goal is to convey key notions relevant to building quantum computers and to present state-of-the-art quantum-computer research in various media such as trapped ions, superconducting circuits, photonics and beyond.

A universal quantum module for quantum communication, computation, and metrology

Science.gov (United States)

Hanks, Michael; Lo Piparo, Nicolò; Trupke, Michael; Schmiedmayer, Jorg; Munro, William J.; Nemoto, Kae

2017-08-01

In this work, we describe a simple module that could be ubiquitous for quantum information based applications. The basic modules comprises a single NV- center in diamond embedded in an optical cavity, where the cavity mediates interactions between photons and the electron spin (enabling entanglement distribution and efficient readout), while the nuclear spins constitutes a long-lived quantum memories capable of storing and processing quantum information. We discuss how a network of connected modules can be used for distributed metrology, communication and computation applications. Finally, we investigate the possible use of alternative diamond centers (SiV/GeV) within the module and illustrate potential advantages.

Quantum tele-amplification with a continuous-variable superposition state

DEFF Research Database (Denmark)

Neergaard-Nielsen, Jonas S.; Eto, Yujiro; Lee, Chang-Woo

2013-01-01

-enhanced functions such as coherent-state quantum computing (CSQC), quantum metrology and a quantum repeater could be realized in the networks. Optical cat states are now routinely generated in laboratories. An important next challenge is to use them for implementing the aforementioned functions. Here, we......Optical coherent states are classical light fields with high purity, and are essential carriers of information in optical networks. If these states could be controlled in the quantum regime, allowing for their quantum superposition (referred to as a Schrödinger-cat state), then novel quantum...... demonstrate a basic CSQC protocol, where a cat state is used as an entanglement resource for teleporting a coherent state with an amplitude gain. We also show how this can be extended to a loss-tolerant quantum relay of multi-ary phase-shift keyed coherent states. These protocols could be useful in both...

Dynamics and thermodynamics of linear quantum open systems.

Science.gov (United States)

Martinez, Esteban A; Paz, Juan Pablo

2013-03-29

We analyze the evolution of the quantum state of networks of quantum oscillators coupled with arbitrary external environments. We show that the reduced density matrix of the network always obeys a local master equation with a simple analytical solution. We use this to study the emergence of thermodynamical laws in the long time regime demonstrating two main results: First, we show that it is impossible to build a quantum absorption refrigerator using linear networks (thus, nonlinearity is an essential resource for such refrigerators recently studied by Levy and Kosloff [Phys. Rev. Lett. 108, 070604 (2012)] and Levy et al. [Phys. Rev. B 85, 061126 (2012)]). Then, we show that the third law imposes constraints on the low frequency behavior of the environmental spectral densities.

Quantum bus of metal nanoring with surface plasmon polaritons

International Nuclear Information System (INIS)

Lin Zhirong; Guo Guoping; Tu Tao; Li Haiou; Zou Changling; Ren Xifeng; Guo Guangcan; Chen Junxue; Lu Yonghua

2010-01-01

We develop an architecture for distributed quantum computation using quantum bus of plasmonic circuits and spin qubits in self-assembled quantum dots. Deterministic quantum gates between two distant spin qubits can be reached by using an adiabatic approach in which quantum dots couple with highly detuned plasmon modes in a metallic nanoring. Plasmonic quantum bus offers a robust and scalable platform for quantum optics experiments and the development of on-chip quantum networks composed of various quantum nodes, such as quantum dots, molecules, and nanoparticles.

Quantum memory Quantum memory

Science.gov (United States)

Le Gouët, Jean-Louis; Moiseev, Sergey

2012-06-01

quest for higher efficiency, better fidelity, broader bandwidth, multimode capacity and longer storage lifetime is pursued in all those approaches, as shown in this special issue. The improvement of quantum memory operation specifically requires in-depth study and control of numerous physical processes leading to atomic decoherence. The present issue reflects the development of rare earth ion doped matrices offering long lifetime superposition states, either as bulk crystals or as optical waveguides. The need for quantum sources and high efficiency detectors at the single photon level is also illustrated. Several papers address the networking of quantum memories either in long-haul cryptography or in the prospect of quantum processing. In this context, much attention has been paid recently to interfacing quantum light with superconducting qubits and with nitrogen-vacancy centers in diamond. Finally, the quantum interfacing of light with matter raises questions on entanglement. The last two papers are devoted to the generation of entanglement by dissipative processes. It is shown that long lifetime entanglement may be built in this way. We hope this special issue will help readers to become familiar with the exciting field of ensemble-based quantum memories and will stimulate them to bring deeper insights and new ideas to this area.

Quantum Graph Analysis

Energy Technology Data Exchange (ETDEWEB)

Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2016-01-01

In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.

Causality, relativity and quantum correlation experiments with ...

Indian Academy of Sciences (India)

gled photons are sent via an optical fiber network to two villages near Geneva, separated ... Quantum information processing; quantum communication. ... situation is presented as follows: The system that undergoes a measurement first, let us.

EDITORIAL: Fluctuations and noise in photonics and quantum optics: a special issue in memory of Hermann Haus

Science.gov (United States)

Abbott, Derek; Shapiro, Jeffrey H.; Yamamoto, Yoshihisa

2004-08-01

This Special Issue of Journal of Optics B: Quantum and Semiclassical Optics brings together the contributions of various researchers working on theoretical and experimental aspects of fluctuational phenomena in photonics and quantum optics. The topics discussed in this issue extend from fundamental physics to applications of noise and fluctuational methods from quantum to classical systems, and include: bullet Quantum measurement bullet Quantum squeezing bullet Solitons and fibres bullet Gravitational wave inferometers bullet Fluorescence phenomena bullet Cavity QED bullet Photon statistics bullet Noise in lasers and laser systems bullet Quantum computing and information bullet Quantum lithography bullet Teleportation. This Special Issue is published in connection with the SPIE International Symposium on Fluctuations and Noise, held in Santa Fe, New Mexico, on 1-4 June 2003. The symposium contained six parallel conferences, and the papers in this Special Issue are connected to the conference entitled `Fluctuations and Noise in Photonics and Quantum Optics'. This was the first in a series of symposia organized with the support of the SPIE that have greatly contributed to progress in this area. The co-founders of the symposium series were Laszlo B Kish (Texas A&M University) and Derek Abbott (The University of Adelaide). The Chairs of the `Fluctuations and Noise in Photonics and Quantum Optics' conference were Derek Abbott, Jeffrey H Shapiro and Yoshihisa Yamamoto. The practical aspects of the organization were ably handled by Kristi Kelso and Marilyn Gorsuch of the SPIE, USA. Sadly, less than two weeks before the conference, Hermann A Haus passed away. Hermann Haus was a founding father of the field of noise in optics and quantum optics. He submitted three papers to the conference and was very excited to attend; as can be seen in the collection of papers, he was certainly present in spirit. In honour of his creativity and pioneering work in this field, we have

Multiparty-controlled quantum secure direct communication

International Nuclear Information System (INIS)

Xiu, X.-M.; Dong, L.; Gao, Y.-J.; Chi, F.

2007-01-01

A theoretical scheme of a multiparty-controlled quantum secure direct communication is proposed. The supervisor prepares a communication network with Einstein-Podolsky-Rosen pairs and auxiliary particles. After passing a security test of the communication network, a supervisor tells the users the network is secure and they can communicate. If the controllers allow the communicators to communicate, the controllers should perform measurements and inform the communicators of the outcomes. The communicators then begin to communicate after they perform a security test of the quantum channel and verify that it is secure. The recipient can decrypt the secret message in a classical message from the sender depending on the protocol. Any two users in the network can communicate through the above processes under the control of the supervisor and the controllers

Multi-photon entanglement and applications in quantum information

Energy Technology Data Exchange (ETDEWEB)

Schmid, Christian I.T.

2008-05-30

In this thesis, two new linear optics networks are introduced and their application for several quantum information tasks is presented. Spontaneous parametric down conversion, is used in different configurations to provide the input states for the networks. The first network is a new design of a controlled phase gate which is particularly interesting for applications in multi-photon experiments as it constitutes an improvement of former realizations with respect to stability and reliability. This is explicitly demonstrated by employing the gate in four-photon experiments. In this context, a teleportation and entanglement swapping protocol is performed in which all four Bell states are distinguished by means of the phase gate. A similar type of measurement applied to the subsystem parts of two copies of a quantum state, allows further the direct estimation of the state's entanglement in terms of its concurrence. Finally, starting from two Bell states, the controlled phase gate is applied for the observation of a four photon cluster state. The analysis of the results focuses on measurement based quantum computation, the main usage of cluster states. The second network, fed with the second order emission of non-collinear type ii spontaneous parametric down conversion, constitutes a tunable source of a whole family of states. Up to now the observation of one particular state required one individually tailored setup. With the network introduced here many different states can be obtained within the same arrangement by tuning a single, easily accessible experimental parameter. These states exhibit many useful properties and play a central role in several applications of quantum information. Here, they are used for the solution of a four-player quantum Minority game. It is shown that, by employing four-qubit entanglement, the quantum version of the game clearly outperforms its classical counterpart. Experimental data obtained with both networks are utilized to

Multi-photon entanglement and applications in quantum information

International Nuclear Information System (INIS)

Schmid, Christian I.T.

2008-01-01

In this thesis, two new linear optics networks are introduced and their application for several quantum information tasks is presented. Spontaneous parametric down conversion, is used in different configurations to provide the input states for the networks. The first network is a new design of a controlled phase gate which is particularly interesting for applications in multi-photon experiments as it constitutes an improvement of former realizations with respect to stability and reliability. This is explicitly demonstrated by employing the gate in four-photon experiments. In this context, a teleportation and entanglement swapping protocol is performed in which all four Bell states are distinguished by means of the phase gate. A similar type of measurement applied to the subsystem parts of two copies of a quantum state, allows further the direct estimation of the state's entanglement in terms of its concurrence. Finally, starting from two Bell states, the controlled phase gate is applied for the observation of a four photon cluster state. The analysis of the results focuses on measurement based quantum computation, the main usage of cluster states. The second network, fed with the second order emission of non-collinear type ii spontaneous parametric down conversion, constitutes a tunable source of a whole family of states. Up to now the observation of one particular state required one individually tailored setup. With the network introduced here many different states can be obtained within the same arrangement by tuning a single, easily accessible experimental parameter. These states exhibit many useful properties and play a central role in several applications of quantum information. Here, they are used for the solution of a four-player quantum Minority game. It is shown that, by employing four-qubit entanglement, the quantum version of the game clearly outperforms its classical counterpart. Experimental data obtained with both networks are utilized to demonstrate

Error-resistant distributed quantum computation in a trapped ion chain

International Nuclear Information System (INIS)

Braungardt, Sibylle; Sen, Aditi; Sen, Ujjwal; Lewenstein, Maciej

2007-01-01

We consider experimentally feasible chains of trapped ions with pseudospin 1/2 and find models that can potentially be used to implement error-resistant quantum computation. Similar in spirit to classical neural networks, the error resistance of the system is achieved by encoding the qubits distributed over the whole system. We therefore call our system a quantum neural network and present a quantum neural network model of quantum computation. Qubits are encoded in a few quasi degenerated low-energy levels of the whole system, separated by a large gap from the excited states and large energy barriers between themselves. We investigate protocols for implementing a universal set of quantum logic gates in the system by adiabatic passage of a few low-lying energy levels of the whole system. Naturally appearing and potentially dangerous distributed noise in the system leaves the fidelity of the computation virtually unchanged, if it is not too strong. The computation is also naturally resilient to local perturbations of the spins

Continuous-variable quantum homomorphic signature

Science.gov (United States)

Li, Ke; Shang, Tao; Liu, Jian-wei

2017-10-01

Quantum cryptography is believed to be unconditionally secure because its security is ensured by physical laws rather than computational complexity. According to spectrum characteristic, quantum information can be classified into two categories, namely discrete variables and continuous variables. Continuous-variable quantum protocols have gained much attention for their ability to transmit more information with lower cost. To verify the identities of different data sources in a quantum network, we propose a continuous-variable quantum homomorphic signature scheme. It is based on continuous-variable entanglement swapping and provides additive and subtractive homomorphism. Security analysis shows the proposed scheme is secure against replay, forgery and repudiation. Even under nonideal conditions, it supports effective verification within a certain verification threshold.

Deterministically entangling multiple remote quantum memories inside an optical cavity

Science.gov (United States)

Yan, Zhihui; Liu, Yanhong; Yan, Jieli; Jia, Xiaojun

2018-01-01

Quantum memory for the nonclassical state of light and entanglement among multiple remote quantum nodes hold promise for a large-scale quantum network, however, continuous-variable (CV) memory efficiency and entangled degree are limited due to imperfect implementation. Here we propose a scheme to deterministically entangle multiple distant atomic ensembles based on CV cavity-enhanced quantum memory. The memory efficiency can be improved with the help of cavity-enhanced electromagnetically induced transparency dynamics. A high degree of entanglement among multiple atomic ensembles can be obtained by mapping the quantum state from multiple entangled optical modes into a collection of atomic spin waves inside optical cavities. Besides being of interest in terms of unconditional entanglement among multiple macroscopic objects, our scheme paves the way towards the practical application of quantum networks.

Applying long short-term memory recurrent neural networks to intrusion detection

Directory of Open Access Journals (Sweden)

Ralf C. Staudemeyer

2015-07-01

Full Text Available We claim that modelling network traffic as a time series with a supervised learning approach, using known genuine and malicious behaviour, improves intrusion detection. To substantiate this, we trained long short-term memory (LSTM recurrent neural networks with the training data provided by the DARPA / KDD Cup ’99 challenge. To identify suitable LSTM-RNN network parameters and structure we experimented with various network topologies. We found networks with four memory blocks containing two cells each offer a good compromise between computational cost and detection performance. We applied forget gates and shortcut connections respectively. A learning rate of 0.1 and up to 1,000 epochs showed good results. We tested the performance on all features and on extracted minimal feature sets respectively. We evaluated different feature sets for the detection of all attacks within one network and also to train networks specialised on individual attack classes. Our results show that the LSTM classifier provides superior performance in comparison to results previously published results of strong static classifiers. With 93.82% accuracy and 22.13 cost, LSTM outperforms the winning entries of the KDD Cup ’99 challenge by far. This is due to the fact that LSTM learns to look back in time and correlate consecutive connection records. For the first time ever, we have demonstrated the usefulness of LSTM networks to intrusion detection.

Towards realising high-speed large-bandwidth quantum memory

Institute of Scientific and Technical Information of China (English)

SHI BaoSen; DING DongSheng

2016-01-01

Indispensable for quantum communication and quantum computation,quantum memory executes on demand storage and retrieval of quantum states such as those of a single photon,an entangled pair or squeezed states.Among the various forms of quantum memory,Raman quantum memory has advantages forits broadband and high-speed characteristics,which results in a huge potential for applications in quantum networks and quantum computation.However,realising Raman quantum memory with true single photons and photonic entanglementis challenging.In this review,after briefly introducing the main benchmarks in the development of quantum memory and describing the state of the art,we focus on our recent experimental progress inquantum memorystorage of quantum states using the Raman scheme.

Tensor network state correspondence and holography

Science.gov (United States)

Singh, Sukhwinder

2018-01-01

In recent years, tensor network states have emerged as a very useful conceptual and simulation framework to study quantum many-body systems at low energies. In this paper, we describe a particular way in which any given tensor network can be viewed as a representation of two different quantum many-body states. The two quantum many-body states are said to correspond to each other by means of the tensor network. We apply this "tensor network state correspondence"—a correspondence between quantum many-body states mediated by tensor networks as we describe—to the multi-scale entanglement renormalization ansatz (MERA) representation of ground states of one dimensional (1D) quantum many-body systems. Since the MERA is a 2D hyperbolic tensor network (the extra dimension is identified as the length scale of the 1D system), the two quantum many-body states obtained from the MERA, via tensor network state correspondence, are seen to live in the bulk and on the boundary of a discrete hyperbolic geometry. The bulk state so obtained from a MERA exhibits interesting features, some of which caricature known features of the holographic correspondence of String theory. We show how (i) the bulk state admits a description in terms of "holographic screens", (ii) the conformal field theory data associated with a critical ground state can be obtained from the corresponding bulk state, in particular, how pointlike boundary operators are identified with extended bulk operators. (iii) We also present numerical results to illustrate that bulk states, dual to ground states of several critical spin chains, have exponentially decaying correlations, and that the bulk correlation length generally decreases with increase in central charge for these spin chains.

Remote Preparation of an Atomic Quantum Memory

International Nuclear Information System (INIS)

Rosenfeld, Wenjamin; Berner, Stefan; Volz, Juergen; Weber, Markus; Weinfurter, Harald

2007-01-01

Storage and distribution of quantum information are key elements of quantum information processing and future quantum communication networks. Here, using atom-photon entanglement as the main physical resource, we experimentally demonstrate the preparation of a distant atomic quantum memory. Applying a quantum teleportation protocol on a locally prepared state of a photonic qubit, we realized this so-called remote state preparation on a single, optically trapped 87 Rb atom. We evaluated the performance of this scheme by the full tomography of the prepared atomic state, reaching an average fidelity of 82%

Epitaxy of advanced nanowire quantum devices

Science.gov (United States)

Gazibegovic, Sasa; Car, Diana; Zhang, Hao; Balk, Stijn C.; Logan, John A.; de Moor, Michiel W. A.; Cassidy, Maja C.; Schmits, Rudi; Xu, Di; Wang, Guanzhong; Krogstrup, Peter; Op Het Veld, Roy L. M.; Zuo, Kun; Vos, Yoram; Shen, Jie; Bouman, Daniël; Shojaei, Borzoyeh; Pennachio, Daniel; Lee, Joon Sue; van Veldhoven, Petrus J.; Koelling, Sebastian; Verheijen, Marcel A.; Kouwenhoven, Leo P.; Palmstrøm, Chris J.; Bakkers, Erik P. A. M.

2017-08-01

Semiconductor nanowires are ideal for realizing various low-dimensional quantum devices. In particular, topological phases of matter hosting non-Abelian quasiparticles (such as anyons) can emerge when a semiconductor nanowire with strong spin-orbit coupling is brought into contact with a superconductor. To exploit the potential of non-Abelian anyons—which are key elements of topological quantum computing—fully, they need to be exchanged in a well-controlled braiding operation. Essential hardware for braiding is a network of crystalline nanowires coupled to superconducting islands. Here we demonstrate a technique for generic bottom-up synthesis of complex quantum devices with a special focus on nanowire networks with a predefined number of superconducting islands. Structural analysis confirms the high crystalline quality of the nanowire junctions, as well as an epitaxial superconductor-semiconductor interface. Quantum transport measurements of nanowire ‘hashtags’ reveal Aharonov-Bohm and weak-antilocalization effects, indicating a phase-coherent system with strong spin-orbit coupling. In addition, a proximity-induced hard superconducting gap (with vanishing sub-gap conductance) is demonstrated in these hybrid superconductor-semiconductor nanowires, highlighting the successful materials development necessary for a first braiding experiment. Our approach opens up new avenues for the realization of epitaxial three-dimensional quantum architectures which have the potential to become key components of various quantum devices.

A Novel Quantum Video Steganography Protocol with Large Payload Based on MCQI Quantum Video

Science.gov (United States)

Qu, Zhiguo; Chen, Siyi; Ji, Sai

2017-11-01

As one of important multimedia forms in quantum network, quantum video attracts more and more attention of experts and scholars in the world. A secure quantum video steganography protocol with large payload based on the video strip encoding method called as MCQI (Multi-Channel Quantum Images) is proposed in this paper. The new protocol randomly embeds the secret information with the form of quantum video into quantum carrier video on the basis of unique features of video frames. It exploits to embed quantum video as secret information for covert communication. As a result, its capacity are greatly expanded compared with the previous quantum steganography achievements. Meanwhile, the new protocol also achieves good security and imperceptibility by virtue of the randomization of embedding positions and efficient use of redundant frames. Furthermore, the receiver enables to extract secret information from stego video without retaining the original carrier video, and restore the original quantum video as a follow. The simulation and experiment results prove that the algorithm not only has good imperceptibility, high security, but also has large payload.

Minimal computational-space implementation of multiround quantum protocols

International Nuclear Information System (INIS)

Bisio, Alessandro; D'Ariano, Giacomo Mauro; Perinotti, Paolo; Chiribella, Giulio

2011-01-01

A single-party strategy in a multiround quantum protocol can be implemented by sequential networks of quantum operations connected by internal memories. Here, we provide an efficient realization in terms of computational-space resources.

Telecommunication networks

CERN Document Server

Iannone, Eugenio

2011-01-01

Many argue that telecommunications network infrastructure is the most impressive and important technology ever developed. Analyzing the telecom market's constantly evolving trends, research directions, infrastructure, and vital needs, Telecommunication Networks responds with revolutionized engineering strategies to optimize network construction. Omnipresent in society, telecom networks integrate a wide range of technologies. These include quantum field theory for the study of optical amplifiers, software architectures for network control, abstract algebra required to design error correction co

Photonic quantum technologies (Presentation Recording)

Science.gov (United States)

O'Brien, Jeremy L.

2015-09-01

The impact of quantum technology will be profound and far-reaching: secure communication networks for consumers, corporations and government; precision sensors for biomedical technology and environmental monitoring; quantum simulators for the design of new materials, pharmaceuticals and clean energy devices; and ultra-powerful quantum computers for addressing otherwise impossibly large datasets for machine learning and artificial intelligence applications. However, engineering quantum systems and controlling them is an immense technological challenge: they are inherently fragile; and information extracted from a quantum system necessarily disturbs the system itself. Of the various approaches to quantum technologies, photons are particularly appealing for their low-noise properties and ease of manipulation at the single qubit level. We have developed an integrated waveguide approach to photonic quantum circuits for high performance, miniaturization and scalability. We will described our latest progress in generating, manipulating and interacting single photons in waveguide circuits on silicon chips.

Adiabatic Quantum Optimization for Associative Memory Recall

Science.gov (United States)

Seddiqi, Hadayat; Humble, Travis

2014-12-01

Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO). Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are stored in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.

Adiabatic Quantum Optimization for Associative Memory Recall

Directory of Open Access Journals (Sweden)

Hadayat eSeddiqi

2014-12-01

Full Text Available Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO. Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are stored in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.

Using the D-Wave 2X Quantum Computer to Explore the Formation of Global Terrorist Networks

Energy Technology Data Exchange (ETDEWEB)

Ambrosiano, John Joseph [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Roberts, Randy Mark [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Sims, Benjamin Hayden [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

2017-05-15

Social networks with signed edges (+/-) play an important role in an area of social network theory called structural balance. In these networks, edges represent relationships that are labeled as either friendly (+) or hostile (-). A signed social network is balanced only if all cycles of three or more nodes in the graph have an odd number of hostile edges. A fundamental property of a balanced network is that it can be cleanly divided into 2 factions, where all relationships within each faction are friendly, and all relationships between members of different factions are hostile. The more unbalanced a network is, the more edges will fail to adhere to this rule, making factions more ambiguous. Social theory suggests unbalanced networks should be unstable, a finding that has been supported by research on gangs, which shows that unbalanced relationships are associated with greater violence, possibly due to this increased ambiguity about factional allegiances (Nakamura et al). One way to estimate the imbalance in a network, if only edge relationships are known, is to assign nodes to factions that minimize the number of violations of the edge rule described above. This problem is known to be computationally NP-hard. However, Facchetti et al. have pointed out that it is equivalent to an Ising model with a Hamiltonian that effectively counts the number of edge rule violations. Therefore, finding the assignment of factions that minimizes energy of the equivalent Ising system yields an estimate of the imbalance in the network. Based on the Ising model equivalence of the signed-social network balance problem, we have used the D-Wave 2X quantum annealing computer to explore some aspects of signed social networks. Because connectivity in the D-Wave computer is limited to its particular native topology, arbitrary networks cannot be represented directly. Rather, they must be “embedded” using a technique in which multiple qubits are chained together with special weights to

Electromagnetically Induced Transparency in Circuit Quantum Electrodynamics with Nested Polariton States

Science.gov (United States)

Long, Junling; Ku, H. S.; Wu, Xian; Gu, Xiu; Lake, Russell E.; Bal, Mustafa; Liu, Yu-xi; Pappas, David P.

2018-02-01

Quantum networks will enable extraordinary capabilities for communicating and processing quantum information. These networks require a reliable means of storage, retrieval, and manipulation of quantum states at the network nodes. A node receives one or more coherent inputs and sends a conditional output to the next cascaded node in the network through a quantum channel. Here, we demonstrate this basic functionality by using the quantum interference mechanism of electromagnetically induced transparency in a transmon qubit coupled to a superconducting resonator. First, we apply a microwave bias, i.e., drive, to the qubit-cavity system to prepare a Λ -type three-level system of polariton states. Second, we input two interchangeable microwave signals, i.e., a probe tone and a control tone, and observe that transmission of the probe tone is conditional upon the presence of the control tone that switches the state of the device with up to 99.73% transmission extinction. Importantly, our electromagnetically induced transparency scheme uses all dipole allowed transitions. We infer high dark state preparation fidelities of >99.39 % and negative group velocities of up to -0.52 ±0.09 km /s based on our data.

Quantum game application to spectrum scarcity problems

Science.gov (United States)

Zabaleta, O. G.; Barrangú, J. P.; Arizmendi, C. M.

2017-01-01

Recent spectrum-sharing research has produced a strategy to address spectrum scarcity problems. This novel idea, named cognitive radio, considers that secondary users can opportunistically exploit spectrum holes left temporarily unused by primary users. This presents a competitive scenario among cognitive users, making it suitable for game theory treatment. In this work, we show that the spectrum-sharing benefits of cognitive radio can be increased by designing a medium access control based on quantum game theory. In this context, we propose a model to manage spectrum fairly and effectively, based on a multiple-users multiple-choice quantum minority game. By taking advantage of quantum entanglement and quantum interference, it is possible to reduce the probability of collision problems commonly associated with classic algorithms. Collision avoidance is an essential property for classic and quantum communications systems. In our model, two different scenarios are considered, to meet the requirements of different user strategies. The first considers sensor networks where the rational use of energy is a cornerstone; the second focuses on installations where the quality of service of the entire network is a priority.

Coherence time of over a second in a telecom-compatible quantum memory storage material

Science.gov (United States)

Rančić, Miloš; Hedges, Morgan P.; Ahlefeldt, Rose L.; Sellars, Matthew J.

2018-01-01

Quantum memories for light will be essential elements in future long-range quantum communication networks. These memories operate by reversibly mapping the quantum state of light onto the quantum transitions of a material system. For networks, the quantum coherence times of these transitions must be long compared to the network transmission times, approximately 100 ms for a global communication network. Due to a lack of a suitable storage material, a quantum memory that operates in the 1,550 nm optical fibre communication band with a storage time greater than 1 μs has not been demonstrated. Here we describe the spin dynamics of 167Er3+: Y2SiO5 in a high magnetic field and demonstrate that this material has the characteristics for a practical quantum memory in the 1,550 nm communication band. We observe a hyperfine coherence time of 1.3 s. We also demonstrate efficient spin pumping of the entire ensemble into a single hyperfine state, a requirement for broadband spin-wave storage. With an absorption of 70 dB cm-1 at 1,538 nm and Λ transitions enabling spin-wave storage, this material is the first candidate identified for an efficient, broadband quantum memory at telecommunication wavelengths.

Two-way quantum communication: Generalization of secure ...

Indian Academy of Sciences (India)

states among the n nodes of a quantum network, with the aid of a special kind of ... replica of the information state, i.e., this process has one-way quantum ... with respect to increase in the number of qubits going towards the controller Charlie.

Quantum internet using code division multiple access

Science.gov (United States)

Zhang, Jing; Liu, Yu-xi; Özdemir, Şahin Kaya; Wu, Re-Bing; Gao, Feifei; Wang, Xiang-Bin; Yang, Lan; Nori, Franco

2013-01-01

A crucial open problem inS large-scale quantum networks is how to efficiently transmit quantum data among many pairs of users via a common data-transmission medium. We propose a solution by developing a quantum code division multiple access (q-CDMA) approach in which quantum information is chaotically encoded to spread its spectral content, and then decoded via chaos synchronization to separate different sender-receiver pairs. In comparison to other existing approaches, such as frequency division multiple access (FDMA), the proposed q-CDMA can greatly increase the information rates per channel used, especially for very noisy quantum channels. PMID:23860488

Small-scale quantum information processing with linear optics

International Nuclear Information System (INIS)

Bergou, J.A.; Steinberg, A.M.; Mohseni, M.

2005-01-01

Full text: Photons are the ideal systems for carrying quantum information. Although performing large-scale quantum computation on optical systems is extremely demanding, non scalable linear-optics quantum information processing may prove essential as part of quantum communication networks. In addition efficient (scalable) linear-optical quantum computation proposal relies on the same optical elements. Here, by constructing multirail optical networks, we experimentally study two central problems in quantum information science, namely optimal discrimination between nonorthogonal quantum states, and controlling decoherence in quantum systems. Quantum mechanics forbids deterministic discrimination between nonorthogonal states. This is one of the central features of quantum cryptography, which leads to secure communications. Quantum state discrimination is an important primitive in quantum information processing, since it determines the limitations of a potential eavesdropper, and it has applications in quantum cloning and entanglement concentration. In this work, we experimentally implement generalized measurements in an optical system and demonstrate the first optimal unambiguous discrimination between three non-orthogonal states with a success rate of 55 %, to be compared with the 25 % maximum achievable using projective measurements. Furthermore, we present the first realization of unambiguous discrimination between a pure state and a nonorthogonal mixed state. In a separate experiment, we demonstrate how decoherence-free subspaces (DFSs) may be incorporated into a prototype optical quantum algorithm. Specifically, we present an optical realization of two-qubit Deutsch-Jozsa algorithm in presence of random noise. By introduction of localized turbulent airflow we produce a collective optical dephasing, leading to large error rates and demonstrate that using DFS encoding, the error rate in the presence of decoherence can be reduced from 35 % to essentially its pre

Modeling Temporal Processes in Early Spacecraft Design: Application of Discrete-Event Simulations for Darpa's F6 Program

Science.gov (United States)

Dubos, Gregory F.; Cornford, Steven

2012-01-01

While the ability to model the state of a space system over time is essential during spacecraft operations, the use of time-based simulations remains rare in preliminary design. The absence of the time dimension in most traditional early design tools can however become a hurdle when designing complex systems whose development and operations can be disrupted by various events, such as delays or failures. As the value delivered by a space system is highly affected by such events, exploring the trade space for designs that yield the maximum value calls for the explicit modeling of time.This paper discusses the use of discrete-event models to simulate spacecraft development schedule as well as operational scenarios and on-orbit resources in the presence of uncertainty. It illustrates how such simulations can be utilized to support trade studies, through the example of a tool developed for DARPA's F6 program to assist the design of "fractionated spacecraft".

Percolation of secret correlations in a network

OpenAIRE

Leverrier, Anthony; García-Patrón, Raúl

2011-01-01

In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks, more precisely the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a...

Percolation of secret correlations in a network

Energy Technology Data Exchange (ETDEWEB)

Leverrier, Anthony; Garcia-Patron, Raul [ICFO-Institut de Ciencies Fotoniques, 08860 Castelldefels (Barcelona) (Spain); Research Laboratory of Electronics, MIT, Cambridge, MA 02139 (United States) and Max-Planck Institut fur Quantenoptik, Hans-Kopfermann Str. 1, D-85748 Garching (Germany)

2011-09-15

In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks--more precisely, the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.

Percolation of secret correlations in a network

International Nuclear Information System (INIS)

Leverrier, Anthony; Garcia-Patron, Raul

2011-01-01

In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks--more precisely, the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.

Establishing and storing of deterministic quantum entanglement among three distant atomic ensembles.

Science.gov (United States)

Yan, Zhihui; Wu, Liang; Jia, Xiaojun; Liu, Yanhong; Deng, Ruijie; Li, Shujing; Wang, Hai; Xie, Changde; Peng, Kunchi

2017-09-28

It is crucial for the physical realization of quantum information networks to first establish entanglement among multiple space-separated quantum memories and then, at a user-controlled moment, to transfer the stored entanglement to quantum channels for distribution and conveyance of information. Here we present an experimental demonstration on generation, storage, and transfer of deterministic quantum entanglement among three spatially separated atomic ensembles. The off-line prepared multipartite entanglement of optical modes is mapped into three distant atomic ensembles to establish entanglement of atomic spin waves via electromagnetically induced transparency light-matter interaction. Then the stored atomic entanglement is transferred into a tripartite quadrature entangled state of light, which is space-separated and can be dynamically allocated to three quantum channels for conveying quantum information. The existence of entanglement among three released optical modes verifies that the system has the capacity to preserve multipartite entanglement. The presented protocol can be directly extended to larger quantum networks with more nodes.Continuous-variable encoding is a promising approach for quantum information and communication networks. Here, the authors show how to map entanglement from three spatial optical modes to three separated atomic samples via electromagnetically induced transparency, releasing it later on demand.

Controlled mutual quantum entity authentication using entanglement swapping

International Nuclear Information System (INIS)

Kang, Min-Sung; Hong, Chang-Ho; Heo, Jino; Lim, Jong-In; Yang, Hyung-Jin

2015-01-01

In this paper, we suggest a controlled mutual quantum entity authentication protocol by which two users mutually certify each other on a quantum network using a sequence of Greenberger–Horne–Zeilinger (GHZ)-like states. Unlike existing unidirectional quantum entity authentication, our protocol enables mutual quantum entity authentication utilizing entanglement swapping; moreover, it allows the managing trusted center (TC) or trusted third party (TTP) to effectively control the certification of two users using the nature of the GHZ-like state. We will also analyze the security of the protocol and quantum channel. (paper)

Quantum teleportation from a telecom-wavelength photon to a solid-state quantum memory

Energy Technology Data Exchange (ETDEWEB)

Bussieres, Felix [Group of Applied Physics, University of Geneva (Switzerland)

2014-07-01

Quantum teleportation is a cornerstone of quantum information science due to its essential role in several important tasks such as the long-distance transmission of quantum information using quantum repeaters. In this context, a challenge of paramount importance is the distribution of entanglement between remote nodes, and to use this entanglement as a resource for long-distance light-to-matter quantum teleportation. In this talk I will report on the demonstration of quantum teleportation of the polarization state of a telecom-wavelength photon onto the state of a solid-state quantum memory. Entanglement is established between a rare-earth-ion doped crystal storing a single photon that is polarization-entangled with a flying telecom-wavelength photon. The latter is jointly measured with another flying qubit carrying the polarization state to be teleported, which heralds the teleportation. The fidelity of the polarization state of the photon retrieved from the memory is shown to be greater than the maximum fidelity achievable without entanglement, even when the combined distances travelled by the two flying qubits is 25 km of standard optical fibre. This light-to-matter teleportation channel paves the way towards long-distance implementations of quantum networks with solid-state quantum memories.

Efficient learning algorithm for quantum perceptron unitary weights

OpenAIRE

Seow, Kok-Leong; Behrman, Elizabeth; Steck, James

2015-01-01

For the past two decades, researchers have attempted to create a Quantum Neural Network (QNN) by combining the merits of quantum computing and neural computing. In order to exploit the advantages of the two prolific fields, the QNN must meet the non-trivial task of integrating the unitary dynamics of quantum computing and the dissipative dynamics of neural computing. At the core of quantum computing and neural computing lies the qubit and perceptron, respectively. We see that past implementat...

Quantum State Transfer from a Single Photon to a Distant Quantum-Dot Electron Spin

Science.gov (United States)

He, Yu; He, Yu-Ming; Wei, Yu-Jia; Jiang, Xiao; Chen, Kai; Lu, Chao-Yang; Pan, Jian-Wei; Schneider, Christian; Kamp, Martin; Höfling, Sven

2017-08-01

Quantum state transfer from flying photons to stationary matter qubits is an important element in the realization of quantum networks. Self-assembled semiconductor quantum dots provide a promising solid-state platform hosting both single photon and spin, with an inherent light-matter interface. Here, we develop a method to coherently and actively control the single-photon frequency bins in superposition using electro-optic modulators, and measure the spin-photon entanglement with a fidelity of 0.796 ±0.020 . Further, by Greenberger-Horne-Zeilinger-type state projection on the frequency, path, and polarization degrees of freedom of a single photon, we demonstrate quantum state transfer from a single photon to a single electron spin confined in an InGaAs quantum dot, separated by 5 m. The quantum state mapping from the photon's polarization to the electron's spin is demonstrated along three different axes on the Bloch sphere, with an average fidelity of 78.5%.

Formalization of Quantum Protocols using Coq

Directory of Open Access Journals (Sweden)

Jaap Boender

2015-11-01

Full Text Available Quantum Information Processing, which is an exciting area of research at the intersection of physics and computer science, has great potential for influencing the future development of information processing systems. The building of practical, general purpose Quantum Computers may be some years into the future. However, Quantum Communication and Quantum Cryptography are well developed. Commercial Quantum Key Distribution systems are easily available and several QKD networks have been built in various parts of the world. The security of the protocols used in these implementations rely on information-theoretic proofs, which may or may not reflect actual system behaviour. Moreover, testing of implementations cannot guarantee the absence of bugs and errors. This paper presents a novel framework for modelling and verifying quantum protocols and their implementations using the proof assistant Coq. We provide a Coq library for quantum bits (qubits, quantum gates, and quantum measurement. As a step towards verifying practical quantum communication and security protocols such as Quantum Key Distribution, we support multiple qubits, communication and entanglement. We illustrate these concepts by modelling the Quantum Teleportation Protocol, which communicates the state of an unknown quantum bit using only a classical channel.

Quantized Detector Networks

Science.gov (United States)

Jaroszkiewicz, George

2017-12-01

Preface; Acronyms; 1. Introduction; 2. Questions and answers; 3. Classical bits; 4. Quantum bits; 5. Classical and quantum registers; 6. Classical register mechanics; 7. Quantum register dynamics; 8. Partial observations; 9. Mixed states and POVMs; 10. Double-slit experiments; 11. Modules; 12. Computerization and computer algebra; 13. Interferometers; 14. Quantum eraser experiments; 15. Particle decays; 16. Non-locality; 17. Bell inequalities; 18. Change and persistence; 19. Temporal correlations; 20. The Franson experiment; 21. Self-intervening networks; 22. Separability and entanglement; 23. Causal sets; 24. Oscillators; 25. Dynamical theory of observation; 26. Conclusions; Appendix; Index.

Focus on Quantum Cryptography

International Nuclear Information System (INIS)

Kwiat, Paul G.

2002-01-01

implemented a totally new protocol, using polarization-entangled photons, which in some circumstances can tolerate higher error rates than the traditional one of Bennett and Brassard; moreover, the use of entanglement provides a means of 'automatic source verification'. Finally, looking to the future, Elliott gives a provocative view of how these technologies may be merged into network operation, and Shapiro describes a method to combine a novel source of entangled photons with a means to transfer the photons' quantum state to trapped-atom quantum memories. If realized, these systems could presage the world's first quantum network. (author)

EDITORIAL: Focus on Quantum Cryptography: Theory and Practice FOCUS ON QUANTUM CRYPTOGRAPHY: THEORY AND PRACTICE

Science.gov (United States)

Lütkenhaus, N.; Shields, A. J.

2009-04-01

Quantum cryptography, and especially quantum key distribution (QKD), is steadily progressing to become a viable tool for cryptographic services. In recent years we have witnessed a dramatic increase in the secure bit rate of QKD, as well as its extension to ever longer fibre- and air-based links and the emergence of metro-scale trusted networks. In the foreseeable future even global-scale communications may be possible using quantum repeaters or Earth-satellite links. A handful of start-ups and some bigger companies are already active in the field. The launch of an initiative to form industrial standards for QKD, under the auspices of the European Telecommunication Standards Institute, described in the paper by Laenger and Lenhart in this Focus Issue, can be taken as a sign of the growing commercial interest. Recent progress has seen an increase in the secure bit rate of QKD links, by orders of magnitude, to over 1 Mb s-1. This has resulted mainly from an improvement in the detection technology. Here changes in the way conventional semiconductor detectors are gated, as well as the development of novel devices based on non-linear processes and superconducting materials, are leading the way. Additional challenges for QKD at GHz clock rates include the design of high speed electronics, remote synchronization and high rate random number generation. Substantial effort is being devoted to increasing the range of individual links, which is limited by attenuation and other losses in optical fibres and air links. An important advance in the past few years has been the introduction of protocols with the same scaling as an ideal single-photon set-up. The good news is that these schemes use standard optical devices, such as weak laser pulses. Thanks to these new protocols and improvements in the detection technology, the range of a single fibre link can exceed a few hundred km. Outstanding issues include proving the unconditional security of some of the schemes. Much of the

Infinite degeneracy of states in quantum gravity

International Nuclear Information System (INIS)

Hackett, Jonathan; Wan Yidun

2011-01-01

The setting of Braided Ribbon Networks is used to present a general result in spin-networks embedded in manifolds: the existence of an infinite number of species of conserved quantities. Restricted to three-valent networks the number of such conserved quantities in a given network is shown to be determined by the number of nodes in the network. The implication of these conserved quantities is discussed in the context of Loop Quantum Gravity.

Quantum waveguides