Quantum snake walk on graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rosmanis, Ansis

2011-02-15

I introduce a continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First, I analyze the quantum snake walk on the line, and I show that, even though most states stay localized throughout the evolution, there are specific states that most likely move on the line as wave packets with momentum inversely proportional to the length of the snake. Next, I discuss how an algorithm based on the quantum snake walk might potentially be able to solve an extended version of the glued trees problem, whichmore » asks to find a path connecting both roots of the glued trees graph. To the best of my knowledge, no efficient quantum algorithm solving this problem is known yet.« less

Localization on Quantum Graphs with Random Vertex Couplings

NASA Astrophysics Data System (ADS)

Klopp, Frédéric; Pankrashkin, Konstantin

2008-05-01

We consider Schrödinger operators on a class of periodic quantum graphs with randomly distributed Kirchhoff coupling constants at all vertices. We obtain necessary conditions for localization on quantum graphs in terms of finite volume criteria for some energy-dependent discrete Hamiltonians. These conditions hold in the strong disorder limit and at the spectral edges.

Quantum secret sharing with qudit graph states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Keet, Adrian; Fortescue, Ben; Sanders, Barry C.

We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

A quantum kinematics for asymptotically flat gravity

NASA Astrophysics Data System (ADS)

Campiglia, Miguel; Varadarajan, Madhavan

2015-07-01

We construct a quantum kinematics for asymptotically flat gravity based on the Koslowski-Sahlmann (KS) representation. The KS representation is a generalization of the representation underlying loop quantum gravity (LQG) which supports, in addition to the usual LQG operators, the action of ‘background exponential operators’, which are connection dependent operators labelled by ‘background’ su(2) electric fields. KS states have, in addition to the LQG state label corresponding to one dimensional excitations of the triad, a label corresponding to a ‘background’ electric field that describes three dimensional excitations of the triad. Asymptotic behaviour in quantum theory is controlled through asymptotic conditions on the background electric fields that label the states and the background electric fields that label the operators. Asymptotic conditions on the triad are imposed as conditions on the background electric field state label while confining the LQG spin net graph labels to compact sets. We show that KS states can be realised as wave functions on a quantum configuration space of generalized connections and that the asymptotic behaviour of each such generalized connection is determined by that of the background electric fields which label the background exponential operators. Similar to the spatially compact case, the Gauss law and diffeomorphism constraints are then imposed through group averaging techniques to obtain a large sector of gauge invariant states. It is shown that this sector supports a unitary action of the group of asymptotic rotations and translations and that, as anticipated by Friedman and Sorkin, for appropriate spatial topology, this sector contains states that display fermionic behaviour under 2π rotations.

Generalized teleportation by quantum walks

NASA Astrophysics Data System (ADS)

Wang, Yu; Shang, Yun; Xue, Peng

2017-09-01

We develop a generalized teleportation scheme based on quantum walks with two coins. For an unknown qubit state, we use two-step quantum walks on the line and quantum walks on the cycle with four vertices for teleportation. For any d-dimensional states, quantum walks on complete graphs and quantum walks on d-regular graphs can be used for implementing teleportation. Compared with existing d-dimensional states teleportation, prior entangled state is not required and the necessary maximal entanglement resource is generated by the first step of quantum walk. Moreover, two projective measurements with d elements are needed by quantum walks on the complete graph, rather than one joint measurement with d^2 basis states. Quantum walks have many applications in quantum computation and quantum simulations. This is the first scheme of realizing communicating protocol with quantum walks, thus opening wider applications.

Exclusivity structures and graph representatives of local complementation orbits

NASA Astrophysics Data System (ADS)

Cabello, Adán; Parker, Matthew G.; Scarpa, Giannicola; Severini, Simone

2013-07-01

We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lovász number which is equal to its fractional packing number. The vertices of H(G) represent all possible events consistent with the stabilizer group of the graph state associated with G, and exclusive events are adjacent. Mathematically, the graph H(G) corresponds to the orbit of G under local complementation. Physically, the construction translates into graph-theoretic terms the connection between a graph state and a Bell inequality maximally violated by quantum mechanics. In the context of zero-error information theory, the construction suggests a protocol achieving the maximum rate of entanglement-assisted capacity, a quantum mechanical analogue of the Shannon capacity, for each H(G). The violation of the Bell inequality is expressed by the one-shot version of this capacity being strictly larger than the independence number. Finally, given the correspondence between graphs and exclusivity structures, we are able to compute the independence number for certain infinite families of graphs with the use of quantum non-locality, therefore highlighting an application of quantum theory in the proof of a purely combinatorial statement.

Comparing Algorithms for Graph Isomorphism Using Discrete- and Continuous-Time Quantum Random Walks

DOE PAGES

Rudinger, Kenneth; Gamble, John King; Bach, Eric; ...

2013-07-01

Berry and Wang [Phys. Rev. A 83, 042317 (2011)] show numerically that a discrete-time quan- tum random walk of two noninteracting particles is able to distinguish some non-isomorphic strongly regular graphs from the same family. Here we analytically demonstrate how it is possible for these walks to distinguish such graphs, while continuous-time quantum walks of two noninteracting parti- cles cannot. We show analytically and numerically that even single-particle discrete-time quantum random walks can distinguish some strongly regular graphs, though not as many as two-particle noninteracting discrete-time walks. Additionally, we demonstrate how, given the same quantum random walk, subtle di erencesmore » in the graph certi cate construction algorithm can nontrivially im- pact the walk's distinguishing power. We also show that no continuous-time walk of a xed number of particles can distinguish all strongly regular graphs when used in conjunction with any of the graph certi cates we consider. We extend this constraint to discrete-time walks of xed numbers of noninteracting particles for one kind of graph certi cate; it remains an open question as to whether or not this constraint applies to the other graph certi cates we consider.« less

Edge connectivity and the spectral gap of combinatorial and quantum graphs

NASA Astrophysics Data System (ADS)

Berkolaiko, Gregory; Kennedy, James B.; Kurasov, Pavel; Mugnolo, Delio

2017-09-01

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of Laplacians on combinatorial and quantum graph in terms of the edge connectivity, i.e. the minimal number of edges which need to be removed to make the graph disconnected. On combinatorial graphs, one of the bounds corresponds to a well-known inequality of Fiedler, of which we give a new variational proof. On quantum graphs, the corresponding bound generalizes a recent result of Band and Lévy. All proofs are general enough to yield corresponding estimates for the p-Laplacian and allow us to identify the minimizers. Based on the Betti number of the graph, we also derive upper and lower bounds on all eigenvalues which are ‘asymptotically correct’, i.e. agree with the Weyl asymptotics for the eigenvalues of the quantum graph. In particular, the lower bounds improve the bounds of Friedlander on any given graph for all but finitely many eigenvalues, while the upper bounds improve recent results of Ariturk. Our estimates are also used to derive bounds on the eigenvalues of the normalized Laplacian matrix that improve known bounds of spectral graph theory.

Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs

PubMed Central

Novo, Leonardo; Chakraborty, Shantanav; Mohseni, Masoud; Neven, Hartmut; Omar, Yasser

2015-01-01

Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that confine the dynamics to a smaller subspace of the full Hilbert space. In this work, we use invariant subspace methods, that can be computed systematically using the Lanczos algorithm, to obtain the reduced set of states that encompass the dynamics of the problem at hand without the specific knowledge of underlying symmetries. First, we apply this method to obtain new instances of graphs where the spatial quantum search algorithm is optimal: complete graphs with broken links and complete bipartite graphs, in particular, the star graph. These examples show that regularity and high-connectivity are not needed to achieve optimal spatial search. We also show that this method considerably simplifies the calculation of quantum transport efficiencies. Furthermore, we observe improved efficiencies by removing a few links from highly symmetric graphs. Finally, we show that this reduction method also allows us to obtain an upper bound for the fidelity of a single qubit transfer on an XY spin network. PMID:26330082

Constructing compact and effective graphs for recommender systems via node and edge aggregations

DOE PAGES

Lee, Sangkeun; Kahng, Minsuk; Lee, Sang-goo

2014-12-10

Exploiting graphs for recommender systems has great potential to flexibly incorporate heterogeneous information for producing better recommendation results. As our baseline approach, we first introduce a naive graph-based recommendation method, which operates with a heterogeneous log-metadata graph constructed from user log and content metadata databases. Although the na ve graph-based recommendation method is simple, it allows us to take advantages of heterogeneous information and shows promising flexibility and recommendation accuracy. However, it often leads to extensive processing time due to the sheer size of the graphs constructed from entire user log and content metadata databases. In this paper, we proposemore » node and edge aggregation approaches to constructing compact and e ective graphs called Factor-Item bipartite graphs by aggregating nodes and edges of a log-metadata graph. Furthermore, experimental results using real world datasets indicate that our approach can significantly reduce the size of graphs exploited for recommender systems without sacrificing the recommendation quality.« less

Efficient quantum walk on a quantum processor

PubMed Central

Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L.; Wang, Jingbo B.; Matthews, Jonathan C. F.

2016-01-01

The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor. PMID:27146471

Graph C ∗-algebras and Z2-quotients of quantum spheres

NASA Astrophysics Data System (ADS)

Hajac, Piotr M.; Matthes, Rainer; Szymański, Wojciech

2003-06-01

We consider two Z2-actions on the Podleś generic quantum spheres. They yield, as noncommutative quotient spaces, the Klimek-Lesmewski q-disc and the quantum real projective space, respectively. The C ∗-algebas of all these quantum spaces are described as graph C ∗-algebras. The K-groups of the thus presented C ∗-algebras are then easily determined from the general theory of graph C ∗-algebas. For the quantum real projective space, we also recall the classification of the classes of irreducible ∗-representations of its algebra and give a linear basis for this algebra.

Efficient quantum pseudorandomness with simple graph states

NASA Astrophysics Data System (ADS)

Mezher, Rawad; Ghalbouni, Joe; Dgheim, Joseph; Markham, Damian

2018-02-01

Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. Unless corrected for, the randomness of the measurements leads to the generation of ensembles of random unitaries, where each random unitary is identified with a string of possible measurement results. We show that repeating an MB scheme an efficient number of times, on a simple graph state, with measurements at fixed angles and no feedforward corrections, produces a random unitary ensemble that is an ɛ -approximate t design on n qubits. Unlike previous constructions, the graph is regular and is also a universal resource for measurement based quantum computing, closely related to the brickwork state.

Network-based Arbitrated Quantum Signature Scheme with Graph State

NASA Astrophysics Data System (ADS)

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.

Connectivity is a Poor Indicator of Fast Quantum Search

NASA Astrophysics Data System (ADS)

Meyer, David A.; Wong, Thomas G.

2015-03-01

A randomly walking quantum particle evolving by Schrödinger's equation searches on d -dimensional cubic lattices in O (√{N }) time when d ≥5 , and with progressively slower runtime as d decreases. This suggests that graph connectivity (including vertex, edge, algebraic, and normalized algebraic connectivities) is an indicator of fast quantum search, a belief supported by fast quantum search on complete graphs, strongly regular graphs, and hypercubes, all of which are highly connected. In this Letter, we show this intuition to be false by giving two examples of graphs for which the opposite holds true: one with low connectivity but fast search, and one with high connectivity but slow search. The second example is a novel two-stage quantum walk algorithm in which the walking rate must be adjusted to yield high search probability.

Finding Maximum Cliques on the D-Wave Quantum Annealer

DOE PAGES

Chapuis, Guillaume; Djidjev, Hristo; Hahn, Georg; ...

2018-05-03

This work assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Because the size of the largest graphs DW can directly solve is quite small (usually around 45 vertices), we also consider decomposition algorithms intended for larger graphs and analyze their performance. For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, andmore » compare several quantum implementations to current classical algorithms such as simulated annealing, Gurobi, and third-party clique finding heuristics. We further estimate the contributions of the quantum phase of the quantum annealer and the classical post-processing phase typically used to enhance each solution returned by DW. We demonstrate that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms. On the other hand, for instances specifically designed to fit well the DW qubit interconnection network, we observe substantial speed-ups in computing time over classical approaches.« less

Finding Maximum Cliques on the D-Wave Quantum Annealer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chapuis, Guillaume; Djidjev, Hristo; Hahn, Georg

This work assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Because the size of the largest graphs DW can directly solve is quite small (usually around 45 vertices), we also consider decomposition algorithms intended for larger graphs and analyze their performance. For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, andmore » compare several quantum implementations to current classical algorithms such as simulated annealing, Gurobi, and third-party clique finding heuristics. We further estimate the contributions of the quantum phase of the quantum annealer and the classical post-processing phase typically used to enhance each solution returned by DW. We demonstrate that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms. On the other hand, for instances specifically designed to fit well the DW qubit interconnection network, we observe substantial speed-ups in computing time over classical approaches.« less

Path-sum solution of the Weyl quantum walk in 3 + 1 dimensions

NASA Astrophysics Data System (ADS)

D'Ariano, G. M.; Mosco, N.; Perinotti, P.; Tosini, A.

2017-10-01

We consider the Weyl quantum walk in 3+1 dimensions, that is a discrete-time walk describing a particle with two internal degrees of freedom moving on a Cayley graph of the group , which in an appropriate regime evolves according to Weyl's equation. The Weyl quantum walk was recently derived as the unique unitary evolution on a Cayley graph of that is homogeneous and isotropic. The general solution of the quantum walk evolution is provided here in the position representation, by the analytical expression of the propagator, i.e. transition amplitude from a node of the graph to another node in a finite number of steps. The quantum nature of the walk manifests itself in the interference of the paths on the graph joining the given nodes. The solution is based on the binary encoding of the admissible paths on the graph and on the semigroup structure of the walk transition matrices. This article is part of the themed issue `Second quantum revolution: foundational questions'.

A simple method for finding the scattering coefficients of quantum graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cottrell, Seth S.

2015-09-15

Quantum walks are roughly analogous to classical random walks, and similar to classical walks they have been used to find new (quantum) algorithms. When studying the behavior of large graphs or combinations of graphs, it is useful to find the response of a subgraph to signals of different frequencies. In doing so, we can replace an entire subgraph with a single vertex with variable scattering coefficients. In this paper, a simple technique for quickly finding the scattering coefficients of any discrete-time quantum graph will be presented. These scattering coefficients can be expressed entirely in terms of the characteristic polynomial ofmore » the graph’s time step operator. This is a marked improvement over previous techniques which have traditionally required finding eigenstates for a given eigenvalue, which is far more computationally costly. With the scattering coefficients we can easily derive the “impulse response” which is the key to predicting the response of a graph to any signal. This gives us a powerful set of tools for rapidly understanding the behavior of graphs or for reducing a large graph into its constituent subgraphs regardless of how they are connected.« less

Relating zeta functions of discrete and quantum graphs

NASA Astrophysics Data System (ADS)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation between the spectrum of the Laplacian on a discrete graph and that of the Laplacian on an equilateral metric graph. As a by-product, we determine how the multiplicity of eigenvalues of the quantum graph, that are also in the spectrum of the graph with Dirichlet conditions at the vertices, depends on the graph geometry. Finally we apply the result to calculate the vacuum energy and spectral determinant of a complete bipartite graph and compare our results with those for a star graph, a graph in which all vertices are connected to a central vertex by a single edge.

Quantum speedup of the traveling-salesman problem for bounded-degree graphs

NASA Astrophysics Data System (ADS)

Moylett, Dominic J.; Linden, Noah; Montanaro, Ashley

2017-03-01

The traveling-salesman problem is one of the most famous problems in graph theory. However, little is currently known about the extent to which quantum computers could speed up algorithms for the problem. In this paper, we prove a quadratic quantum speedup when the degree of each vertex is at most 3 by applying a quantum backtracking algorithm to a classical algorithm by Xiao and Nagamochi. We then use similar techniques to accelerate a classical algorithm for when the degree of each vertex is at most 4, before speeding up higher-degree graphs via reductions to these instances.

Topology-preserving quantum deformation with non-numerical parameter

NASA Astrophysics Data System (ADS)

Aukhadiev, Marat; Grigoryan, Suren; Lipacheva, Ekaterina

2013-11-01

We introduce a class of compact quantum semigroups, that we call semigroup deformations of compact Abelian qroups. These objects arise from reduced semigroup -algebras, the generalization of the Toeplitz algebra. We study quantum subgroups, quantum projective spaces and quantum quotient groups for such objects, and show that the group is contained as a compact quantum subgroup in the deformation of itself. The connection with the weak Hopf algebra notion is described. We give a grading on the -algebra of the compact quantum semigroups constructed.

Non-Weyl asymptotics for quantum graphs with general coupling conditions

NASA Astrophysics Data System (ADS)

Davies, E. Brian; Exner, Pavel; Lipovský, Jiří

2010-11-01

Inspired by a recent result of Davies and Pushnitski, we study resonance asymptotics of quantum graphs with general coupling conditions at the vertices. We derive a criterion for the asymptotics to be of a non-Weyl character. We show that for balanced vertices with permutation-invariant couplings the asymptotics is non-Weyl only in the case of Kirchhoff or anti-Kirchhoff conditions. While for graphs without permutation symmetry numerous examples of non-Weyl behaviour can be constructed. Furthermore, we present an insight into what makes the Kirchhoff/anti-Kirchhoff coupling particular from the resonance point of view. Finally, we demonstrate a generalization to quantum graphs with unequal edge weights.

Experimental Study of Quantum Graphs with Microwave Networks

NASA Astrophysics Data System (ADS)

Fu, Ziyuan; Koch, Trystan; Antonsen, Thomas; Ott, Edward; Anlage, Steven; Wave Chaos Team

An experimental setup consisting of microwave networks is used to simulate quantum graphs. The networks are constructed from coaxial cables connected by T junctions. The networks are built for operation both at room temperature and superconducting versions that operate at cryogenic temperatures. In the experiments, a phase shifter is connected to one of the network bonds to generate an ensemble of quantum graphs by varying the phase delay. The eigenvalue spectrum is found from S-parameter measurements on one-port graphs. With the experimental data, the nearest-neighbor spacing statistics and the impedance statistics of the graphs are examined. It is also demonstrated that time-reversal invariance for microwave propagation in the graphs can be broken without increasing dissipation significantly by making nodes with circulators. Random matrix theory (RMT) successfully describes universal statistical properties of the system. We acknowledge support under contract AFOSR COE Grant FA9550-15-1-0171.

Approximations of quantum-graph vertex couplings by singularly scaled potentials

NASA Astrophysics Data System (ADS)

Exner, Pavel; Manko, Stepan S.

2013-08-01

We investigate the limit properties of a family of Schrödinger operators of the form H_\\varepsilon = -\\frac{{d}^2}{{d}x^2}+ \\frac{\\lambda (\\varepsilon )}{\\varepsilon ^2}Q \\big (\\frac{x}{\\varepsilon }\\big ) acting on n-edge star graphs with the Kirchhoff interface conditions at the vertex. Here the real-valued potential Q has compact support and λ( · ) is analytic around ε = 0 with λ(0) = 1. We show that if the operator has a zero-energy resonance of order m for ε = 1 and λ(1) = 1, in the limit ε → 0 one obtains the Laplacian with a vertex coupling depending on 1+\\frac{1}{2} m(2n-m+1) parameters. We prove the norm-resolvent convergence as well as the convergence of the corresponding on-shell scattering matrices. The obtained vertex couplings are of scale-invariant type provided λ‧(0) = 0; otherwise the scattering matrix depends on energy and the scaled potential becomes asymptotically opaque in the low-energy limit.

Coined quantum walks on weighted graphs

NASA Astrophysics Data System (ADS)

Wong, Thomas G.

2017-11-01

We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy’s quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has l integer self-loops, can be generalized to a quantum walk where each vertex has a single self-loop of real-valued weight l. We apply this real-valued lackadaisical quantum walk to two problems. First, we analyze it on the line or one-dimensional lattice, showing that it is exactly equivalent to a continuous deformation of the three-state Grover walk with faster ballistic dispersion. Second, we generalize Grover’s algorithm, or search on the complete graph, to have a weighted self-loop at each vertex, yielding an improved success probability when l < 3 + 2\\sqrt{2} ≈ 5.828 .

Bipartite separability and nonlocal quantum operations on graphs

NASA Astrophysics Data System (ADS)

Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.

2016-07-01

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

Information Graph Flow: A Geometric Approximation of Quantum and Statistical Systems

NASA Astrophysics Data System (ADS)

Vanchurin, Vitaly

2018-05-01

Given a quantum (or statistical) system with a very large number of degrees of freedom and a preferred tensor product factorization of the Hilbert space (or of a space of distributions) we describe how it can be approximated with a very low-dimensional field theory with geometric degrees of freedom. The geometric approximation procedure consists of three steps. The first step is to construct weighted graphs (we call information graphs) with vertices representing subsystems (e.g., qubits or random variables) and edges representing mutual information (or the flow of information) between subsystems. The second step is to deform the adjacency matrices of the information graphs to that of a (locally) low-dimensional lattice using the graph flow equations introduced in the paper. (Note that the graph flow produces very sparse adjacency matrices and thus might also be used, for example, in machine learning or network science where the task of graph sparsification is of a central importance.) The third step is to define an emergent metric and to derive an effective description of the metric and possibly other degrees of freedom. To illustrate the procedure we analyze (numerically and analytically) two information graph flows with geometric attractors (towards locally one- and two-dimensional lattices) and metric perturbations obeying a geometric flow equation. Our analysis also suggests a possible approach to (a non-perturbative) quantum gravity in which the geometry (a secondary object) emerges directly from a quantum state (a primary object) due to the flow of the information graphs.

Information Graph Flow: A Geometric Approximation of Quantum and Statistical Systems

NASA Astrophysics Data System (ADS)

Vanchurin, Vitaly

2018-06-01

Given a quantum (or statistical) system with a very large number of degrees of freedom and a preferred tensor product factorization of the Hilbert space (or of a space of distributions) we describe how it can be approximated with a very low-dimensional field theory with geometric degrees of freedom. The geometric approximation procedure consists of three steps. The first step is to construct weighted graphs (we call information graphs) with vertices representing subsystems (e.g., qubits or random variables) and edges representing mutual information (or the flow of information) between subsystems. The second step is to deform the adjacency matrices of the information graphs to that of a (locally) low-dimensional lattice using the graph flow equations introduced in the paper. (Note that the graph flow produces very sparse adjacency matrices and thus might also be used, for example, in machine learning or network science where the task of graph sparsification is of a central importance.) The third step is to define an emergent metric and to derive an effective description of the metric and possibly other degrees of freedom. To illustrate the procedure we analyze (numerically and analytically) two information graph flows with geometric attractors (towards locally one- and two-dimensional lattices) and metric perturbations obeying a geometric flow equation. Our analysis also suggests a possible approach to (a non-perturbative) quantum gravity in which the geometry (a secondary object) emerges directly from a quantum state (a primary object) due to the flow of the information graphs.

Quantum Algorithms Based on Physical Processes

DTIC Science & Technology

2013-12-03

quantum walks with hard-core bosons and the graph isomorphism problem,” American Physical Society March meeting, March 2011 Kenneth Rudinger, John...King Gamble, Mark Wellons, Mark Friesen, Dong Zhou, Eric Bach, Robert Joynt, and S.N. Coppersmith, “Quantum random walks of non-interacting bosons on...and noninteracting Bosons to distinguish nonisomorphic graphs. 1) We showed that quantum walks of two hard-core Bosons can distinguish all pairs of

Quantum Algorithms Based on Physical Processes

DTIC Science & Technology

2013-12-02

quantum walks with hard-core bosons and the graph isomorphism problem,” American Physical Society March meeting, March 2011 Kenneth Rudinger, John...King Gamble, Mark Wellons, Mark Friesen, Dong Zhou, Eric Bach, Robert Joynt, and S.N. Coppersmith, “Quantum random walks of non-interacting bosons on...and noninteracting Bosons to distinguish nonisomorphic graphs. 1) We showed that quantum walks of two hard-core Bosons can distinguish all pairs of

Transforming graph states using single-qubit operations.

PubMed

Dahlberg, Axel; Wehner, Stephanie

2018-07-13

Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from another stabilizer (source) state by single-qubit Clifford operations (LC), single-qubit Pauli measurements (LPM) and classical communication (CC) between sites holding the individual qubits. What is more, we provide a recipe to obtain the sequence of LC+LPM+CC operations which prepare the desired target state from the source state, and show how these operations can be applied in parallel to reach the target state in constant time. Our algorithm has applications in quantum networks, quantum computing, and can also serve as a design tool-for example, to find transformations between quantum error correcting codes. We provide a software implementation of our algorithm that makes this tool easier to apply. A key insight leading to our algorithm is to show that the problem is equivalent to one in graph theory, which is to decide whether some graph G ' is a vertex-minor of another graph G The vertex-minor problem is, in general, [Formula: see text]-Complete, but can be solved efficiently on graphs which are not too complex. A measure of the complexity of a graph is the rank-width which equals the Schmidt-rank width of a subclass of stabilizer states called graph states, and thus intuitively is a measure of entanglement. Here, we show that the vertex-minor problem can be solved in time O (| G | 3 ), where | G | is the size of the graph G , whenever the rank-width of G and the size of G ' are bounded. Our algorithm is based on techniques by Courcelle for solving fixed parameter tractable problems, where here the relevant fixed parameter is the rank width. The second half of this paper serves as an accessible but far from exhausting introduction to these concepts, that could be useful for many other problems in quantum information.This article is part of a discussion meeting issue 'Foundations of quantum mechanics and their impact on contemporary society'. © 2018 The Author(s).

Quantum Graphical Models and Belief Propagation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Leifer, M.S.; Perimeter Institute for Theoretical Physics, 31 Caroline Street North, Waterloo Ont., N2L 2Y5; Poulin, D.

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 Markovmore » 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.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hamilton, Kathleen E.; Humble, Travis S.

Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. We introduce the minor set cover (MSC) of a known graph GG : a subset of graph minors which contain any remaining minor of the graph as a subgraph, in an effort to reduce the complexity of the minor embedding problem. Any graph that can be embedded into GG will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, whichmore » is a complete bipartite graph. Furthermore, we show that the complete bipartite graph K N,N has a MSC of N minors, from which K N+1 is identified as the largest clique minor of K N,N. In the case of determining the largest clique minor of hardware with faults we briefly discussed this open question.« less

Hamiltonian Cycle Enumeration via Fermion-Zeon Convolution

NASA Astrophysics Data System (ADS)

Staples, G. Stacey

2017-12-01

Beginning with a simple graph having finite vertex set V, operators are induced on fermion and zeon algebras by the action of the graph's adjacency matrix and combinatorial Laplacian on the vector space spanned by the graph's vertices. When the graph is simple (undirected with no loops or multiple edges), the matrices are symmetric and the induced operators are self-adjoint. The goal of the current paper is to recover a number of known graph-theoretic results from quantum observables constructed as linear operators on fermion and zeon Fock spaces. By considering an "indeterminate" fermion/zeon Fock space, a fermion-zeon convolution operator is defined whose trace recovers the number of Hamiltonian cycles in the graph. This convolution operator is a quantum observable whose expectation reveals the number of Hamiltonian cycles in the graph.

Faster quantum walk search on a weighted graph

NASA Astrophysics Data System (ADS)

Wong, Thomas G.

2015-09-01

A randomly walking quantum particle evolving by Schrödinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time Θ (N3 /4) . We give a weighted version of this graph that preserves vertex transitivity, and we show that the time to search on it can be reduced to nearly Θ (√{N }) . To prove this, we introduce two extensions to degenerate perturbation theory: an adjustment that distinguishes the weights of the edges and a method to determine how precisely the jumping rate of the quantum walk must be chosen.

Multiparty Quantum Blind Signature Scheme Based on Graph States

NASA Astrophysics Data System (ADS)

Jian-Wu, Liang; Xiao-Shu, Liu; Jin-Jing, Shi; Ying, Guo

2018-05-01

A multiparty quantum blind signature scheme is proposed based on the principle of graph state, in which the unitary operations of graph state particles can be applied to generate the quantum blind signature and achieve verification. Different from the classical blind signature based on the mathematical difficulty, the scheme could guarantee not only the anonymity but also the unconditionally security. The analysis shows that the length of the signature generated in our scheme does not become longer as the number of signers increases, and it is easy to increase or decrease the number of signers.

Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

NASA Astrophysics Data System (ADS)

Hamilton, Kathleen E.; Humble, Travis S.

2017-04-01

Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor embedding problem, we introduce the minor set cover (MSC) of a known graph G: a subset of graph minors which contain any remaining minor of the graph as a subgraph. Any graph that can be embedded into G will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete bipartite graph. We show that the complete bipartite graph K_{N,N} has a MSC of N minors, from which K_{N+1} is identified as the largest clique minor of K_{N,N}. The case of determining the largest clique minor of hardware with faults is briefly discussed but remains an open question.

Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

DOE PAGES

Hamilton, Kathleen E.; Humble, Travis S.

2017-02-23

Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. We introduce the minor set cover (MSC) of a known graph GG : a subset of graph minors which contain any remaining minor of the graph as a subgraph, in an effort to reduce the complexity of the minor embedding problem. Any graph that can be embedded into GG will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, whichmore » is a complete bipartite graph. Furthermore, we show that the complete bipartite graph K N,N has a MSC of N minors, from which K N+1 is identified as the largest clique minor of K N,N. In the case of determining the largest clique minor of hardware with faults we briefly discussed this open question.« less

Stationary waves on nonlinear quantum graphs. II. Application of canonical perturbation theory in basic graph structures.

PubMed

Gnutzmann, Sven; Waltner, Daniel

2016-12-01

We consider exact and asymptotic solutions of the stationary cubic nonlinear Schrödinger equation on metric graphs. We focus on some basic example graphs. The asymptotic solutions are obtained using the canonical perturbation formalism developed in our earlier paper [S. Gnutzmann and D. Waltner, Phys. Rev. E 93, 032204 (2016)2470-004510.1103/PhysRevE.93.032204]. For closed example graphs (interval, ring, star graph, tadpole graph), we calculate spectral curves and show how the description of spectra reduces to known characteristic functions of linear quantum graphs in the low-intensity limit. Analogously for open examples, we show how nonlinear scattering of stationary waves arises and how it reduces to known linear scattering amplitudes at low intensities. In the short-wavelength asymptotics we discuss how genuine nonlinear effects may be described using the leading order of canonical perturbation theory: bifurcation of spectral curves (and the corresponding solutions) in closed graphs and multistability in open graphs.

Greenberger-Horne-Zeilinger paradoxes from qudit graph states.

PubMed

Tang, Weidong; Yu, Sixia; Oh, C H

2013-03-08

One fascinating way of revealing quantum nonlocality is the all-versus-nothing test due to Greenberger, Horne, and Zeilinger (GHZ) known as the GHZ paradox. So far genuine multipartite and multilevel GHZ paradoxes are known to exist only in systems containing an odd number of particles. Here we shall construct GHZ paradoxes for an arbitrary number (greater than 3) of particles with the help of qudit graph states on a special kind of graphs, called GHZ graphs. Furthermore, based on the GHZ paradox arising from a GHZ graph, we derive a Bell inequality with two d-outcome observables for each observer, whose maximal violation attained by the corresponding graph state, and a Kochen-Specker inequality testing the quantum contextuality in a state-independent fashion.

Graph-theoretic approach to quantum correlations.

PubMed

Cabello, Adán; Severini, Simone; Winter, Andreas

2014-01-31

Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a subgraph. We show that the maximum value of the correlations for classical, quantum, and more general theories is the independence number, the Lovász number, and the fractional packing number of this subgraph, respectively. We also show that, for any graph, there is always a correlation experiment such that the set of quantum probabilities is exactly the Grötschel-Lovász-Schrijver theta body. This identifies these combinatorial notions as fundamental physical objects and provides a method for singling out experiments with quantum correlations on demand.

Linear game non-contextuality and Bell inequalities—a graph-theoretic approach

NASA Astrophysics Data System (ADS)

Rosicka, M.; Ramanathan, R.; Gnaciński, P.; Horodecki, K.; Horodecki, M.; Horodecki, P.; Severini, S.

2016-04-01

We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR (XOR-d) games we study are a subclass of the well-known linear games. We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. XOR-d games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite XOR-d game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions.

Verification of hypergraph states

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki; Takeuchi, Yuki; Hayashi, Masahito

2017-12-01

Hypergraph states are generalizations of graph states where controlled-Z gates on edges are replaced with generalized controlled-Z gates on hyperedges. Hypergraph states have several advantages over graph states. For example, certain hypergraph states, such as the Union Jack states, are universal resource states for measurement-based quantum computing with only Pauli measurements, while graph state measurement-based quantum computing needs non-Clifford basis measurements. Furthermore, it is impossible to classically efficiently sample measurement results on hypergraph states unless the polynomial hierarchy collapses to the third level. Although several protocols have been proposed to verify graph states with only sequential single-qubit Pauli measurements, there was no verification method for hypergraph states. In this paper, we propose a method for verifying a certain class of hypergraph states with only sequential single-qubit Pauli measurements. Importantly, no i.i.d. property of samples is assumed in our protocol: any artificial entanglement among samples cannot fool the verifier. As applications of our protocol, we consider verified blind quantum computing with hypergraph states, and quantum computational supremacy demonstrations with hypergraph states.

Faithful actions of locally compact quantum groups on classical spaces

NASA Astrophysics Data System (ADS)

Goswami, Debashish; Roy, Sutanu

2017-07-01

We construct examples of locally compact quantum groups coming from bicrossed product construction, including non-Kac ones, which can faithfully and ergodically act on connected classical (noncompact) smooth manifolds. However, none of these actions can be isometric in the sense of Goswami (Commun Math Phys 285(1):141-160, 2009), leading to the conjecture that the result obtained by Goswami and Joardar (Rigidity of action of compact quantum groups on compact, connected manifolds, 2013. arXiv:1309.1294) about nonexistence of genuine quantum isometry of classical compact connected Riemannian manifolds may hold in the noncompact case as well.

Finding paths in tree graphs with a quantum walk

NASA Astrophysics Data System (ADS)

Koch, Daniel; Hillery, Mark

2018-01-01

We analyze the potential for different types of searches using the formalism of scattering random walks on quantum computers. Given a particular type of graph consisting of nodes and connections, a "tree maze," we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both through numerical calculations as well as by using the eigenvectors and eigenvalues of the quantum system.

Characterizing the performance of XOR games and the Shannon capacity of graphs.

PubMed

Ramanathan, Ravishankar; Kay, Alastair; Murta, Gláucia; Horodecki, Paweł

2014-12-12

In this Letter we give a set of necessary and sufficient conditions such that quantum players of a two-party XOR game cannot perform any better than classical players. With any such game, we associate a graph and examine its zero-error communication capacity. This allows us to specify a broad new class of graphs for which the Shannon capacity can be calculated. The conditions also enable the parametrization of new families of games that have no quantum advantage for arbitrary input probability distributions, up to certain symmetries. In the future, these might be used in information-theoretic studies on reproducing the set of quantum nonlocal correlations.

A graph-theoretical representation of multiphoton resonance processes in superconducting quantum circuits

DOE PAGES

Jooya, Hossein Z.; Reihani, Kamran; Chu, Shih-I

2016-11-21

We propose a graph-theoretical formalism to study generic circuit quantum electrodynamics systems consisting of a two level qubit coupled with a single-mode resonator in arbitrary coupling strength regimes beyond rotating-wave approximation. We define colored-weighted graphs, and introduce different products between them to investigate the dynamics of superconducting qubits in transverse, longitudinal, and bidirectional coupling schemes. In conclusion, the intuitive and predictive picture provided by this method, and the simplicity of the mathematical construction, are demonstrated with some numerical studies of the multiphoton resonance processes and quantum interference phenomena for the superconducting qubit systems driven by intense ac fields.

The first eigenvalue of the p-Laplacian on quantum graphs

NASA Astrophysics Data System (ADS)

Del Pezzo, Leandro M.; Rossi, Julio D.

2016-12-01

We study the first eigenvalue of the p-Laplacian (with 1

An uncertainty principle for unimodular quantum groups

DOE Office of Scientific and Technical Information (OSTI.GOV)

Crann, Jason; Université Lille 1 - Sciences et Technologies, UFR de Mathématiques, Laboratoire de Mathématiques Paul Painlevé - UMR CNRS 8524, 59655 Villeneuve d'Ascq Cédex; Kalantar, Mehrdad, E-mail: jason-crann@carleton.ca, E-mail: mkalanta@math.carleton.ca

2014-08-15

We present a generalization of Hirschman's entropic uncertainty principle for locally compact Abelian groups to unimodular locally compact quantum groups. As a corollary, we strengthen a well-known uncertainty principle for compact groups, and generalize the relation to compact quantum groups of Kac type. We also establish the complementarity of finite-dimensional quantum group algebras. In the non-unimodular setting, we obtain an uncertainty relation for arbitrary locally compact groups using the relative entropy with respect to the Haar weight as the measure of uncertainty. We also show that when restricted to q-traces of discrete quantum groups, the relative entropy with respect tomore » the Haar weight reduces to the canonical entropy of the random walk generated by the state.« less

Quantum speedup in solving the maximal-clique problem

NASA Astrophysics Data System (ADS)

Chang, Weng-Long; Yu, Qi; Li, Zhaokai; Chen, Jiahui; Peng, Xinhua; Feng, Mang

2018-03-01

The maximal-clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from electrical engineering, computational chemistry, and bioinformatics to social networks. Here we develop a quantum algorithm to solve the maximal-clique problem for any graph G with n vertices with quadratic speedup over its classical counterparts, where the time and spatial complexities are reduced to, respectively, O (√{2n}) and O (n2) . With respect to oracle-related quantum algorithms for the NP-complete problems, we identify our algorithm as optimal. To justify the feasibility of the proposed quantum algorithm, we successfully solve a typical clique problem for a graph G with two vertices and one edge by carrying out a nuclear magnetic resonance experiment involving four qubits.

Synthesis of Polyferrocenylsilane Block Copolymers and their Crystallization-Driven Self-Assembly in Protic Solvents

NASA Astrophysics Data System (ADS)

Zhou, Hang

Quantum walks are the quantum mechanical analogue of classical random walks. Discrete-time quantum walks have been introduced and studied mostly on the line Z or higher dimensional space Zd but rarely defined on graphs with fractal dimensions because the coin operator depends on the position and the Fourier transform on the fractals is not defined. Inspired by its nature of classical walks, different quantum walks will be defined by choosing different shift and coin operators. When the coin operator is uniform, the results of classical walks will be obtained upon measurement at each step. Moreover, with measurement at each step, our results reveal more information about the classical random walks. In this dissertation, two graphs with fractal dimensions will be considered. The first one is Sierpinski gasket, a degree-4 regular graph with Hausdorff dimension of df = ln 3/ ln 2. The second is the Cantor graph derived like Cantor set, with Hausdorff dimension of df = ln 2/ ln 3. The definitions and amplitude functions of the quantum walks will be introduced. The main part of this dissertation is to derive a recursive formula to compute the amplitude Green function. The exiting probability will be computed and compared with the classical results. When the generation of graphs goes to infinity, the recursion of the walks will be investigated and the convergence rates will be obtained and compared with the classical counterparts.

Graph-based linear scaling electronic structure theory.

PubMed

Niklasson, Anders M N; Mniszewski, Susan M; Negre, Christian F A; Cawkwell, Marc J; Swart, Pieter J; Mohd-Yusof, Jamal; Germann, Timothy C; Wall, Michael E; Bock, Nicolas; Rubensson, Emanuel H; Djidjev, Hristo

2016-06-21

We show how graph theory can be combined with quantum theory to calculate the electronic structure of large complex systems. The graph formalism is general and applicable to a broad range of electronic structure methods and materials, including challenging systems such as biomolecules. The methodology combines well-controlled accuracy, low computational cost, and natural low-communication parallelism. This combination addresses substantial shortcomings of linear scaling electronic structure theory, in particular with respect to quantum-based molecular dynamics simulations.

Graph-based linear scaling electronic structure theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Niklasson, Anders M. N., E-mail: amn@lanl.gov; Negre, Christian F. A.; Cawkwell, Marc J.

2016-06-21

We show how graph theory can be combined with quantum theory to calculate the electronic structure of large complex systems. The graph formalism is general and applicable to a broad range of electronic structure methods and materials, including challenging systems such as biomolecules. The methodology combines well-controlled accuracy, low computational cost, and natural low-communication parallelism. This combination addresses substantial shortcomings of linear scaling electronic structure theory, in particular with respect to quantum-based molecular dynamics simulations.

Graph State-Based Quantum Group Authentication Scheme

NASA Astrophysics Data System (ADS)

Liao, Longxia; Peng, Xiaoqi; Shi, Jinjing; Guo, Ying

2017-02-01

Motivated by the elegant structure of the graph state, we design an ingenious quantum group authentication scheme, which is implemented by operating appropriate operations on the graph state and can solve the problem of multi-user authentication. Three entities, the group authentication server (GAS) as a verifier, multiple users as provers and the trusted third party Trent are included. GAS and Trent assist the multiple users in completing the authentication process, i.e., GAS is responsible for registering all the users while Trent prepares graph states. All the users, who request for authentication, encode their authentication keys on to the graph state by performing Pauli operators. It demonstrates that a novel authentication scheme can be achieved with the flexible use of graph state, which can synchronously authenticate a large number of users, meanwhile the provable security can be guaranteed definitely.

Analysis of quantum error correction with symmetric hypergraph states

NASA Astrophysics Data System (ADS)

Wagner, T.; Kampermann, H.; Bruß, D.

2018-03-01

Graph states have been used to construct quantum error correction codes for independent errors. Hypergraph states generalize graph states, and symmetric hypergraph states have been shown to allow for the correction of correlated errors. In this paper, it is shown that symmetric hypergraph states are not useful for the correction of independent errors, at least for up to 30 qubits. Furthermore, error correction for error models with protected qubits is explored. A class of known graph codes for this scenario is generalized to hypergraph codes.

Quantum dressing orbits on compact groups

NASA Astrophysics Data System (ADS)

Jurčo, Branislav; Šťovíček, Pavel

1993-02-01

The quantum double is shown to imply the dressing transformation on quantum compact groups and the quantum Iwasawa decompositon in the general case. Quantum dressing orbits are described explicitly as *-algebras. The dual coalgebras consisting of differential operators are related to the quantum Weyl elements. Besides, the differential geometry on a quantum leaf allows a remarkably simple construction of irreducible *-representations of the algebras of quantum functions. Representation spaces then consist of analytic functions on classical phase spaces. These representations are also interpreted in the framework of quantization in the spirit of Berezin applied to symplectic leaves on classical compact groups. Convenient “coherent states” are introduced and a correspondence between classical and quantum observables is given.

Compact quantum gates on electron-spin qubits assisted by diamond nitrogen-vacancy centers inside cavities

NASA Astrophysics Data System (ADS)

Wei, Hai-Rui; Deng, Fu-Guo

2013-10-01

Constructing compact quantum circuits for universal quantum gates on solid-state systems is crucial for quantum computing. We present some compact quantum circuits for a deterministic solid-state quantum computing, including the cnot, Toffoli, and Fredkin gates on the diamond NV centers confined inside cavities, achieved by some input-output processes of a single photon. Our quantum circuits for these universal quantum gates are simple and economic. Moreover, additional electron qubits are not employed, but only a single-photon medium. These gates have a long coherent time. We discuss the feasibility of these universal solid-state quantum gates, concluding that they are feasible with current technology.

State transfer in highly connected networks and a quantum Babinet principle

NASA Astrophysics Data System (ADS)

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.

Synchronous correlation matrices and Connes’ embedding conjecture

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dykema, Kenneth J., E-mail: kdykema@math.tamu.edu; Paulsen, Vern, E-mail: vern@math.uh.edu

In the work of Paulsen et al. [J. Funct. Anal. (in press); preprint arXiv:1407.6918], the concept of synchronous quantum correlation matrices was introduced and these were shown to correspond to traces on certain C*-algebras. In particular, synchronous correlation matrices arose in their study of various versions of quantum chromatic numbers of graphs and other quantum versions of graph theoretic parameters. In this paper, we develop these ideas further, focusing on the relations between synchronous correlation matrices and microstates. We prove that Connes’ embedding conjecture is equivalent to the equality of two families of synchronous quantum correlation matrices. We prove thatmore » if Connes’ embedding conjecture has a positive answer, then the tracial rank and projective rank are equal for every graph. We then apply these results to more general non-local games.« less

The operator algebra approach to quantum groups

PubMed Central

Kustermans, Johan; Vaes, Stefaan

2000-01-01

A relatively simple definition of a locally compact quantum group in the C*-algebra setting will be explained as it was recently obtained by the authors. At the same time, we put this definition in the historical and mathematical context of locally compact groups, compact quantum groups, Kac algebras, multiplicative unitaries, and duality theory. PMID:10639116

On the degree conjecture for separability of multipartite quantum states

NASA Astrophysics Data System (ADS)

Hassan, Ali Saif M.; Joag, Pramod S.

2008-01-01

We settle the so-called degree conjecture for the separability of multipartite quantum states, which are normalized graph Laplacians, first given by Braunstein et al. [Phys. Rev. A 73, 012320 (2006)]. The conjecture states that a multipartite quantum state is separable if and only if the degree matrix of the graph associated with the state is equal to the degree matrix of the partial transpose of this graph. We call this statement to be the strong form of the conjecture. In its weak version, the conjecture requires only the necessity, that is, if the state is separable, the corresponding degree matrices match. We prove the strong form of the conjecture for pure multipartite quantum states using the modified tensor product of graphs defined by Hassan and Joag [J. Phys. A 40, 10251 (2007)], as both necessary and sufficient condition for separability. Based on this proof, we give a polynomial-time algorithm for completely factorizing any pure multipartite quantum state. By polynomial-time algorithm, we mean that the execution time of this algorithm increases as a polynomial in m, where m is the number of parts of the quantum system. We give a counterexample to show that the conjecture fails, in general, even in its weak form, for multipartite mixed states. Finally, we prove this conjecture, in its weak form, for a class of multipartite mixed states, giving only a necessary condition for separability.

Isospectral discrete and quantum graphs with the same flip counts and nodal counts

NASA Astrophysics Data System (ADS)

Juul, Jonas S.; Joyner, Christopher H.

2018-06-01

The existence of non-isomorphic graphs which share the same Laplace spectrum (to be referred to as isospectral graphs) leads naturally to the following question: what additional information is required in order to resolve isospectral graphs? It was suggested by Band, Shapira and Smilansky that this might be achieved by either counting the number of nodal domains or the number of times the eigenfunctions change sign (the so-called flip count) (Band et al 2006 J. Phys. A: Math. Gen. 39 13999–4014 Band and Smilansky 2007 Eur. Phys. J. Spec. Top. 145 171–9). Recent examples of (discrete) isospectral graphs with the same flip count and nodal count have been constructed by Ammann by utilising Godsil–McKay switching (Ammann private communication). Here, we provide a simple alternative mechanism that produces systematic examples of both discrete and quantum isospectral graphs with the same flip and nodal counts.

Existence of infinitely many stationary solutions of the L2-subcritical and critical NLSE on compact metric graphs

NASA Astrophysics Data System (ADS)

Dovetta, Simone

2018-04-01

We investigate the existence of stationary solutions for the nonlinear Schrödinger equation on compact metric graphs. In the L2-subcritical setting, we prove the existence of an infinite number of such solutions, for every value of the mass. In the critical regime, the existence of infinitely many solutions is established if the mass is lower than a threshold value, while global minimizers of the NLS energy exist if and only if the mass is lower or equal to the threshold. Moreover, the relation between this threshold and the topology of the graph is characterized. The investigation is based on variational techniques and some new versions of Gagliardo-Nirenberg inequalities.

An Adiabatic Quantum Algorithm for Determining Gracefulness of a Graph

NASA Astrophysics Data System (ADS)

Hosseini, Sayed Mohammad; Davoudi Darareh, Mahdi; Janbaz, Shahrooz; Zaghian, Ali

2017-07-01

Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph G with e edges, is to label the vertices of G with 0, 1, ℒ, e such that, if we specify to each edge the difference value between its two ends, then any of 1, 2, ℒ, e appears exactly once as an edge label. For a given graph, there are still few efficient classical algorithms that determine either it is graceful or not, even for trees - as a well-known class of graphs. In this paper, we introduce an adiabatic quantum algorithm, which for a graceful graph G finds a graceful labelling. Also, this algorithm can determine if G is not graceful. Numerical simulations of the algorithm reveal that its time complexity has a polynomial behaviour with the problem size up to the range of 15 qubits. A general sufficient condition for a combinatorial optimization problem to have a satisfying adiabatic solution is also derived.

Open Quantum Walks and Dissipative Quantum Computing

NASA Astrophysics Data System (ADS)

Petruccione, Francesco

2012-02-01

Open Quantum Walks (OQWs) have been recently introduced as quantum Markov chains on graphs [S. Attal, F. Petruccione, C. Sabot, and I. Sinayskiy, E-print: http://hal.archives-ouvertes.fr/hal-00581553/fr/]. The formulation of the OQWs is exclusively based upon the non-unitary dynamics induced by the environment. It will be shown that OQWs are a very useful tool for the formulation of dissipative quantum computing and quantum state preparation. In particular, it will be shown how to implement single qubit gates and the CNOT gate as OQWs on fully connected graphs. Also, OQWS make possible the dissipative quantum state preparation of arbitrary single qubit states and of all two-qubit Bell states. Finally, it will be shown how to reformulate efficiently a discrete time version of dissipative quantum computing in the language of OQWs.

deBGR: an efficient and near-exact representation of the weighted de Bruijn graph

PubMed Central

Pandey, Prashant; Bender, Michael A.; Johnson, Rob; Patro, Rob

2017-01-01

Abstract Motivation: Almost all de novo short-read genome and transcriptome assemblers start by building a representation of the de Bruijn Graph of the reads they are given as input. Even when other approaches are used for subsequent assembly (e.g. when one is using ‘long read’ technologies like those offered by PacBio or Oxford Nanopore), efficient k-mer processing is still crucial for accurate assembly, and state-of-the-art long-read error-correction methods use de Bruijn Graphs. Because of the centrality of de Bruijn Graphs, researchers have proposed numerous methods for representing de Bruijn Graphs compactly. Some of these proposals sacrifice accuracy to save space. Further, none of these methods store abundance information, i.e. the number of times that each k-mer occurs, which is key in transcriptome assemblers. Results: We present a method for compactly representing the weighted de Bruijn Graph (i.e. with abundance information) with essentially no errors. Our representation yields zero errors while increasing the space requirements by less than 18–28% compared to the approximate de Bruijn graph representation in Squeakr. Our technique is based on a simple invariant that all weighted de Bruijn Graphs must satisfy, and hence is likely to be of general interest and applicable in most weighted de Bruijn Graph-based systems. Availability and implementation: https://github.com/splatlab/debgr. Contact: rob.patro@cs.stonybrook.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:28881995

On the degree conjecture for separability of multipartite quantum states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hassan, Ali Saif M.; Joag, Pramod S.

2008-01-15

We settle the so-called degree conjecture for the separability of multipartite quantum states, which are normalized graph Laplacians, first given by Braunstein et al. [Phys. Rev. A 73, 012320 (2006)]. The conjecture states that a multipartite quantum state is separable if and only if the degree matrix of the graph associated with the state is equal to the degree matrix of the partial transpose of this graph. We call this statement to be the strong form of the conjecture. In its weak version, the conjecture requires only the necessity, that is, if the state is separable, the corresponding degree matricesmore » match. We prove the strong form of the conjecture for pure multipartite quantum states using the modified tensor product of graphs defined by Hassan and Joag [J. Phys. A 40, 10251 (2007)], as both necessary and sufficient condition for separability. Based on this proof, we give a polynomial-time algorithm for completely factorizing any pure multipartite quantum state. By polynomial-time algorithm, we mean that the execution time of this algorithm increases as a polynomial in m, where m is the number of parts of the quantum system. We give a counterexample to show that the conjecture fails, in general, even in its weak form, for multipartite mixed states. Finally, we prove this conjecture, in its weak form, for a class of multipartite mixed states, giving only a necessary condition for separability.« less

A compact quantum correction model for symmetric double gate metal-oxide-semiconductor field-effect transistor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cho, Edward Namkyu; Shin, Yong Hyeon; Yun, Ilgu, E-mail: iyun@yonsei.ac.kr

2014-11-07

A compact quantum correction model for a symmetric double gate (DG) metal-oxide-semiconductor field-effect transistor (MOSFET) is investigated. The compact quantum correction model is proposed from the concepts of the threshold voltage shift (ΔV{sub TH}{sup QM}) and the gate capacitance (C{sub g}) degradation. First of all, ΔV{sub TH}{sup QM} induced by quantum mechanical (QM) effects is modeled. The C{sub g} degradation is then modeled by introducing the inversion layer centroid. With ΔV{sub TH}{sup QM} and the C{sub g} degradation, the QM effects are implemented in previously reported classical model and a comparison between the proposed quantum correction model and numerical simulationmore » results is presented. Based on the results, the proposed quantum correction model can be applicable to the compact model of DG MOSFET.« less

Single-qubit unitary gates by graph scattering

DOE Office of Scientific and Technical Information (OSTI.GOV)

Blumer, Benjamin A.; Underwood, Michael S.; Feder, David L.

2011-12-15

We consider the effects of plane-wave states scattering off finite graphs as an approach to implementing single-qubit unitary operations within the continuous-time quantum walk framework of universal quantum computation. Four semi-infinite tails are attached at arbitrary points of a given graph, representing the input and output registers of a single qubit. For a range of momentum eigenstates, we enumerate all of the graphs with up to n=9 vertices for which the scattering implements a single-qubit gate. As n increases, the number of new unitary operations increases exponentially, and for n>6 the majority correspond to rotations about axes distributed roughly uniformlymore » across the Bloch sphere. Rotations by both rational and irrational multiples of {pi} are found.« less

Systematic dimensionality reduction for continuous-time quantum walks of interacting fermions

NASA Astrophysics Data System (ADS)

Izaac, J. A.; Wang, J. B.

2017-09-01

To extend the continuous-time quantum walk (CTQW) to simulate P distinguishable particles on a graph G composed of N vertices, the Hamiltonian of the system is expanded to act on an NP-dimensional Hilbert space, in effect, simulating the multiparticle CTQW on graph G via a single-particle CTQW propagating on the Cartesian graph product G□P. The properties of the Cartesian graph product have been well studied, and classical simulation of multiparticle CTQWs are common in the literature. However, the above approach is generally applied as is when simulating indistinguishable particles, with the particle statistics then applied to the propagated NP state vector to determine walker probabilities. We address the following question: How can we modify the underlying graph structure G□P in order to simulate multiple interacting fermionic CTQWs with a reduction in the size of the state space? In this paper, we present an algorithm for systematically removing "redundant" and forbidden quantum states from consideration, which provides a significant reduction in the effective dimension of the Hilbert space of the fermionic CTQW. As a result, as the number of interacting fermions in the system increases, the classical computational resources required no longer increases exponentially for fixed N .

Optimal Quantum Spatial Search on Random Temporal Networks

NASA Astrophysics Data System (ADS)

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.

Effective numerical method of spectral analysis of quantum graphs

NASA Astrophysics Data System (ADS)

Barrera-Figueroa, Víctor; Rabinovich, Vladimir S.

2017-05-01

We present in the paper an effective numerical method for the determination of the spectra of periodic metric graphs equipped by Schrödinger operators with real-valued periodic electric potentials as Hamiltonians and with Kirchhoff and Neumann conditions at the vertices. Our method is based on the spectral parameter power series method, which leads to a series representation of the dispersion equation, which is suitable for both analytical and numerical calculations. Several important examples demonstrate the effectiveness of our method for some periodic graphs of interest that possess potentials usually found in quantum mechanics.

Spectral fluctuations of quantum graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pluhař, Z.; Weidenmüller, H. A.

We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry.

A Rout to Protect Quantum Gates constructed via quantum walks from Noises.

PubMed

Du, Yi-Mu; Lu, Li-Hua; Li, You-Quan

2018-05-08

The continuous-time quantum walk on a one-dimensional graph of odd number of sites with an on-site potential at the center is studied. We show that such a quantum-walk system can construct an X-gate of a single qubit as well as a control gate for two qubits, when the potential is much larger than the hopping strength. We investigate the decoherence effect and find that the coherence time can be enhanced by either increasing the number of sites on the graph or the ratio of the potential to the hopping strength, which is expected to motivate the design of the quantum gate with long coherence time. We also suggest several experimental proposals to realize such a system.

On the existence of point spectrum for branching strips quantum graph

DOE Office of Scientific and Technical Information (OSTI.GOV)

Popov, I. Yu., E-mail: popov1955@gmail.com; Skorynina, A. N.; Blinova, I. V., E-mail: irin-a@yandex.ru

2014-03-15

The quantum graph having the form of branching strips with hexagonal (honeycomb) structure is considered. The Hamiltonian is determined as free 1D Schrödinger operator on each edge and some “boundary” conditions at each vertex. We obtain the conditions ensuring the point spectrum's existence for the Schrödinger operator of the system and relations that give us the eigenvalues.

Hearing the shape of the Ising model with a programmable superconducting-flux annealer.

PubMed

Vinci, Walter; Markström, Klas; Boixo, Sergio; Roy, Aidan; Spedalieri, Federico M; Warburton, Paul A; Severini, Simone

2014-07-16

Two objects can be distinguished if they have different measurable properties. Thus, distinguishability depends on the Physics of the objects. In considering graphs, we revisit the Ising model as a framework to define physically meaningful spectral invariants. In this context, we introduce a family of refinements of the classical spectrum and consider the quantum partition function. We demonstrate that the energy spectrum of the quantum Ising Hamiltonian is a stronger invariant than the classical one without refinements. For the purpose of implementing the related physical systems, we perform experiments on a programmable annealer with superconducting flux technology. Departing from the paradigm of adiabatic computation, we take advantage of a noisy evolution of the device to generate statistics of low energy states. The graphs considered in the experiments have the same classical partition functions, but different quantum spectra. The data obtained from the annealer distinguish non-isomorphic graphs via information contained in the classical refinements of the functions but not via the differences in the quantum spectra.

Integrability of conformal fishnet theory

NASA Astrophysics Data System (ADS)

Gromov, Nikolay; Kazakov, Vladimir; Korchemsky, Gregory; Negro, Stefano; Sizov, Grigory

2018-01-01

We study integrability of fishnet-type Feynman graphs arising in planar four-dimensional bi-scalar chiral theory recently proposed in arXiv:1512.06704 as a special double scaling limit of gamma-deformed N = 4 SYM theory. We show that the transfer matrix "building" the fishnet graphs emerges from the R-matrix of non-compact conformal SU(2 , 2) Heisenberg spin chain with spins belonging to principal series representations of the four-dimensional conformal group. We demonstrate explicitly a relationship between this integrable spin chain and the Quantum Spectral Curve (QSC) of N = 4 SYM. Using QSC and spin chain methods, we construct Baxter equation for Q-functions of the conformal spin chain needed for computation of the anomalous dimensions of operators of the type tr( ϕ 1 J ) where ϕ 1 is one of the two scalars of the theory. For J = 3 we derive from QSC a quantization condition that fixes the relevant solution of Baxter equation. The scaling dimensions of the operators only receive contributions from wheel-like graphs. We develop integrability techniques to compute the divergent part of these graphs and use it to present the weak coupling expansion of dimensions to very high orders. Then we apply our exact equations to calculate the anomalous dimensions with J = 3 to practically unlimited precision at any coupling. These equations also describe an infinite tower of local conformal operators all carrying the same charge J = 3. The method should be applicable for any J and, in principle, to any local operators of bi-scalar theory. We show that at strong coupling the scaling dimensions can be derived from semiclassical quantization of finite gap solutions describing an integrable system of noncompact SU(2 , 2) spins. This bears similarities with the classical strings arising in the strongly coupled limit of N = 4 SYM.

Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing.

PubMed

Hayashi, Masahito; Morimae, Tomoyuki

2015-11-27

We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store entangled many-qubit states. Bob generates copies of a graph state, which is a universal resource state for measurement-based quantum computing, and sends Alice each qubit of them one by one. Alice adaptively measures each qubit according to her program. If Bob is honest, he generates the correct graph state, and, therefore, Alice can obtain the correct computation result. Regarding the security, whatever Bob does, Bob cannot get any information about Alice's computation because of the no-signaling principle. Furthermore, malicious Bob does not necessarily send the copies of the correct graph state, but Alice can check the correctness of Bob's state by directly verifying the stabilizers of some copies.

Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing

NASA Astrophysics Data System (ADS)

Hayashi, Masahito; Morimae, Tomoyuki

2015-11-01

We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store entangled many-qubit states. Bob generates copies of a graph state, which is a universal resource state for measurement-based quantum computing, and sends Alice each qubit of them one by one. Alice adaptively measures each qubit according to her program. If Bob is honest, he generates the correct graph state, and, therefore, Alice can obtain the correct computation result. Regarding the security, whatever Bob does, Bob cannot get any information about Alice's computation because of the no-signaling principle. Furthermore, malicious Bob does not necessarily send the copies of the correct graph state, but Alice can check the correctness of Bob's state by directly verifying the stabilizers of some copies.

Solving Set Cover with Pairs Problem using Quantum Annealing

NASA Astrophysics Data System (ADS)

Cao, Yudong; Jiang, Shuxian; Perouli, Debbie; Kais, Sabre

2016-09-01

Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that plays an important role in networking, computational biology, and biochemistry. We show an explicit construction of Ising Hamiltonians whose ground states encode the solution of SCP instances. We numerically simulate the time-dependent Schrödinger equation in order to test the performance of quantum annealing for random instances and compare with that of simulated annealing. We also discuss explicit embedding strategies for realizing our Hamiltonian construction on the D-wave type restricted Ising Hamiltonian based on Chimera graphs. Our embedding on the Chimera graph preserves the structure of the original SCP instance and in particular, the embedding for general complete bipartite graphs and logical disjunctions may be of broader use than that the specific problem we deal with.

Physical approach to quantum networks with massive particles

NASA Astrophysics Data System (ADS)

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 localized solutions only couple to each other and are able to jump from one site to another as if they were trapped in a discrete lattice.

Coherent states for quantum compact groups

NASA Astrophysics Data System (ADS)

Jurĉo, B.; Ŝťovíĉek, P.

1996-12-01

Coherent states are introduced and their properties are discussed for simple quantum compact groups A l, Bl, Cl and D l. The multiplicative form of the canonical element for the quantum double is used to introduce the holomorphic coordinates on a general quantum dressing orbit. The coherent state is interpreted as a holomorphic function on this orbit with values in the carrier Hilbert space of an irreducible representation of the corresponding quantized enveloping algebra. Using Gauss decomposition, the commutation relations for the holomorphic coordinates on the dressing orbit are derived explicitly and given in a compact R-matrix formulation (generalizing this way the q-deformed Grassmann and flag manifolds). The antiholomorphic realization of the irreducible representations of a compact quantum group (the analogue of the Borel-Weil construction) is described using the concept of coherent state. The relation between representation theory and non-commutative differential geometry is suggested.

Scalable quantum computing based on stationary spin qubits in coupled quantum dots inside double-sided optical microcavities

NASA Astrophysics Data System (ADS)

Wei, Hai-Rui; Deng, Fu-Guo

2014-12-01

Quantum logic gates are the key elements in quantum computing. Here we investigate the possibility of achieving a scalable and compact quantum computing based on stationary electron-spin qubits, by using the giant optical circular birefringence induced by quantum-dot spins in double-sided optical microcavities as a result of cavity quantum electrodynamics. We design the compact quantum circuits for implementing universal and deterministic quantum gates for electron-spin systems, including the two-qubit CNOT gate and the three-qubit Toffoli gate. They are compact and economic, and they do not require additional electron-spin qubits. Moreover, our devices have good scalability and are attractive as they both are based on solid-state quantum systems and the qubits are stationary. They are feasible with the current experimental technology, and both high fidelity and high efficiency can be achieved when the ratio of the side leakage to the cavity decay is low.

Scalable quantum computing based on stationary spin qubits in coupled quantum dots inside double-sided optical microcavities.

PubMed

Wei, Hai-Rui; Deng, Fu-Guo

2014-12-18

Quantum logic gates are the key elements in quantum computing. Here we investigate the possibility of achieving a scalable and compact quantum computing based on stationary electron-spin qubits, by using the giant optical circular birefringence induced by quantum-dot spins in double-sided optical microcavities as a result of cavity quantum electrodynamics. We design the compact quantum circuits for implementing universal and deterministic quantum gates for electron-spin systems, including the two-qubit CNOT gate and the three-qubit Toffoli gate. They are compact and economic, and they do not require additional electron-spin qubits. Moreover, our devices have good scalability and are attractive as they both are based on solid-state quantum systems and the qubits are stationary. They are feasible with the current experimental technology, and both high fidelity and high efficiency can be achieved when the ratio of the side leakage to the cavity decay is low.

Delay-time distribution in the scattering of time-narrow wave packets (II)—quantum graphs

NASA Astrophysics Data System (ADS)

Smilansky, Uzy; Schanz, Holger

2018-02-01

We apply the framework developed in the preceding paper in this series (Smilansky 2017 J. Phys. A: Math. Theor. 50 215301) to compute the time-delay distribution in the scattering of ultra short radio frequency pulses on complex networks of transmission lines which are modeled by metric (quantum) graphs. We consider wave packets which are centered at high wave number and comprise many energy levels. In the limit of pulses of very short duration we compute upper and lower bounds to the actual time-delay distribution of the radiation emerging from the network using a simplified problem where time is replaced by the discrete count of vertex-scattering events. The classical limit of the time-delay distribution is also discussed and we show that for finite networks it decays exponentially, with a decay constant which depends on the graph connectivity and the distribution of its edge lengths. We illustrate and apply our theory to a simple model graph where an algebraic decay of the quantum time-delay distribution is established.

Quantum Optimization of Fully Connected Spin Glasses

NASA Astrophysics Data System (ADS)

Venturelli, Davide; Mandrà, Salvatore; Knysh, Sergey; O'Gorman, Bryan; Biswas, Rupak; Smelyanskiy, Vadim

2015-07-01

Many NP-hard problems can be seen as the task of finding a ground state of a disordered highly connected Ising spin glass. If solutions are sought by means of quantum annealing, it is often necessary to represent those graphs in the annealer's hardware by means of the graph-minor embedding technique, generating a final Hamiltonian consisting of coupled chains of ferromagnetically bound spins, whose binding energy is a free parameter. In order to investigate the effect of embedding on problems of interest, the fully connected Sherrington-Kirkpatrick model with random ±1 couplings is programmed on the D-Wave TwoTM annealer using up to 270 qubits interacting on a Chimera-type graph. We present the best embedding prescriptions for encoding the Sherrington-Kirkpatrick problem in the Chimera graph. The results indicate that the optimal choice of embedding parameters could be associated with the emergence of the spin-glass phase of the embedded problem, whose presence was previously uncertain. This optimal parameter setting allows the performance of the quantum annealer to compete with (and potentially outperform, in the absence of analog control errors) optimized simulated annealing algorithms.

Anderson localization for radial tree-like random quantum graphs

NASA Astrophysics Data System (ADS)

Hislop, Peter D.; Post, Olaf

We prove that certain random models associated with radial, tree-like, rooted quantum graphs exhibit Anderson localization at all energies. The two main examples are the random length model (RLM) and the random Kirchhoff model (RKM). In the RLM, the lengths of each generation of edges form a family of independent, identically distributed random variables (iid). For the RKM, the iid random variables are associated with each generation of vertices and moderate the current flow through the vertex. We consider extensions to various families of decorated graphs and prove stability of localization with respect to decoration. In particular, we prove Anderson localization for the random necklace model.

Fisher metric, geometric entanglement, and spin networks

NASA Astrophysics Data System (ADS)

Chirco, Goffredo; Mele, Fabio M.; Oriti, Daniele; Vitale, Patrizia

2018-02-01

Starting from recent results on the geometric formulation of quantum mechanics, we propose a new information geometric characterization of entanglement for spin network states in the context of quantum gravity. For the simple case of a single-link fixed graph (Wilson line), we detail the construction of a Riemannian Fisher metric tensor and a symplectic structure on the graph Hilbert space, showing how these encode the whole information about separability and entanglement. In particular, the Fisher metric defines an entanglement monotone which provides a notion of distance among states in the Hilbert space. In the maximally entangled gauge-invariant case, the entanglement monotone is proportional to a power of the area of the surface dual to the link thus supporting a connection between entanglement and the (simplicial) geometric properties of spin network states. We further extend such analysis to the study of nonlocal correlations between two nonadjacent regions of a generic spin network graph characterized by the bipartite unfolding of an intertwiner state. Our analysis confirms the interpretation of spin network bonds as a result of entanglement and to regard the same spin network graph as an information graph, whose connectivity encodes, both at the local and nonlocal level, the quantum correlations among its parts. This gives a further connection between entanglement and geometry.

Graph-associated entanglement cost of a multipartite state in exact and finite-block-length approximate constructions

NASA Astrophysics Data System (ADS)

Yamasaki, Hayata; Soeda, Akihito; Murao, Mio

2017-09-01

We introduce and analyze graph-associated entanglement cost, a generalization of the entanglement cost of quantum states to multipartite settings. We identify a necessary and sufficient condition for any multipartite entangled state to be constructible when quantum communication between the multiple parties is restricted to a quantum network represented by a tree. The condition for exact state construction is expressed in terms of the Schmidt ranks of the state defined with respect to edges of the tree. We also study approximate state construction and provide a second-order asymptotic analysis.

Towards the map of quantum gravity

NASA Astrophysics Data System (ADS)

Mielczarek, Jakub; Trześniewski, Tomasz

2018-06-01

In this paper we point out some possible links between different approaches to quantum gravity and theories of the Planck scale physics. In particular, connections between loop quantum gravity, causal dynamical triangulations, Hořava-Lifshitz gravity, asymptotic safety scenario, Quantum Graphity, deformations of relativistic symmetries and nonlinear phase space models are discussed. The main focus is on quantum deformations of the Hypersurface Deformations Algebra and Poincaré algebra, nonlinear structure of phase space, the running dimension of spacetime and nontrivial phase diagram of quantum gravity. We present an attempt to arrange the observed relations in the form of a graph, highlighting different aspects of quantum gravity. The analysis is performed in the spirit of a mind map, which represents the architectural approach to the studied theory, being a natural way to describe the properties of a complex system. We hope that the constructed graphs (maps) will turn out to be helpful in uncovering the global picture of quantum gravity as a particular complex system and serve as a useful guide for the researchers.

Compact component for integrated quantum optic processing

PubMed Central

Sahu, Partha Pratim

2015-01-01

Quantum interference is indispensable to derive integrated quantum optic technologies (1–2). For further progress in large scale integration of quantum optic circuit, we have introduced first time two mode interference (TMI) coupler as an ultra compact component. The quantum interference varying with coupling length corresponding to the coupling ratio is studied and the larger HOM dip with peak visibility ~0.963 ± 0.009 is found at half coupling length of TMI coupler. Our results also demonstrate complex quantum interference with high fabrication tolerance and quantum visibility in TMI coupler. PMID:26584759

[A retrieval method of drug molecules based on graph collapsing].

PubMed

Qu, J W; Lv, X Q; Liu, Z M; Liao, Y; Sun, P H; Wang, B; Tang, Z

2018-04-18

To establish a compact and efficient hypergraph representation and a graph-similarity-based retrieval method of molecules to achieve effective and efficient medicine information retrieval. Chemical structural formula (CSF) was a primary search target as a unique and precise identifier for each compound at the molecular level in the research field of medicine information retrieval. To retrieve medicine information effectively and efficiently, a complete workflow of the graph-based CSF retrieval system was introduced. This system accepted the photos taken from smartphones and the sketches drawn on tablet personal computers as CSF inputs, and formalized the CSFs with the corresponding graphs. Then this paper proposed a compact and efficient hypergraph representation for molecules on the basis of analyzing factors that directly affected the efficiency of graph matching. According to the characteristics of CSFs, a hierarchical collapsing method combining graph isomorphism and frequent subgraph mining was adopted. There was yet a fundamental challenge, subgraph overlapping during the collapsing procedure, which hindered the method from establishing the correct compact hypergraph of an original CSF graph. Therefore, a graph-isomorphism-based algorithm was proposed to select dominant acyclic subgraphs on the basis of overlapping analysis. Finally, the spatial similarity among graphical CSFs was evaluated by multi-dimensional measures of similarity. To evaluate the performance of the proposed method, the proposed system was firstly compared with Wikipedia Chemical Structure Explorer (WCSE), the state-of-the-art system that allowed CSF similarity searching within Wikipedia molecules dataset, on retrieval accuracy. The system achieved higher values on mean average precision, discounted cumulative gain, rank-biased precision, and expected reciprocal rank than WCSE from the top-2 to the top-10 retrieved results. Specifically, the system achieved 10%, 1.41, 6.42%, and 1.32% higher than WCSE on these metrics for top-10 retrieval results, respectively. Moreover, several retrieval cases were presented to intuitively compare with WCSE. The results of the above comparative study demonstrated that the proposed method outperformed the existing method with regard to accuracy and effectiveness. This paper proposes a graph-similarity-based retrieval approach for medicine information. To obtain satisfactory retrieval results, an isomorphism-based algorithm is proposed for dominant subgraph selection based on the subgraph overlapping analysis, as well as an effective and efficient hypergraph representation of molecules. Experiment results demonstrate the effectiveness of the proposed approach.

The ergodicity landscape of quantum theories

NASA Astrophysics Data System (ADS)

Ho, Wen Wei; Radičević, Đorđe

2018-02-01

This paper is a physicist’s review of the major conceptual issues concerning the problem of spectral universality in quantum systems. Here, we present a unified, graph-based view of all archetypical models of such universality (billiards, particles in random media, interacting spin or fermion systems). We find phenomenological relations between the onset of ergodicity (Gaussian-random delocalization of eigenstates) and the structure of the appropriate graphs, and we construct a heuristic picture of summing trajectories on graphs that describes why a generic interacting system should be ergodic. We also provide an operator-based discussion of quantum chaos and propose criteria to distinguish bases that can usefully diagnose ergodicity. The result of this analysis is a rough but systematic outline of how ergodicity changes across the space of all theories with a given Hilbert space dimension. As a particular example, we study the SYK model and report on the transition from maximal to partial ergodicity as the disorder strength is decreased.

Quantum Bose-Hubbard model with an evolving graph as a toy model for emergent spacetime

NASA Astrophysics Data System (ADS)

Hamma, Alioscia; Markopoulou, Fotini; Lloyd, Seth; Caravelli, Francesco; Severini, Simone; Markström, Klas

2010-05-01

We present a toy model for interacting matter and geometry that explores quantum dynamics in a spin system as a precursor to a quantum theory of gravity. The model has no a priori geometric properties; instead, locality is inferred from the more fundamental notion of interaction between the matter degrees of freedom. The interaction terms are themselves quantum degrees of freedom so that the structure of interactions and hence the resulting local and causal structures are dynamical. The system is a Hubbard model where the graph of the interactions is a set of quantum evolving variables. We show entanglement between spatial and matter degrees of freedom. We study numerically the quantum system and analyze its entanglement dynamics. We analyze the asymptotic behavior of the classical model. Finally, we discuss analogues of trapped surfaces and gravitational attraction in this simple model.

Thermooptic two-mode interference device for reconfigurable quantum optic circuits

NASA Astrophysics Data System (ADS)

Sahu, Partha Pratim

2018-06-01

Reconfigurable large-scale integrated quantum optic circuits require compact component having capability of accurate manipulation of quantum entanglement for quantum communication and information processing applications. Here, a thermooptic two-mode interference coupler has been introduced as a compact component for generation of reconfigurable complex multi-photons quantum interference. Both theoretical and experimental approaches are used for the demonstration of two-photon and four-photon quantum entanglement manipulated with thermooptic phase change in TMI region. Our results demonstrate complex multi-photon quantum interference with high fabrication tolerance and quantum fidelity in smaller dimension than previous thermooptic Mach-Zehnder implementations.

Solving the scalability issue in quantum-based refinement: Q|R#1.

PubMed

Zheng, Min; Moriarty, Nigel W; Xu, Yanting; Reimers, Jeffrey R; Afonine, Pavel V; Waller, Mark P

2017-12-01

Accurately refining biomacromolecules using a quantum-chemical method is challenging because the cost of a quantum-chemical calculation scales approximately as n m , where n is the number of atoms and m (≥3) is based on the quantum method of choice. This fundamental problem means that quantum-chemical calculations become intractable when the size of the system requires more computational resources than are available. In the development of the software package called Q|R, this issue is referred to as Q|R#1. A divide-and-conquer approach has been developed that fragments the atomic model into small manageable pieces in order to solve Q|R#1. Firstly, the atomic model of a crystal structure is analyzed to detect noncovalent interactions between residues, and the results of the analysis are represented as an interaction graph. Secondly, a graph-clustering algorithm is used to partition the interaction graph into a set of clusters in such a way as to minimize disruption to the noncovalent interaction network. Thirdly, the environment surrounding each individual cluster is analyzed and any residue that is interacting with a particular cluster is assigned to the buffer region of that particular cluster. A fragment is defined as a cluster plus its buffer region. The gradients for all atoms from each of the fragments are computed, and only the gradients from each cluster are combined to create the total gradients. A quantum-based refinement is carried out using the total gradients as chemical restraints. In order to validate this interaction graph-based fragmentation approach in Q|R, the entire atomic model of an amyloid cross-β spine crystal structure (PDB entry 2oNA) was refined.

Simulation Of Wave Function And Probability Density Of Modified Poschl Teller Potential Derived Using Supersymmetric Quantum Mechanics

NASA Astrophysics Data System (ADS)

Angraini, Lily Maysari; Suparmi, Variani, Viska Inda

2010-12-01

SUSY quantum mechanics can be applied to solve Schrodinger equation for high dimensional system that can be reduced into one dimensional system and represented in lowering and raising operators. Lowering and raising operators can be obtained using relationship between original Hamiltonian equation and the (super) potential equation. In this paper SUSY quantum mechanics is used as a method to obtain the wave function and the energy level of the Modified Poschl Teller potential. The graph of wave function equation and probability density is simulated by using Delphi 7.0 programming language. Finally, the expectation value of quantum mechanics operator could be calculated analytically using integral form or probability density graph resulted by the programming.

Multimode entanglement in reconfigurable graph states using optical frequency combs

PubMed Central

Cai, Y.; Roslund, J.; Ferrini, G.; Arzani, F.; Xu, X.; Fabre, C.; Treps, N.

2017-01-01

Multimode entanglement is an essential resource for quantum information processing and quantum metrology. However, multimode entangled states are generally constructed by targeting a specific graph configuration. This yields to a fixed experimental setup that therefore exhibits reduced versatility and scalability. Here we demonstrate an optical on-demand, reconfigurable multimode entangled state, using an intrinsically multimode quantum resource and a homodyne detection apparatus. Without altering either the initial squeezing source or experimental architecture, we realize the construction of thirteen cluster states of various sizes and connectivities as well as the implementation of a secret sharing protocol. In particular, this system enables the interrogation of quantum correlations and fluctuations for any multimode Gaussian state. This initiates an avenue for implementing on-demand quantum information processing by only adapting the measurement process and not the experimental layout. PMID:28585530

Equivalence of Szegedy's and coined quantum walks

NASA Astrophysics Data System (ADS)

Wong, Thomas G.

2017-09-01

Szegedy's quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the bipartite double cover of the original graph. To search, one can simply quantize a Markov chain with absorbing vertices. Recently, Santos proposed two alternative search algorithms that instead utilize the sign-flip oracle in Grover's algorithm rather than absorbing vertices. In this paper, we show that these two algorithms are exactly equivalent to two algorithms involving coined quantum walks, which are walks on the vertices of the original graph with an internal degree of freedom. The first scheme is equivalent to a coined quantum walk with one walk step per query of Grover's oracle, and the second is equivalent to a coined quantum walk with two walk steps per query of Grover's oracle. These equivalences lie outside the previously known equivalence of Szegedy's quantum walk with absorbing vertices and the coined quantum walk with the negative identity operator as the coin for marked vertices, whose precise relationships we also investigate.

Quantum gravity as an information network self-organization of a 4D universe

NASA Astrophysics Data System (ADS)

Trugenberger, Carlo A.

2015-10-01

I propose a quantum gravity model in which the fundamental degrees of freedom are information bits for both discrete space-time points and links connecting them. The Hamiltonian is a very simple network model consisting of a ferromagnetic Ising model for space-time vertices and an antiferromagnetic Ising model for the links. As a result of the frustration between these two terms, the ground state self-organizes as a new type of low-clustering graph with finite Hausdorff dimension 4. The spectral dimension is lower than the Hausdorff dimension: it coincides with the Hausdorff dimension 4 at a first quantum phase transition corresponding to an IR fixed point, while at a second quantum phase transition describing small scales space-time dissolves into disordered information bits. The large-scale dimension 4 of the universe is related to the upper critical dimension 4 of the Ising model. At finite temperatures the universe graph emerges without a big bang and without singularities from a ferromagnetic phase transition in which space-time itself forms out of a hot soup of information bits. When the temperature is lowered the universe graph unfolds and expands by lowering its connectivity, a mechanism I have called topological expansion. The model admits topological black hole excitations corresponding to graphs containing holes with no space-time inside and with "Schwarzschild-like" horizons with a lower spectral dimension.

Structural Features of Algebraic Quantum Notations

ERIC Educational Resources Information Center

Gire, Elizabeth; Price, Edward

2015-01-01

The formalism of quantum mechanics includes a rich collection of representations for describing quantum systems, including functions, graphs, matrices, histograms of probabilities, and Dirac notation. The varied features of these representations affect how computations are performed. For example, identifying probabilities of measurement outcomes…

Controlling bi-partite entanglement in multi-qubit systems

NASA Astrophysics Data System (ADS)

Plesch, Martin; Novotný, Jaroslav; Dzuráková, Zuzana; Buzek, Vladimír

2004-02-01

Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper, we utilize a concept of entangled graphs with weighted edges in order to analyse pure quantum states of multi-qubit systems. Here qubits are represented by vertexes of the graph, while the presence of bi-partite entanglement is represented by an edge between corresponding vertexes. The weight of each edge is defined to be the entanglement between the two qubits connected by the edge, as measured by the concurrence. We prove that each entangled graph with entanglement bounded by a specific value of the concurrence can be represented by a pure multi-qubit state. In addition, we present a logic network with O(N2) elementary gates that can be used for preparation of the weighted entangled graphs of N qubits.

Curved noncommutative tori as Leibniz quantum compact metric spaces

DOE Office of Scientific and Technical Information (OSTI.GOV)

Latrémolière, Frédéric, E-mail: frederic@math.du.edu

We prove that curved noncommutative tori are Leibniz quantum compact metric spaces and that they form a continuous family over the group of invertible matrices with entries in the image of the quantum tori for the conjugation by modular conjugation operator in the regular representation, when this group is endowed with a natural length function.

Quantum annealing correction with minor embedding

NASA Astrophysics Data System (ADS)

Vinci, Walter; Albash, Tameem; Paz-Silva, Gerardo; Hen, Itay; Lidar, Daniel A.

2015-10-01

Quantum annealing provides a promising route for the development of quantum optimization devices, but the usefulness of such devices will be limited in part by the range of implementable problems as dictated by hardware constraints. To overcome constraints imposed by restricted connectivity between qubits, a larger set of interactions can be approximated using minor embedding techniques whereby several physical qubits are used to represent a single logical qubit. However, minor embedding introduces new types of errors due to its approximate nature. We introduce and study quantum annealing correction schemes designed to improve the performance of quantum annealers in conjunction with minor embedding, thus leading to a hybrid scheme defined over an encoded graph. We argue that this scheme can be efficiently decoded using an energy minimization technique provided the density of errors does not exceed the per-site percolation threshold of the encoded graph. We test the hybrid scheme using a D-Wave Two processor on problems for which the encoded graph is a two-level grid and the Ising model is known to be NP-hard. The problems we consider are frustrated Ising model problem instances with "planted" (a priori known) solutions. Applied in conjunction with optimized energy penalties and decoding techniques, we find that this approach enables the quantum annealer to solve minor embedded instances with significantly higher success probability than it would without error correction. Our work demonstrates that quantum annealing correction can and should be used to improve the robustness of quantum annealing not only for natively embeddable problems but also when minor embedding is used to extend the connectivity of physical devices.

Entanglement guarantees emergence of cooperation in quantum prisoner's dilemma games on networks.

PubMed

Li, Angsheng; Yong, Xi

2014-09-05

It was known that cooperation of evolutionary prisoner's dilemma games fails to emerge in homogenous networks such as random graphs. Here we proposed a quantum prisoner's dilemma game. The game consists of two players, in which each player has three choices of strategy: cooperator (C), defector (D) and super cooperator (denoted by Q). We found that quantum entanglement guarantees emergence of a new cooperation, the super cooperation of the quantum prisoner's dilemma games, and that entanglement is the mechanism of guaranteed emergence of cooperation of evolutionary prisoner's dilemma games on networks. We showed that for a game with temptation b, there exists a threshold arccos √b/b for a measurement of entanglement, beyond which, (super) cooperation of evolutionary quantum prisoner's dilemma games is guaranteed to quickly emerge, giving rise to stochastic convergence of the cooperations, that if the entanglement degree γ is less than the threshold arccos √b/b, then the equilibrium frequency of cooperations of the games is positively correlated to the entanglement degree γ, and that if γ is less than arccos √b/b and b is beyond some boundary, then the equilibrium frequency of cooperations of the games on random graphs decreases as the average degree of the graphs increases.

Instability of Bose-Einstein condensation into the one-particle ground state on quantum graphs under repulsive perturbations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bolte, Jens, E-mail: jens.bolte@rhul.ac.uk; Kerner, Joachim, E-mail: joachim.kerner@fernuni-hagen.de

In this paper we investigate Bose-Einstein condensation into the one-particle ground state in interacting quantum many-particle systems on graphs. We extend previous results obtained for particles on an interval and show that even arbitrarily small repulsive two-particle interactions destroy the condensate in the one-particle ground state present in the non-interacting Bose gas. Our results also cover singular two-particle interactions, such as the well-known Lieb-Liniger model, in the thermodynamic limit.

Graph-theoretic strengths of contextuality

NASA Astrophysics Data System (ADS)

de Silva, Nadish

2017-03-01

Cabello-Severini-Winter and Abramsky-Hardy (building on the framework of Abramsky-Brandenburger) both provide classes of Bell and contextuality inequalities for very general experimental scenarios using vastly different mathematical techniques. We review both approaches, carefully detail the links between them, and give simple, graph-theoretic methods for finding inequality-free proofs of nonlocality and contextuality and for finding states exhibiting strong nonlocality and/or contextuality. Finally, we apply these methods to concrete examples in stabilizer quantum mechanics relevant to understanding contextuality as a resource in quantum computation.

A quantum annealing approach for fault detection and diagnosis of graph-based systems

NASA Astrophysics Data System (ADS)

Perdomo-Ortiz, A.; Fluegemann, J.; Narasimhan, S.; Biswas, R.; Smelyanskiy, V. N.

2015-02-01

Diagnosing the minimal set of faults capable of explaining a set of given observations, e.g., from sensor readouts, is a hard combinatorial optimization problem usually tackled with artificial intelligence techniques. We present the mapping of this combinatorial problem to quadratic unconstrained binary optimization (QUBO), and the experimental results of instances embedded onto a quantum annealing device with 509 quantum bits. Besides being the first time a quantum approach has been proposed for problems in the advanced diagnostics community, to the best of our knowledge this work is also the first research utilizing the route Problem → QUBO → Direct embedding into quantum hardware, where we are able to implement and tackle problem instances with sizes that go beyond previously reported toy-model proof-of-principle quantum annealing implementations; this is a significant leap in the solution of problems via direct-embedding adiabatic quantum optimization. We discuss some of the programmability challenges in the current generation of the quantum device as well as a few possible ways to extend this work to more complex arbitrary network graphs.

Gapped two-body Hamiltonian for continuous-variable quantum computation.

PubMed

Aolita, Leandro; Roncaglia, Augusto J; Ferraro, Alessandro; Acín, Antonio

2011-03-04

We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv) possess a constant energy gap proportional to the squared inverse of the squeezing. Their ground states are the celebrated Gaussian graph states, which are universal resources for quantum computation in the limit of infinite squeezing. These Hamiltonians constitute the basic ingredient for the adiabatic preparation of graph states and thus open new venues for the physical realization of continuous-variable quantum computing beyond the standard optical approaches. We characterize the correlations in these systems at thermal equilibrium. In particular, we prove that the correlations across any multipartition are contained exactly in its boundary, automatically yielding a correlation area law.

Belief propagation decoding of quantum channels by passing quantum messages

NASA Astrophysics Data System (ADS)

Renes, Joseph M.

2017-07-01

The belief propagation (BP) algorithm is a powerful tool in a wide range of disciplines from statistical physics to machine learning to computational biology, and is ubiquitous in decoding classical error-correcting codes. The algorithm works by passing messages between nodes of the factor graph associated with the code and enables efficient decoding of the channel, in some cases even up to the Shannon capacity. Here we construct the first BP algorithm which passes quantum messages on the factor graph and is capable of decoding the classical-quantum channel with pure state outputs. This gives explicit decoding circuits whose number of gates is quadratic in the code length. We also show that this decoder can be modified to work with polar codes for the pure state channel and as part of a decoder for transmitting quantum information over the amplitude damping channel. These represent the first explicit capacity-achieving decoders for non-Pauli channels.

Plane representations of graphs and visibility between parallel segments

NASA Astrophysics Data System (ADS)

Tamassia, R.; Tollis, I. G.

1985-04-01

Several layout compaction strategies for VLSI are based on the concept of visibility between parallel segments, where we say that two parallel segments of a given set are visible if they can be joined by a segment orthogonal to them, which does not intersect any other segment. This paper studies visibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges to vertical segments drawn between visible vertex-segments. Clearly, every graph that admits such a representation must be a planar. The authors consider three types of visibility representations, and give complete characterizations of the classes of graphs that admit them. Furthermore, they present linear time algorithms for testing the existence of and constructing visibility representations of planar graphs.

Compact sub-kilohertz low-frequency quantum light source based on four-wave mixing in cesium vapor

NASA Astrophysics Data System (ADS)

Ma, Rong; Liu, Wei; Qin, Zhongzhong; Su, Xiaolong; Jia, Xiaojun; Zhang, Junxiang; Gao, Jiangrui

2018-03-01

Using a nondegenerate four-wave mixing (FWM) process based on a double-{\\Lambda} scheme in hot cesium vapor, we demonstrate a compact diode-laser-pumped quantum light source for the generation of quantum correlated twin beams with a maximum squeezing of 6.5 dB. The squeezing is observed at a Fourier frequency in the audio band down to 0.7 kHz which, to the best of our knowledge, is the first observation of sub-kilohertz intensity-difference squeezing in an atomic system so far. A phase-matching condition is also investigated in our system, which confirms the spatial-multi-mode characteristics of the FWM process. Our compact low-frequency squeezed light source may find applications in quantum imaging, quantum metrology, and the transfer of optical squeezing onto a matter wave.

Efficient path-based computations on pedigree graphs with compact encodings

PubMed Central

2012-01-01

A pedigree is a diagram of family relationships, and it is often used to determine the mode of inheritance (dominant, recessive, etc.) of genetic diseases. Along with rapidly growing knowledge of genetics and accumulation of genealogy information, pedigree data is becoming increasingly important. In large pedigree graphs, path-based methods for efficiently computing genealogical measurements, such as inbreeding and kinship coefficients of individuals, depend on efficient identification and processing of paths. In this paper, we propose a new compact path encoding scheme on large pedigrees, accompanied by an efficient algorithm for identifying paths. We demonstrate the utilization of our proposed method by applying it to the inbreeding coefficient computation. We present time and space complexity analysis, and also manifest the efficiency of our method for evaluating inbreeding coefficients as compared to previous methods by experimental results using pedigree graphs with real and synthetic data. Both theoretical and experimental results demonstrate that our method is more scalable and efficient than previous methods in terms of time and space requirements. PMID:22536898

Acausal measurement-based quantum computing

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki

2014-07-01

In measurement-based quantum computing, there is a natural "causal cone" among qubits of the resource state, since the measurement angle on a qubit has to depend on previous measurement results in order to correct the effect of by-product operators. If we respect the no-signaling principle, by-product operators cannot be avoided. Here we study the possibility of acausal measurement-based quantum computing by using the process matrix framework [Oreshkov, Costa, and Brukner, Nat. Commun. 3, 1092 (2012), 10.1038/ncomms2076]. We construct a resource process matrix for acausal measurement-based quantum computing restricting local operations to projective measurements. The resource process matrix is an analog of the resource state of the standard causal measurement-based quantum computing. We find that if we restrict local operations to projective measurements the resource process matrix is (up to a normalization factor and trivial ancilla qubits) equivalent to the decorated graph state created from the graph state of the corresponding causal measurement-based quantum computing. We also show that it is possible to consider a causal game whose causal inequality is violated by acausal measurement-based quantum computing.

A quantum physical design flow using ILP and graph drawing

NASA Astrophysics Data System (ADS)

Yazdani, Maryam; Saheb Zamani, Morteza; Sedighi, Mehdi

2013-10-01

Implementing large-scale quantum circuits is one of the challenges of quantum computing. One of the central challenges of accurately modeling the architecture of these circuits is to schedule a quantum application and generate the layout while taking into account the cost of communications and classical resources as well as the maximum exploitable parallelism. In this paper, we present and evaluate a design flow for arbitrary quantum circuits in ion trap technology. Our design flow consists of two parts. First, a scheduler takes a description of a circuit and finds the best order for the execution of its quantum gates using integer linear programming regarding the classical resources (qubits) and instruction dependencies. Then a layout generator receives the schedule produced by the scheduler and generates a layout for this circuit using a graph-drawing algorithm. Our experimental results show that the proposed flow decreases the average latency of quantum circuits by about 11 % for a set of attempted benchmarks and by about 9 % for another set of benchmarks compared with the best in literature.

Graph-theoretic quantum system modelling for neuronal microtubules as hierarchical clustered quantum Hopfield networks

NASA Astrophysics Data System (ADS)

Srivastava, D. P.; Sahni, V.; Satsangi, P. S.

2014-08-01

Graph-theoretic quantum system modelling (GTQSM) is facilitated by considering the fundamental unit of quantum computation and information, viz. a quantum bit or qubit as a basic building block. Unit directional vectors "ket 0" and "ket 1" constitute two distinct fundamental quantum across variable orthonormal basis vectors, for the Hilbert space, specifying the direction of propagation of information, or computation data, while complementary fundamental quantum through, or flow rate, variables specify probability parameters, or amplitudes, as surrogates for scalar quantum information measure (von Neumann entropy). This paper applies GTQSM in continuum of protein heterodimer tubulin molecules of self-assembling polymers, viz. microtubules in the brain as a holistic system of interacting components representing hierarchical clustered quantum Hopfield network, hQHN, of networks. The quantum input/output ports of the constituent elemental interaction components, or processes, of tunnelling interactions and Coulombic bidirectional interactions are in cascade and parallel interconnections with each other, while the classical output ports of all elemental components are interconnected in parallel to accumulate micro-energy functions generated in the system as Hamiltonian, or Lyapunov, energy function. The paper presents an insight, otherwise difficult to gain, for the complex system of systems represented by clustered quantum Hopfield network, hQHN, through the application of GTQSM construct.

More on quantum groups from the quantization point of view

NASA Astrophysics Data System (ADS)

Jurčo, Branislav

1994-12-01

Star products on the classical double group of a simple Lie group and on corresponding symplectic groupoids are given so that the quantum double and the “quantized tangent bundle” are obtained in the deformation description. “Complex” quantum groups and bicovariant quantum Lie algebras are discussed from this point of view. Further we discuss the quantization of the Poisson structure on the symmetric algebra S(g) leading to the quantized enveloping algebra U h (g) as an example of biquantization in the sense of Turaev. Description of U h (g) in terms of the generators of the bicovariant differential calculus on F(G q ) is very convenient for this purpose. Finaly we interpret in the deformation framework some well known properties of compact quantum groups as simple consequences of corresponding properties of classical compact Lie groups. An analogue of the classical Kirillov's universal character formula is given for the unitary irreducble representation in the compact case.

Gaps in the spectrum of a periodic quantum graph with periodically distributed \\delta ^{\\prime} -type interactions

NASA Astrophysics Data System (ADS)

Barseghyan, Diana; Khrabustovskyi, Andrii

2015-06-01

We consider a family of quantum graphs {{\\{(Γ ,{{A}\\varepsilon })\\}}\\varepsilon \\gt 0}, where Γ is a {{{Z}}n}-periodic metric graph and the periodic Hamiltonian {{A}\\varepsilon } is defined by the operation -{{\\varepsilon }-1}\\frac{{{d}2}}{d{{x}2}} on the edges of Γ and either δ \\prime -type conditions or the Kirchhoff conditions at its vertices. Here \\varepsilon \\gt 0 is a small parameter. We show that the spectrum of {{A}\\varepsilon } has at least m gaps as \\varepsilon \\to 0 (m\\in {N} is a predefined number), moreover the location of these gaps can be nicely controlled via a suitable choice of the geometry of Γ and of coupling constants involved in δ \\prime -type conditions.

Combination of short-length TiO2 nanorod arrays and compact PbS quantum-dot thin films for efficient solid-state quantum-dot-sensitized solar cells

NASA Astrophysics Data System (ADS)

Zhang, Zhengguo; Shi, Chengwu; Chen, Junjun; Xiao, Guannan; Li, Long

2017-07-01

Considering the balance of the hole diffusion length and the loading quantity of quantum-dots, the rutile TiO2 nanorod array with the length of 600 nm, the diameter of 20 nm, and the areal density of 500 μm-2 is successfully prepared by the hydrothermal method using the aqueous grown solution of 38 mM titanium isopropoxide and 6 M hydrochloric acid at 170 °C for 105 min. The compact PbS quantum-dot thin film on the TiO2 nanorod array is firstly obtained by the spin-coating-assisted successive ionic layer absorption and reaction with using 1,2-ethanedithiol (EDT). The result reveals that the strong interaction between lead and EDT is very important to control the crystallite size of PbS quantum-dots and obtain the compact PbS quantum-dot thin film on the TiO2 nanorod array. The all solid-state sensitized solar cell with the combination of the short-length, high-density TiO2 nanorod array and the compact PbS quantum-dot thin film achieves the photoelectric conversion efficiency of 4.10%, along with an open-circuit voltage of 0.52 V, a short-circuit photocurrent density of 13.56 mA cm-2 and a fill factor of 0.58.

Visibility of quantum graph spectrum from the vertices

NASA Astrophysics Data System (ADS)

Kühn, Christian; Rohleder, Jonathan

2018-03-01

We investigate the relation between the eigenvalues of the Laplacian with Kirchhoff vertex conditions on a finite metric graph and a corresponding Titchmarsh-Weyl function (a parameter-dependent Neumann-to-Dirichlet map). We give a complete description of all real resonances, including multiplicities, in terms of the edge lengths and the connectivity of the graph, and apply it to characterize all eigenvalues which are visible for the Titchmarsh-Weyl function.

Site- and bond-percolation thresholds in K_{n,n}-based lattices: Vulnerability of quantum annealers to random qubit and coupler failures on chimera topologies.

PubMed

Melchert, O; Katzgraber, Helmut G; Novotny, M A

2016-04-01

We estimate the critical thresholds of bond and site percolation on nonplanar, effectively two-dimensional graphs with chimeralike topology. The building blocks of these graphs are complete and symmetric bipartite subgraphs of size 2n, referred to as K_{n,n} graphs. For the numerical simulations we use an efficient union-find-based algorithm and employ a finite-size scaling analysis to obtain the critical properties for both bond and site percolation. We report the respective percolation thresholds for different sizes of the bipartite subgraph and verify that the associated universality class is that of standard two-dimensional percolation. For the canonical chimera graph used in the D-Wave Systems Inc. quantum annealer (n=4), we discuss device failure in terms of network vulnerability, i.e., we determine the critical fraction of qubits and couplers that can be absent due to random failures prior to losing large-scale connectivity throughout the device.

AND/OR graph representation of assembly plans

NASA Astrophysics Data System (ADS)

Homem de Mello, Luiz S.; Sanderson, Arthur C.

1990-04-01

A compact representation of all possible assembly plans of a product using AND/OR graphs is presented as a basis for efficient planning algorithms that allow an intelligent robot to pick a course of action according to instantaneous conditions. The AND/OR graph is equivalent to a state transition graph but requires fewer nodes and simplifies the search for feasible plans. Three applications are discussed: (1) the preselection of the best assembly plan, (2) the recovery from execution errors, and (3) the opportunistic scheduling of tasks. An example of an assembly with four parts illustrates the use of the AND/OR graph representation in assembly-plan preselection, based on the weighting of operations according to complexity of manipulation and stability of subassemblies. A hypothetical error situation is discussed to show how a bottom-up search of the AND/OR graph leads to an efficient recovery.

AND/OR graph representation of assembly plans

NASA Technical Reports Server (NTRS)

Homem De Mello, Luiz S.; Sanderson, Arthur C.

1990-01-01

A compact representation of all possible assembly plans of a product using AND/OR graphs is presented as a basis for efficient planning algorithms that allow an intelligent robot to pick a course of action according to instantaneous conditions. The AND/OR graph is equivalent to a state transition graph but requires fewer nodes and simplifies the search for feasible plans. Three applications are discussed: (1) the preselection of the best assembly plan, (2) the recovery from execution errors, and (3) the opportunistic scheduling of tasks. An example of an assembly with four parts illustrates the use of the AND/OR graph representation in assembly-plan preselection, based on the weighting of operations according to complexity of manipulation and stability of subassemblies. A hypothetical error situation is discussed to show how a bottom-up search of the AND/OR graph leads to an efficient recovery.

Software-defined Quantum Networking Ecosystem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humble, Travis S.; Sadlier, Ronald

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 withmore » 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.« less

Generation of multiphoton entangled quantum states by means of integrated frequency combs.

PubMed

Reimer, Christian; Kues, Michael; Roztocki, Piotr; Wetzel, Benjamin; Grazioso, Fabio; Little, Brent E; Chu, Sai T; Johnston, Tudor; Bromberg, Yaron; Caspani, Lucia; Moss, David J; Morandotti, Roberto

2016-03-11

Complex optical photon states with entanglement shared among several modes are critical to improving our fundamental understanding of quantum mechanics and have applications for quantum information processing, imaging, and microscopy. We demonstrate that optical integrated Kerr frequency combs can be used to generate several bi- and multiphoton entangled qubits, with direct applications for quantum communication and computation. Our method is compatible with contemporary fiber and quantum memory infrastructures and with chip-scale semiconductor technology, enabling compact, low-cost, and scalable implementations. The exploitation of integrated Kerr frequency combs, with their ability to generate multiple, customizable, and complex quantum states, can provide a scalable, practical, and compact platform for quantum technologies. Copyright © 2016, American Association for the Advancement of Science.

Dynamics for a 2-vertex quantum gravity model

NASA Astrophysics Data System (ADS)

Borja, Enrique F.; Díaz-Polo, Jacobo; Garay, Iñaki; Livine, Etera R.

2010-12-01

We use the recently introduced U(N) framework for loop quantum gravity to study the dynamics of spin network states on the simplest class of graphs: two vertices linked with an arbitrary number N of edges. Such graphs represent two regions, in and out, separated by a boundary surface. We study the algebraic structure of the Hilbert space of spin networks from the U(N) perspective. In particular, we describe the algebra of operators acting on that space and discuss their relation to the standard holonomy operator of loop quantum gravity. Furthermore, we show that it is possible to make the restriction to the isotropic/homogeneous sector of the model by imposing the invariance under a global U(N) symmetry. We then propose a U(N)-invariant Hamiltonian operator and study the induced dynamics. Finally, we explore the analogies between this model and loop quantum cosmology and sketch some possible generalizations of it.

Ensembles of physical states and random quantum circuits on graphs

NASA Astrophysics Data System (ADS)

Hamma, Alioscia; Santra, Siddhartha; Zanardi, Paolo

2012-11-01

In this paper we continue and extend the investigations of the ensembles of random physical states introduced in Hamma [Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.109.040502 109, 040502 (2012)]. These ensembles are constructed by finite-length random quantum circuits (RQC) acting on the (hyper)edges of an underlying (hyper)graph structure. The latter encodes for the locality structure associated with finite-time quantum evolutions generated by physical, i.e., local, Hamiltonians. Our goal is to analyze physical properties of typical states in these ensembles; in particular here we focus on proxies of quantum entanglement as purity and α-Renyi entropies. The problem is formulated in terms of matrix elements of superoperators which depend on the graph structure, choice of probability measure over the local unitaries, and circuit length. In the α=2 case these superoperators act on a restricted multiqubit space generated by permutation operators associated to the subsets of vertices of the graph. For permutationally invariant interactions the dynamics can be further restricted to an exponentially smaller subspace. We consider different families of RQCs and study their typical entanglement properties for finite time as well as their asymptotic behavior. We find that area law holds in average and that the volume law is a typical property (that is, it holds in average and the fluctuations around the average are vanishing for the large system) of physical states. The area law arises when the evolution time is O(1) with respect to the size L of the system, while the volume law arises as is typical when the evolution time scales like O(L).

Automated visualization of rule-based models

PubMed Central

Tapia, Jose-Juan; Faeder, James R.

2017-01-01

Frameworks such as BioNetGen, Kappa and Simmune use “reaction rules” to specify biochemical interactions compactly, where each rule specifies a mechanism such as binding or phosphorylation and its structural requirements. Current rule-based models of signaling pathways have tens to hundreds of rules, and these numbers are expected to increase as more molecule types and pathways are added. Visual representations are critical for conveying rule-based models, but current approaches to show rules and interactions between rules scale poorly with model size. Also, inferring design motifs that emerge from biochemical interactions is an open problem, so current approaches to visualize model architecture rely on manual interpretation of the model. Here, we present three new visualization tools that constitute an automated visualization framework for rule-based models: (i) a compact rule visualization that efficiently displays each rule, (ii) the atom-rule graph that conveys regulatory interactions in the model as a bipartite network, and (iii) a tunable compression pipeline that incorporates expert knowledge and produces compact diagrams of model architecture when applied to the atom-rule graph. The compressed graphs convey network motifs and architectural features useful for understanding both small and large rule-based models, as we show by application to specific examples. Our tools also produce more readable diagrams than current approaches, as we show by comparing visualizations of 27 published models using standard graph metrics. We provide an implementation in the open source and freely available BioNetGen framework, but the underlying methods are general and can be applied to rule-based models from the Kappa and Simmune frameworks also. We expect that these tools will promote communication and analysis of rule-based models and their eventual integration into comprehensive whole-cell models. PMID:29131816

Renormalization in Quantum Field Theory and the Riemann-Hilbert Problem I: The Hopf Algebra Structure of Graphs and the Main Theorem

NASA Astrophysics Data System (ADS)

Connes, Alain; Kreimer, Dirk

This paper gives a complete selfcontained proof of our result announced in [6] showing that renormalization in quantum field theory is a special instance of a general mathematical procedure of extraction of finite values based on the Riemann-Hilbert problem. We shall first show that for any quantum field theory, the combinatorics of Feynman graphs gives rise to a Hopf algebra which is commutative as an algebra. It is the dual Hopf algebra of the enveloping algebra of a Lie algebra whose basis is labelled by the one particle irreducible Feynman graphs. The Lie bracket of two such graphs is computed from insertions of one graph in the other and vice versa. The corresponding Lie group G is the group of characters of . We shall then show that, using dimensional regularization, the bare (unrenormalized) theory gives rise to a loop where C is a small circle of complex dimensions around the integer dimension D of space-time. Our main result is that the renormalized theory is just the evaluation at z=D of the holomorphic part γ+ of the Birkhoff decomposition of γ. We begin to analyse the group G and show that it is a semi-direct product of an easily understood abelian group by a highly non-trivial group closely tied up with groups of diffeomorphisms. The analysis of this latter group as well as the interpretation of the renormalization group and of anomalous dimensions are the content of our second paper with the same overall title.

New graph polynomials in parametric QED Feynman integrals

NASA Astrophysics Data System (ADS)

Golz, Marcel

2017-10-01

In recent years enormous progress has been made in perturbative quantum field theory by applying methods of algebraic geometry to parametric Feynman integrals for scalar theories. The transition to gauge theories is complicated not only by the fact that their parametric integrand is much larger and more involved. It is, moreover, only implicitly given as the result of certain differential operators applied to the scalar integrand exp(-ΦΓ /ΨΓ) , where ΨΓ and ΦΓ are the Kirchhoff and Symanzik polynomials of the Feynman graph Γ. In the case of quantum electrodynamics we find that the full parametric integrand inherits a rich combinatorial structure from ΨΓ and ΦΓ. In the end, it can be expressed explicitly as a sum over products of new types of graph polynomials which have a combinatoric interpretation via simple cycle subgraphs of Γ.

Graph determined symbolic dynamics and hybrid systems

NASA Astrophysics Data System (ADS)

Ayers, Kimberly Danielle

In this paper we explore the concept of symbolic dynamical systems whose structure is determined by a directed graph, and then discrete-continuous hybrid systems that arise from such dynamical systems. Typically, symbolic dynamics involve the study of a left shift of a bi-infinite sequence. We examine the case when the bi-infinite system is dictated by a graph; that is, the sequence is a bi-infinite path of a directed graph. We then use the concept to study a system of dynamical systems all on the same compact space M, where "switching" between the systems occurs as given by the bi-infinite sequence in question. The concepts of limit sets, chain recurrent sets, chaos, and Morse sets for these systems are explored.

A linearization of quantum channels

NASA Astrophysics Data System (ADS)

Crowder, Tanner

2015-06-01

Because the quantum channels form a compact, convex set, we can express any quantum channel as a convex combination of extremal channels. We give a Euclidean representation for the channels whose inverses are also valid channels; these are a subset of the extreme points. They form a compact, connected Lie group, and we calculate its Lie algebra. Lastly, we calculate a maximal torus for the group and provide a constructive approach to decomposing any invertible channel into a product of elementary channels.

On quantum symmetries of compact metric spaces

NASA Astrophysics Data System (ADS)

Chirvasitu, Alexandru

2015-08-01

An action of a compact quantum group on a compact metric space (X , d) is (D)-isometric if the distance function is preserved by a diagonal action on X × X. In this study, we show that an isometric action in this sense has the following additional property: the corresponding action on the algebra of continuous functions on X by the convolution semigroup of probability measures on the quantum group contracts Lipschitz constants. In other words, it is isometric in another sense due to Li, Quaegebeur, and Sabbe, which partially answers a question posed by Goswami. We also introduce other possible notions of isometric quantum actions in terms of the Wasserstein p-distances between probability measures on X for p ≥ 1, which are used extensively in optimal transportation. Indeed, all of these definitions of quantum isometry belong to a hierarchy of implications, where the two described above lie at the extreme ends of the hierarchy. We conjecture that they are all equivalent.

Quantum computing with incoherent resources and quantum jumps.

PubMed

Santos, M F; Cunha, M Terra; Chaves, R; Carvalho, A R R

2012-04-27

Spontaneous emission and the inelastic scattering of photons are two natural processes usually associated with decoherence and the reduction in the capacity to process quantum information. Here we show that, when suitably detected, these photons are sufficient to build all the fundamental blocks needed to perform quantum computation in the emitting qubits while protecting them from deleterious dissipative effects. We exemplify this by showing how to efficiently prepare graph states for the implementation of measurement-based quantum computation.

Which causal structures might support a quantum-classical gap?

NASA Astrophysics Data System (ADS)

Pienaar, Jacques

2017-04-01

A causal scenario is a graph that describes the cause and effect relationships between all relevant variables in an experiment. A scenario is deemed ‘not interesting’ if there is no device-independent way to distinguish the predictions of classical physics from any generalised probabilistic theory (including quantum mechanics). Conversely, an interesting scenario is one in which there exists a gap between the predictions of different operational probabilistic theories, as occurs for example in Bell-type experiments. Henson, Lal and Pusey (HLP) recently proposed a sufficient condition for a causal scenario to not be interesting. In this paper we supplement their analysis with some new techniques and results. We first show that existing graphical techniques due to Evans can be used to confirm by inspection that many graphs are interesting without having to explicitly search for inequality violations. For three exceptional cases—the graphs numbered \\#15,16,20 in HLP—we show that there exist non-Shannon type entropic inequalities that imply these graphs are interesting. In doing so, we find that existing methods of entropic inequalities can be greatly enhanced by conditioning on the specific values of certain variables.

Quantum cellular automata and free quantum field theory

NASA Astrophysics Data System (ADS)

D'Ariano, Giacomo Mauro; Perinotti, Paolo

2017-02-01

In a series of recent papers [1-4] it has been shown how free quantum field theory can be derived without using mechanical primitives (including space-time, special relativity, quantization rules, etc.), but only considering the easiest quantum algorithm encompassing a countable set of quantum systems whose network of interactions satisfies the simple principles of unitarity, homogeneity, locality, and isotropy. This has opened the route to extending the axiomatic information-theoretic derivation of the quantum theory of abstract systems [5, 6] to include quantum field theory. The inherent discrete nature of the informational axiomatization leads to an extension of quantum field theory to a quantum cellular automata theory, where the usual field theory is recovered in a regime where the discrete structure of the automata cannot be probed. A simple heuristic argument sets the scale of discreteness to the Planck scale, and the customary physical regime where discreteness is not visible is the relativistic one of small wavevectors. In this paper we provide a thorough derivation from principles that in the most general case the graph of the quantum cellular automaton is the Cayley graph of a finitely presented group, and showing how for the case corresponding to Euclidean emergent space (where the group resorts to an Abelian one) the automata leads to Weyl, Dirac and Maxwell field dynamics in the relativistic limit. We conclude with some perspectives towards the more general scenario of non-linear automata for interacting quantum field theory.

Free Quantum Field Theory from Quantum Cellular Automata

NASA Astrophysics Data System (ADS)

Bisio, Alessandro; D'Ariano, Giacomo Mauro; Perinotti, Paolo; Tosini, Alessandro

2015-10-01

After leading to a new axiomatic derivation of quantum theory (see D'Ariano et al. in Found Phys, 2015), the new informational paradigm is entering the domain of quantum field theory, suggesting a quantum automata framework that can be regarded as an extension of quantum field theory to including an hypothetical Planck scale, and with the usual quantum field theory recovered in the relativistic limit of small wave-vectors. Being derived from simple principles (linearity, unitarity, locality, homogeneity, isotropy, and minimality of dimension), the automata theory is quantum ab-initio, and does not assume Lorentz covariance and mechanical notions. Being discrete it can describe localized states and measurements (unmanageable by quantum field theory), solving all the issues plaguing field theory originated from the continuum. These features make the theory an ideal framework for quantum gravity, with relativistic covariance and space-time emergent solely from the interactions, and not assumed a priori. The paper presents a synthetic derivation of the automata theory, showing how the principles lead to a description in terms of a quantum automaton over a Cayley graph of a group. Restricting to Abelian groups we show how the automata recover the Weyl, Dirac and Maxwell dynamics in the relativistic limit. We conclude with some new routes about the more general scenario of non-Abelian Cayley graphs. The phenomenology arising from the automata theory in the ultra-relativistic domain and the analysis of corresponding distorted Lorentz covariance is reviewed in Bisio et al. (Found Phys 2015, in this same issue).

Quantum walks of two interacting particles on percolation graphs

NASA Astrophysics Data System (ADS)

Siloi, Ilaria; Benedetti, Claudia; Piccinini, Enrico; Paris, Matteo G. A.; Bordone, Paolo

2017-10-01

We address the dynamics of two indistinguishable interacting particles moving on a dynamical percolation graph, i.e., a graph where the edges are independent random telegraph processes whose values jump between 0 and 1, thus mimicking percolation. The interplay between the particle interaction strength, initial state and the percolation rate determine different dynamical regimes for the walkers. We show that, whenever the walkers are initially localised within the interaction range, fast noise enhances the particle spread compared to the noiseless case.

Exponential energy growth due to slow parameter oscillations in quantum mechanical systems.

PubMed

Turaev, Dmitry

2016-05-01

It is shown that a periodic emergence and destruction of an additional quantum number leads to an exponential growth of energy of a quantum mechanical system subjected to a slow periodic variation of parameters. The main example is given by systems (e.g., quantum billiards and quantum graphs) with periodically divided configuration space. In special cases, the process can also lead to a long period of cooling that precedes the acceleration, and to the desertion of the states with a particular value of the quantum number.

Quantum anonymous voting with unweighted continuous-variable graph states

NASA Astrophysics Data System (ADS)

Guo, Ying; Feng, Yanyan; Zeng, Guihua

2016-08-01

Motivated by the revealing topological structures of continuous-variable graph state (CVGS), we investigate the design of quantum voting scheme, which has serious advantages over the conventional ones in terms of efficiency and graphicness. Three phases are included, i.e., the preparing phase, the voting phase and the counting phase, together with three parties, i.e., the voters, the tallyman and the ballot agency. Two major voting operations are performed on the yielded CVGS in the voting process, namely the local rotation transformation and the displacement operation. The voting information is carried by the CVGS established before hand, whose persistent entanglement is deployed to keep the privacy of votes and the anonymity of legal voters. For practical applications, two CVGS-based quantum ballots, i.e., comparative ballot and anonymous survey, are specially designed, followed by the extended ballot schemes for the binary-valued and multi-valued ballots under some constraints for the voting design. Security is ensured by entanglement of the CVGS, the voting operations and the laws of quantum mechanics. The proposed schemes can be implemented using the standard off-the-shelf components when compared to discrete-variable quantum voting schemes attributing to the characteristics of the CV-based quantum cryptography.

Bound Electron States in Skew-symmetric Quantum Wire Intersections

DTIC Science & Technology

2014-01-01

18 1.2.3 Kirchhoffs Rule for Quantum Wires . . . . . . . . . . . 19 1.3 Novel numerical methods development . . . . . . . . . . . . . 19 2...regions, though this is not as obvious as it is for bulges. CHAPTER 1. LITERATURE REVIEW 19 1.2.3 Kirchhoffs Rule for Quantum Wires One particle quantum...scattering theory on an arbitrary finite graph with n open ends and where we define the Hamiltonian to be (minus) the Laplace operator with general

Group field theories for all loop quantum gravity

NASA Astrophysics Data System (ADS)

Oriti, Daniele; Ryan, James P.; Thürigen, Johannes

2015-02-01

Group field theories represent a second quantized reformulation of the loop quantum gravity state space and a completion of the spin foam formalism. States of the canonical theory, in the traditional continuum setting, have support on graphs of arbitrary valence. On the other hand, group field theories have usually been defined in a simplicial context, thus dealing with a restricted set of graphs. In this paper, we generalize the combinatorics of group field theories to cover all the loop quantum gravity state space. As an explicit example, we describe the group field theory formulation of the KKL spin foam model, as well as a particular modified version. We show that the use of tensor model tools allows for the most effective construction. In order to clarify the mathematical basis of our construction and of the formalisms with which we deal, we also give an exhaustive description of the combinatorial structures entering spin foam models and group field theories, both at the level of the boundary states and of the quantum amplitudes.

A graph with fractional revival

NASA Astrophysics Data System (ADS)

Bernard, Pierre-Antoine; Chan, Ada; Loranger, Érika; Tamon, Christino; Vinet, Luc

2018-02-01

An example of a graph that admits balanced fractional revival between antipodes is presented. It is obtained by establishing the correspondence between the quantum walk on a hypercube where the opposite vertices across the diagonals of each face are connected and, the coherent transport of single excitations in the extension of the Krawtchouk spin chain with next-to-nearest neighbour interactions.

The Effect of Quantum Fluctuations in Compact Star Observables

NASA Astrophysics Data System (ADS)

Pósfay, P.; Barnaföldi, G. G.; Jakovác, A.

2018-05-01

Astrophysical measurements regarding compact stars are just ahead of a big evolution jump, since the NICER experiment deployed on ISS on 2017 June 14. This will provide soon data that would enable the determination of compact star radius with less than 10% error. This can be further constrained by the new observation of gravitational waves originated from merging neutron stars, GW170817. This poses new challenges to nuclear models aiming to explain the structure of super dense nuclear matter found in neutron stars. Detailed studies of the QCD phase diagram show the importance of bosonic quantum fluctuations in the cold dense matter equation of state. Here we used a demonstrative model with one bosonic and one fermionic degree of freedom coupled by Yukawa coupling, we show the effect of bosonic quantum fluctuations on compact star observables such as mass, radius, and compactness. We have also calculated the difference in the value of compressibility which is caused by quantum fluctuations. The above-mentioned quantities are calculated in the mean field, one-loop, and in high order many loop approximation. The results show that the magnitude of these effects is in the range of 4-5%, which place it into the region where modern measurements may detect it. This forms a base for further investigations that how these results carry over to more complicated models.

Hybrid quantum gates between flying photon and diamond nitrogen-vacancy centers assisted by optical microcavities

PubMed Central

Wei, Hai-Rui; Lu Long, Gui

2015-01-01

Hybrid quantum gates hold great promise for quantum information processing since they preserve the advantages of different quantum systems. Here we present compact quantum circuits to deterministically implement controlled-NOT, Toffoli, and Fredkin gates between a flying photon qubit and diamond nitrogen-vacancy (NV) centers assisted by microcavities. The target qubits of these universal quantum gates are encoded on the spins of the electrons associated with the diamond NV centers and they have long coherence time for storing information, and the control qubit is encoded on the polarizations of the flying photon and can be easily manipulated. Our quantum circuits are compact, economic, and simple. Moreover, they do not require additional qubits. The complexity of our schemes for universal three-qubit gates is much reduced, compared to the synthesis with two-qubit entangling gates. These schemes have high fidelities and efficiencies, and they are feasible in experiment. PMID:26271899

A synchronous game for binary constraint systems

NASA Astrophysics Data System (ADS)

Kim, Se-Jin; Paulsen, Vern; Schafhauser, Christopher

2018-03-01

Recently, Slofstra proved that the set of quantum correlations is not closed. We prove that the set of synchronous quantum correlations is not closed, which implies his result, by giving an example of a synchronous game that has a perfect quantum approximate strategy but no perfect quantum strategy. We also exhibit a graph for which the quantum independence number and the quantum approximate independence number are different. We prove new characterisations of synchronous quantum approximate correlations and synchronous quantum spatial correlations. We solve the synchronous approximation problem of Dykema and the second author, which yields a new equivalence of Connes' embedding problem in terms of synchronous correlations.

Convergence of spectra of graph-like thin manifolds

NASA Astrophysics Data System (ADS)

Exner, Pavel; Post, Olaf

2005-05-01

We consider a family of compact manifolds which shrinks with respect to an appropriate parameter to a graph. The main result is that the spectrum of the Laplace-Beltrami operator converges to the spectrum of the (differential) Laplacian on the graph with Kirchhoff boundary conditions at the vertices. On the other hand, if the shrinking at the vertex parts of the manifold is sufficiently slower comparing to that of the edge parts, the limiting spectrum corresponds to decoupled edges with Dirichlet boundary conditions at the endpoints. At the borderline between the two regimes we have a third possibility when the limiting spectrum can be described by a nontrivial coupling at the vertices.

Volume simplicity constraint in the Engle-Livine-Pereira-Rovelli spin foam model

NASA Astrophysics Data System (ADS)

Bahr, Benjamin; Belov, Vadim

2018-04-01

We propose a quantum version of the quadratic volume simplicity constraint for the Engle-Livine-Pereira-Rovelli spin foam model. It relies on a formula for the volume of 4-dimensional polyhedra, depending on its bivectors and the knotting class of its boundary graph. While this leads to no further condition for the 4-simplex, the constraint becomes nontrivial for more complicated boundary graphs. We show that, in the semiclassical limit of the hypercuboidal graph, the constraint turns into the geometricity condition observed recently by several authors.

The excitonic qubit coupled with a phonon bath on a star graph: anomalous decoherence and coherence revivals

NASA Astrophysics Data System (ADS)

Yalouz, S.; Falvo, C.; Pouthier, V.

2017-06-01

Based on the operatorial formulation of perturbation theory, the dynamical properties of a Frenkel exciton coupled with a thermal phonon bath on a star graph are studied. Within this method, the dynamics is governed by an effective Hamiltonian which accounts for exciton-phonon entanglement. The exciton is dressed by a virtual phonon cloud, whereas the phonons are dressed by virtual excitonic transitions. Special attention is paid to the description of the coherence of a qubit state initially located on the central node of the graph. Within the nonadiabatic weak coupling limit, it is shown that several timescales govern the coherence dynamics. In the short time limit, the coherence behaves as if the exciton was insensitive to the phonon bath. Then, quantum decoherence takes place, this decoherence being enhanced by the size of the graph and by temperature. However, the coherence does not vanish in the long time limit. Instead, it exhibits incomplete revivals that occur periodically at specific revival times and it shows almost exact recurrences that take place at particular super-revival times, a singular behavior that has been corroborated by performing exact quantum calculations.

Intensity noise properties of a compact laser device based on a miniaturized MOPA system for spectroscopic applications

NASA Astrophysics Data System (ADS)

Baumgärtner, S.; Juhl, S.; Opalevs, D.; Sahm, A.; Hofmann, J.; Leisching, P.; Paschke, K.

2018-02-01

We present a novel compact laser device based on a semiconductor master-oscillator power-amplifier (MOPA) emitting at 772 nm, suitable for quantum optic and spectroscopy. The optical performance of the laser device is characterized. For miniaturized lasers the thermal management is challenging, we therefore perform thermal simulations and measurements. The first demonstrator is emitting more than 3 W optical power with a linewidth below 2lMHz. Using this MOPA design also compact devices for quantum optics (e.g. rubidium atomic clock) and seed lasers for frequency conversion can be realized [1].

A Comparison of Approaches for Solving Hard Graph-Theoretic Problems

DTIC Science & Technology

2015-05-01

collaborative effort “ Adiabatic Quantum Computing Applications Research” (14-RI-CRADA-02) between the Information Directorate and Lock- 3 Algorithm 3...using Matlab, a quantum annealing approach using the D-Wave computer , and lastly using satisfiability modulo theory (SMT) and corresponding SMT...methods are explored and consist of a parallel computing approach using Matlab, a quantum annealing approach using the D-Wave computer , and lastly using

Homology groups for particles on one-connected graphs

NASA Astrophysics Data System (ADS)

MaciÄ Żek, Tomasz; Sawicki, Adam

2017-06-01

We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our approach is based on some fundamental combinatorial properties of the configuration spaces, Mayer-Vietoris sequences for different parts of configuration spaces, and some limited use of discrete Morse theory. As one of the results, we derive the closed-form formulae for ranks of the homology groups for indistinguishable particles on tree graphs. We also give a detailed discussion of the second homology group of the configuration space of both distinguishable and indistinguishable particles. Our motivation is the search for new kinds of quantum statistics.

Sampling ARG of multiple populations under complex configurations of subdivision and admixture.

PubMed

Carrieri, Anna Paola; Utro, Filippo; Parida, Laxmi

2016-04-01

Simulating complex evolution scenarios of multiple populations is an important task for answering many basic questions relating to population genomics. Apart from the population samples, the underlying Ancestral Recombinations Graph (ARG) is an additional important means in hypothesis checking and reconstruction studies. Furthermore, complex simulations require a plethora of interdependent parameters making even the scenario-specification highly non-trivial. We present an algorithm SimRA that simulates generic multiple population evolution model with admixture. It is based on random graphs that improve dramatically in time and space requirements of the classical algorithm of single populations.Using the underlying random graphs model, we also derive closed forms of expected values of the ARG characteristics i.e., height of the graph, number of recombinations, number of mutations and population diversity in terms of its defining parameters. This is crucial in aiding the user to specify meaningful parameters for the complex scenario simulations, not through trial-and-error based on raw compute power but intelligent parameter estimation. To the best of our knowledge this is the first time closed form expressions have been computed for the ARG properties. We show that the expected values closely match the empirical values through simulations.Finally, we demonstrate that SimRA produces the ARG in compact forms without compromising any accuracy. We demonstrate the compactness and accuracy through extensive experiments. SimRA (Simulation based on Random graph Algorithms) source, executable, user manual and sample input-output sets are available for downloading at: https://github.com/ComputationalGenomics/SimRA CONTACT: : parida@us.ibm.com Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Water-level altitudes 2009 and water-level changes in the Chicot, Evangeline, and Jasper Aquifers and compaction 1973-2008 in the Chicot and Evangeline Aquifers, Houston-Galveston Region, Texas

USGS Publications Warehouse

Kasmarek, Mark C.; Houston, Natalie A.; Ramage, Jason K.

2009-01-01

This report, done in cooperation with the Harris-Galveston Subsidence District, the City of Houston, the Fort Bend Subsidence District, and the Lone Star Groundwater Conservation District, is one in an annual series of reports that depicts water-level altitudes and water-level changes in the Chicot, Evangeline, and Jasper aquifers, and compaction in the Chicot and Evangeline aquifers in the Houston-Galveston region, Texas. The report (excluding appendixes) contains 16 sheets and 15 tables: 3 sheets are maps showing current-year (2009) water-level altitudes for each aquifer, respectively; 3 sheets are maps showing 1-year (2008-09) water-level changes for each aquifer, respectively; 3 sheets are maps showing 5-year (2004-09) water-level changes for each aquifer, respectively; 4 sheets are maps showing long-term (1990-2009 and 1977-2009) water-level changes for the Chicot and Evangeline aquifers, respectively; 1 sheet is a map showing long-term (2000-2009) water-level change for the Jasper aquifer; 1 sheet is a map showing site locations of borehole extensometers; and 1 sheet comprises graphs showing measured compaction of subsurface material at the sites from 1973 or later through 2008, respectively. Tables listing the data used to construct the aquifer-data maps and the compaction graphs are included.

Natural three-qubit interactions in one-way quantum computing

NASA Astrophysics Data System (ADS)

Tame, M. S.; Paternostro, M.; Kim, M. S.; Vedral, V.

2006-02-01

We address the effects of natural three-qubit interactions on the computational power of one-way quantum computation. A benefit of using more sophisticated entanglement structures is the ability to construct compact and economic simulations of quantum algorithms with limited resources. We show that the features of our study are embodied by suitably prepared optical lattices, where effective three-spin interactions have been theoretically demonstrated. We use this to provide a compact construction for the Toffoli gate. Information flow and two-qubit interactions are also outlined, together with a brief analysis of relevant sources of imperfection.

Graph embedding and extensions: a general framework for dimensionality reduction.

PubMed

Yan, Shuicheng; Xu, Dong; Zhang, Benyu; Zhang, Hong-Jiang; Yang, Qiang; Lin, Stephen

2007-01-01

Over the past few decades, a large family of algorithms - supervised or unsupervised; stemming from statistics or geometry theory - has been designed to provide different solutions to the problem of dimensionality reduction. Despite the different motivations of these algorithms, we present in this paper a general formulation known as graph embedding to unify them within a common framework. In graph embedding, each algorithm can be considered as the direct graph embedding or its linear/kernel/tensor extension of a specific intrinsic graph that describes certain desired statistical or geometric properties of a data set, with constraints from scale normalization or a penalty graph that characterizes a statistical or geometric property that should be avoided. Furthermore, the graph embedding framework can be used as a general platform for developing new dimensionality reduction algorithms. By utilizing this framework as a tool, we propose a new supervised dimensionality reduction algorithm called Marginal Fisher Analysis in which the intrinsic graph characterizes the intraclass compactness and connects each data point with its neighboring points of the same class, while the penalty graph connects the marginal points and characterizes the interclass separability. We show that MFA effectively overcomes the limitations of the traditional Linear Discriminant Analysis algorithm due to data distribution assumptions and available projection directions. Real face recognition experiments show the superiority of our proposed MFA in comparison to LDA, also for corresponding kernel and tensor extensions.

Time series analysis of the developed financial markets' integration using visibility graphs

NASA Astrophysics Data System (ADS)

Zhuang, Enyu; Small, Michael; Feng, Gang

2014-09-01

A time series representing the developed financial markets' segmentation from 1973 to 2012 is studied. The time series reveals an obvious market integration trend. To further uncover the features of this time series, we divide it into seven windows and generate seven visibility graphs. The measuring capabilities of the visibility graphs provide means to quantitatively analyze the original time series. It is found that the important historical incidents that influenced market integration coincide with variations in the measured graphical node degree. Through the measure of neighborhood span, the frequencies of the historical incidents are disclosed. Moreover, it is also found that large "cycles" and significant noise in the time series are linked to large and small communities in the generated visibility graphs. For large cycles, how historical incidents significantly affected market integration is distinguished by density and compactness of the corresponding communities.

Switching effect of the side chain on quantum walks on triple graphs

NASA Astrophysics Data System (ADS)

Du, Yi-Mu; Lu, Li-Hua; Li, You-Quan

2015-07-01

We consider a continuous-time quantum walk on a triple graph and investigate the influence of the side chain on propagation in the main chain. Calculating the interchange of the probabilities between the two parts of the main chain, we find that a switching effect appears if there is an odd number of points in the side chain when concrete conditions between the length of the main chain and the position of the side chain are satisfied. However, such an effect does not occur if there is an even number of points in the side chain. We also suggest two proposals for experiments to demonstrate this effect, which may be employed to design a new type of switching device.

Vertices cannot be hidden from quantum spatial search for almost all random graphs

NASA Astrophysics Data System (ADS)

Glos, Adam; Krawiec, Aleksandra; Kukulski, Ryszard; Puchała, Zbigniew

2018-04-01

In this paper, we show that all nodes can be found optimally for almost all random Erdős-Rényi G(n,p) graphs using continuous-time quantum spatial search procedure. This works for both adjacency and Laplacian matrices, though under different conditions. The first one requires p=ω (log ^8(n)/n), while the second requires p≥ (1+ɛ )log (n)/n, where ɛ >0. The proof was made by analyzing the convergence of eigenvectors corresponding to outlying eigenvalues in the \\Vert \\cdot \\Vert _∞ norm. At the same time for p<(1-ɛ )log (n)/n, the property does not hold for any matrix, due to the connectivity issues. Hence, our derivation concerning Laplacian matrix is tight.

An alpha particle model for Carbon-12

NASA Astrophysics Data System (ADS)

Rawlinson, J. I.

2018-07-01

We introduce a new model for the Carbon-12 nucleus and compute its lowest energy levels. Our model is inspired by previous work on the rigid body approximation in the B = 12 sector of the Skyrme model. We go beyond this approximation and treat the nucleus as a deformable body, finding several new states. A restricted set of deformations is considered, leading to a configuration space C which has a graph-like structure. We use ideas from quantum graph theory in order to make sense of quantum mechanics on C even though it is not a manifold. This is a new approach to Skyrmion quantisation and the method presented in this paper could be applied to a variety of other problems.

Quantum Teamwork for Unconditional Multiparty Communication with Gaussian States

NASA Astrophysics Data System (ADS)

Zhang, Jing; Adesso, Gerardo; Xie, Changde; Peng, Kunchi

2009-08-01

We demonstrate the capability of continuous variable Gaussian states to communicate multipartite quantum information. A quantum teamwork protocol is presented according to which an arbitrary possibly entangled multimode state can be faithfully teleported between two teams each comprising many cooperative users. We prove that N-mode Gaussian weighted graph states exist for arbitrary N that enable unconditional quantum teamwork implementations for any arrangement of the teams. These perfect continuous variable maximally multipartite entangled resources are typical among pure Gaussian states and are unaffected by the entanglement frustration occurring in multiqubit states.

The properties of Q-deformed hyperbolic and trigonometric functions in quantum deformation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Deta, U. A., E-mail: utamaalan@yahoo.co.id, E-mail: utamadeta@unesa.ac.id; Suparmi

2015-09-30

Quantum deformation has been studied due to its relation with applications in nuclear physics, conformal field theory, and statistical-quantum theory. The q-deformation of hyperbolic function was introduced by Arai. The application of q-deformed functions has been widely used in quantum mechanics. The properties of this two kinds of system explained in this paper including their derivative. The graph of q-deformed functions presented using Matlab. The special case is given for modified Poschl-Teller plus q-deformed Scarf II trigonometry potentials.

A simple proof of orientability in colored group field theory.

PubMed

Caravelli, Francesco

2012-01-01

Group field theory is an emerging field at the boundary between Quantum Gravity, Statistical Mechanics and Quantum Field Theory and provides a path integral for the gluing of n-simplices. Colored group field theory has been introduced in order to improve the renormalizability of the theory and associates colors to the faces of the simplices. The theory of crystallizations is instead a field at the boundary between graph theory and combinatorial topology and deals with n-simplices as colored graphs. Several techniques have been introduced in order to study the topology of the pseudo-manifold associated to the colored graph. Although of the similarity between colored group field theory and the theory of crystallizations, the connection between the two fields has never been made explicit. In this short note we use results from the theory of crystallizations to prove that color in group field theories guarantees orientability of the piecewise linear pseudo-manifolds associated to each graph generated perturbatively. Colored group field theories generate orientable pseudo-manifolds. The origin of orientability is the presence of two interaction vertices in the action of colored group field theories. In order to obtain the result, we made the connection between the theory of crystallizations and colored group field theory.

Tightness of correlation inequalities with no quantum violation

NASA Astrophysics Data System (ADS)

Ramanathan, Ravishankar; Quintino, Marco Túlio; Sainz, Ana Belén; Murta, Gláucia; Augusiak, Remigiusz

2017-01-01

We study the faces of the set of quantum correlations, i.e., the Bell and noncontextuality inequalities without any quantum violation. First, we investigate the question of whether every proper (facet-defining) Bell inequality for two parties, other than the trivial ones from positivity, normalization, and no-signaling, can be violated by quantum correlations, i.e., whether the classical Bell polytope or the smaller correlation polytope share any facets with their respective quantum sets. To do this, we develop a recently derived bound on the quantum value of linear games based on the norms of game matrices to give a simple sufficient condition to identify linear games with no quantum advantage. Additionally we show how this bound can be extended to the general class of unique games. We then show that the paradigmatic examples of correlation Bell inequalities with no quantum violation, namely the nonlocal computation games, do not constitute facet-defining Bell inequalities, not even for the correlation polytope. We also extend this to an arbitrary prime number of outcomes for a specific class of these games. We then study the faces in the simplest Clauser-Horne-Shimony-Holt Bell scenario of binary dichotomic measurements, and identify edges in the set of quantum correlations in this scenario. Finally, we relate the noncontextual polytope of single-party correlation inequalities with the cut polytope CUT(∇ G ) , where G denotes the compatibility graph of observables in the contextuality scenario and ∇ G denotes the suspension graph of G . We observe that there exist facet-defining noncontextuality inequalities with no quantum violation, and furthermore that this set of inequalities is beyond those implied by the consistent exclusivity principle.

Quantum privacy and Schur product channels

NASA Astrophysics Data System (ADS)

Levick, Jeremy; Kribs, David W.; Pereira, Rajesh

2017-12-01

We investigate the quantum privacy properties of an important class of quantum channels, by making use of a connection with Schur product matrix operations and associated correlation matrix structures. For channels implemented by mutually commuting unitaries, which cannot privatise qubits encoded directly into subspaces, we nevertheless identify private algebras and subsystems that can be privatised by the channels. We also obtain further results by combining our analysis with tools from the theory of quasi-orthogonal operator algebras and graph theory.

Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Houshmand, Monireh; Hosseini-Khayat, Saied

2011-02-15

Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a ''pearl-necklace'' encoder. Despite their algorithm's theoretical significance as a neat way of representing quantum convolutional codes, it is not well suited to practical realization. In fact, there is no straightforward way to implement any given pearl-necklace structure. This paper closes the gap between theoretical representation andmore » practical implementation. In our previous work, we presented an efficient algorithm to find a minimal-memory realization of a pearl-necklace encoder for Calderbank-Shor-Steane (CSS) convolutional codes. This work is an extension of our previous work and presents an algorithm for turning a pearl-necklace encoder for a general (non-CSS) quantum convolutional code into a realizable quantum convolutional encoder. We show that a minimal-memory realization depends on the commutativity relations between the gate strings in the pearl-necklace encoder. We find a realization by means of a weighted graph which details the noncommutative paths through the pearl necklace. The weight of the longest path in this graph is equal to the minimal amount of memory needed to implement the encoder. The algorithm has a polynomial-time complexity in the number of gate strings in the pearl-necklace encoder.« less

A quantum wave based compact modeling approach for the current in ultra-short DG MOSFETs suitable for rapid multi-scale simulations

NASA Astrophysics Data System (ADS)

Hosenfeld, Fabian; Horst, Fabian; Iñíguez, Benjamín; Lime, François; Kloes, Alexander

2017-11-01

Source-to-drain (SD) tunneling decreases the device performance in MOSFETs falling below the 10 nm channel length. Modeling quantum mechanical effects including SD tunneling has gained more importance specially for compact model developers. The non-equilibrium Green's function (NEGF) has become a state-of-the-art method for nano-scaled device simulation in the past years. In the sense of a multi-scale simulation approach it is necessary to bridge the gap between compact models with their fast and efficient calculation of the device current, and numerical device models which consider quantum effects of nano-scaled devices. In this work, an NEGF based analytical model for nano-scaled double-gate (DG) MOSFETs is introduced. The model consists of a closed-form potential solution of a classical compact model and a 1D NEGF formalism for calculating the device current, taking into account quantum mechanical effects. The potential calculation omits the iterative coupling and allows the straightforward current calculation. The model is based on a ballistic NEGF approach whereby backscattering effects are considered as second order effect in a closed-form. The accuracy and scalability of the non-iterative DG MOSFET model is inspected in comparison with numerical NanoMOS TCAD data for various channel lengths. With the help of this model investigations on short-channel and temperature effects are performed.

On the photonic implementation of universal quantum gates, bell states preparation circuit and quantum LDPC encoders and decoders based on directional couplers and HNLF.

PubMed

Djordjevic, Ivan B

2010-04-12

The Bell states preparation circuit is a basic circuit required in quantum teleportation. We describe how to implement it in all-fiber technology. The basic building blocks for its implementation are directional couplers and highly nonlinear optical fiber (HNLF). Because the quantum information processing is based on delicate superposition states, it is sensitive to quantum errors. In order to enable fault-tolerant quantum computing the use of quantum error correction is unavoidable. We show how to implement in all-fiber technology encoders and decoders for sparse-graph quantum codes, and provide an illustrative example to demonstrate this implementation. We also show that arbitrary set of universal quantum gates can be implemented based on directional couplers and HNLFs.

Band connectivity for topological quantum chemistry: Band structures as a graph theory problem

NASA Astrophysics Data System (ADS)

Bradlyn, Barry; Elcoro, L.; Vergniory, M. G.; Cano, Jennifer; Wang, Zhijun; Felser, C.; Aroyo, M. I.; Bernevig, B. Andrei

2018-01-01

The conventional theory of solids is well suited to describing band structures locally near isolated points in momentum space, but struggles to capture the full, global picture necessary for understanding topological phenomena. In part of a recent paper [B. Bradlyn et al., Nature (London) 547, 298 (2017), 10.1038/nature23268], we have introduced the way to overcome this difficulty by formulating the problem of sewing together many disconnected local k .p band structures across the Brillouin zone in terms of graph theory. In this paper, we give the details of our full theoretical construction. We show that crystal symmetries strongly constrain the allowed connectivities of energy bands, and we employ graph theoretic techniques such as graph connectivity to enumerate all the solutions to these constraints. The tools of graph theory allow us to identify disconnected groups of bands in these solutions, and so identify topologically distinct insulating phases.

Butterfly in the Quantum World; The story of the most fascinating quantum fractal

NASA Astrophysics Data System (ADS)

Satija, Indubala I.

2016-08-01

``Butterfly in the Quantum World'' by Indu Satija, with contributions by Douglas Hofstadter, is the first book ever to tell the story of the ``Hofstadter butterfly'', a beautiful and fascinating graph lying at the heart of the quantum theory of matter. The butterfly came out of a simple-sounding question: What happens if you immerse a crystal in a magnetic field? What energies can the electrons take on? From 1930 onwards, physicists struggled to answer this question, until 1974, when graduate student Douglas Hofstadter discovered that the answer was a graph consisting of nothing but copies of itself nested down infinitely many times. This wild mathematical object caught the physics world totally by surprise, and it continues to mesmerize physicists and mathematicians today. The butterfly plot is intimately related to many other important phenomena in number theory and physics, including Apollonian gaskets, the Foucault pendulum, quasicrystals, the quantum Hall effect, and many more. Its story reflects the magic, the mystery, and the simplicity of the laws of nature, and Indu Satija, in a wonderfully personal style, relates this story, enriching it with a vast number of lively historical anecdotes, many photographs, beautiful visual images, and even poems, making her book a great feast, for the eyes, for the mind and for the soul.

Probing Planckian Corrections at the Horizon Scale with LISA Binaries

NASA Astrophysics Data System (ADS)

Maselli, Andrea; Pani, Paolo; Cardoso, Vitor; Abdelsalhin, Tiziano; Gualtieri, Leonardo; Ferrari, Valeria

2018-02-01

Several quantum-gravity models of compact objects predict microscopic or even Planckian corrections at the horizon scale. We explore the possibility of measuring two model-independent, smoking-gun effects of these corrections in the gravitational waveform of a compact binary, namely, the absence of tidal heating and the presence of tidal deformability. For events detectable by the future space-based interferometer LISA, we show that the effect of tidal heating dominates and allows one to constrain putative corrections down to the Planck scale. The measurement of the tidal Love numbers with LISA is more challenging but, in optimistic scenarios, it allows us to constrain the compactness of a supermassive exotic compact object down to the Planck scale. Our analysis suggests that highly spinning, supermassive binaries at 1-20 Gpc provide unparalleled tests of quantum-gravity effects at the horizon scale.

Probing Planckian Corrections at the Horizon Scale with LISA Binaries.

PubMed

Maselli, Andrea; Pani, Paolo; Cardoso, Vitor; Abdelsalhin, Tiziano; Gualtieri, Leonardo; Ferrari, Valeria

2018-02-23

Several quantum-gravity models of compact objects predict microscopic or even Planckian corrections at the horizon scale. We explore the possibility of measuring two model-independent, smoking-gun effects of these corrections in the gravitational waveform of a compact binary, namely, the absence of tidal heating and the presence of tidal deformability. For events detectable by the future space-based interferometer LISA, we show that the effect of tidal heating dominates and allows one to constrain putative corrections down to the Planck scale. The measurement of the tidal Love numbers with LISA is more challenging but, in optimistic scenarios, it allows us to constrain the compactness of a supermassive exotic compact object down to the Planck scale. Our analysis suggests that highly spinning, supermassive binaries at 1-20 Gpc provide unparalleled tests of quantum-gravity effects at the horizon scale.

Synthesis of Arbitrary Quantum Circuits to Topological Assembly: Systematic, Online and Compact.

PubMed

Paler, Alexandru; Fowler, Austin G; Wille, Robert

2017-09-05

It is challenging to transform an arbitrary quantum circuit into a form protected by surface code quantum error correcting codes (a variant of topological quantum error correction), especially if the goal is to minimise overhead. One of the issues is the efficient placement of magic state distillation sub circuits, so-called distillation boxes, in the space-time volume that abstracts the computation's required resources. This work presents a general, systematic, online method for the synthesis of such circuits. Distillation box placement is controlled by so-called schedulers. The work introduces a greedy scheduler generating compact box placements. The implemented software, whose source code is available at www.github.com/alexandrupaler/tqec, is used to illustrate and discuss synthesis examples. Synthesis and optimisation improvements are proposed.

Stationary states in quantum walk search

NASA Astrophysics Data System (ADS)

PrÅ«sis, Krišjānis; Vihrovs, Jevgěnijs; Wong, Thomas G.

2016-09-01

When classically searching a database, having additional correct answers makes the search easier. For a discrete-time quantum walk searching a graph for a marked vertex, however, additional marked vertices can make the search harder by causing the system to approximately begin in a stationary state, so the system fails to evolve. In this paper, we completely characterize the stationary states, or 1-eigenvectors, of the quantum walk search operator for general graphs and configurations of marked vertices by decomposing their amplitudes into uniform and flip states. This infinitely expands the number of known stationary states and gives an optimization procedure to find the stationary state closest to the initial uniform state of the walk. We further prove theorems on the existence of stationary states, with them conditionally existing if the marked vertices form a bipartite connected component and always existing if nonbipartite. These results utilize the standard oracle in Grover's algorithm, but we show that a different type of oracle prevents stationary states from interfering with the search algorithm.

Water-level altitudes 2008 and water-level changes in the Chicot, Evangeline, and Jasper Aquifers and compaction 1973-2007 in the Chicot and Evangeline Aquifers, Houston-Galveston Region, Texas

USGS Publications Warehouse

Kasmarek, Mark C.; Houston, Natalie A.

2008-01-01

This report, done in cooperation with the Harris-Galveston Subsidence District, the City of Houston, the Fort Bend Subsidence District, and the Lone Star Groundwater Conservation District, is one in an annual series of reports that depicts water-level altitudes and water-level changes in the Chicot, Evangeline, and Jasper aquifers, and compaction in the Chicot and Evangeline aquifers in the Houston-Galveston region, Texas. The report contains 17 sheets and 16 tables: 3 sheets are maps showing current-year (2008) water-level altitudes for each aquifer, respectively; 3 sheets are maps showing 1-year (2007-08) water-level changes for each aquifer, respectively; 3 sheets are maps showing 5-year (2003-08) water-level changes for each aquifer, respectively; 4 sheets are maps showing long-term (1990-2008 and 1977-2008) water-level changes for the Chicot and Evangeline aquifers, respectively; 1 sheet is a map showing long-term (2000-2008) water-level change for the Jasper aquifer; 1 sheet is a revision of a previously published water-level-altitude map for the Jasper aquifer for 2003; 1 sheet is a map showing site locations of borehole extensometers; and 1 sheet comprises graphs showing measured compaction of subsurface material at the sites from 1973 or later through 2007, respectively. Tables listing the data used to construct the aquifer-data maps and the compaction graphs are included.

Water-level altitudes 2007 and water-level changes in the Chicot, Evangeline, and Jasper Aquifers and compaction 1973-2006 in the Chicot and Evangeline Aquifers, Houston-Galveston Region, Texas

USGS Publications Warehouse

Kasmarek, Mark C.; Houston, Natalie A.

2007-01-01

This report, done in cooperation with the Harris-Galveston Subsidence District, the City of Houston, the Fort Bend Subsidence District, and the Lone Star Groundwater Conservation District, is one in an annual series of reports that depicts water-level altitudes and water-level changes in the Chicot, Evangeline, and Jasper aquifers, and compaction in the Chicot and Evangeline aquifers in the Houston-Galveston, Texas, region. The report contains 18 sheets and 17 tables: 3 sheets are maps showing current-year (2007) water-level altitudes for each aquifer, respectively; 3 sheets are maps showing 1-year (2006-07) water-level changes for each aquifer, respectively; 3 sheets are maps showing 5-year (2002-07) water-level changes for each aquifer, respectively; 4 sheets are maps showing long-term (1990-2007 and 1977-2007) water-level changes for the Chicot and Evangeline aquifers, respectively; 1 sheet is a map showing long-term (2000-2007) water-level change for the Jasper aquifer; 2 sheets are revisions of previously published water-level-altitude maps for the Jasper aquifer for 2000 and 2002, respectively; 1 sheet is a map showing site locations of borehole extensometers; and 1 sheet comprises graphs showing measured compaction of subsurface material at the sites from 1973 or later through 2006, respectively. Tables listing the data used to construct the aquifer-data maps and the compaction graphs also are included.

A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.

PubMed

Dinh, Hieu; Rajasekaran, Sanguthevar

2011-07-15

Exact-match overlap graphs have been broadly used in the context of DNA assembly and the shortest super string problem where the number of strings n ranges from thousands to billions. The length ℓ of the strings is from 25 to 1000, depending on the DNA sequencing technologies. However, many DNA assemblers using overlap graphs suffer from the need for too much time and space in constructing the graphs. It is nearly impossible for these DNA assemblers to handle the huge amount of data produced by the next-generation sequencing technologies where the number n of strings could be several billions. If the overlap graph is explicitly stored, it would require Ω(n(2)) memory, which could be prohibitive in practice when n is greater than a hundred million. In this article, we propose a novel data structure using which the overlap graph can be compactly stored. This data structure requires only linear time to construct and and linear memory to store. For a given set of input strings (also called reads), we can informally define an exact-match overlap graph as follows. Each read is represented as a node in the graph and there is an edge between two nodes if the corresponding reads overlap sufficiently. A formal description follows. The maximal exact-match overlap of two strings x and y, denoted by ov(max)(x, y), is the longest string which is a suffix of x and a prefix of y. The exact-match overlap graph of n given strings of length ℓ is an edge-weighted graph in which each vertex is associated with a string and there is an edge (x, y) of weight ω=ℓ-|ov(max)(x, y)| if and only if ω ≤ λ, where |ov(max)(x, y)| is the length of ov(max)(x, y) and λ is a given threshold. In this article, we show that the exact-match overlap graphs can be represented by a compact data structure that can be stored using at most (2λ-1)(2⌈logn⌉+⌈logλ⌉)n bits with a guarantee that the basic operation of accessing an edge takes O(log λ) time. We also propose two algorithms for constructing the data structure for the exact-match overlap graph. The first algorithm runs in O(λℓnlogn) worse-case time and requires O(λ) extra memory. The second one runs in O(λℓn) time and requires O(n) extra memory. Our experimental results on a huge amount of simulated data from sequence assembly show that the data structure can be constructed efficiently in time and memory. Our DNA sequence assembler that incorporates the data structure is freely available on the web at http://www.engr.uconn.edu/~htd06001/assembler/leap.zip

Numerical simulation of electron scattering by nanotube junctions

NASA Astrophysics Data System (ADS)

Brüning, J.; Grikurov, V. E.

2008-03-01

We demonstrate the possibility of computing the intensity of electronic transport through various junctions of three-dimensional metallic nanotubes. In particular, we observe that the magnetic field can be used to control the switch of electron in Y-type junctions. Keeping in mind the asymptotic modeling of reliable nanostructures by quantum graphs, we conjecture that the scattering matrix of the graph should be the same as the scattering matrix of its nanosize-prototype. The numerical computation of the latter gives a method for determining the "gluing" conditions at a graph. Exploring this conjecture, we show that the Kirchhoff conditions (which are commonly used on graphs) cannot be applied to model reliable junctions. This work is a natural extension of the paper [1], but it is written in a self-consistent manner.

A graph-Laplacian-based feature extraction algorithm for neural spike sorting.

PubMed

Ghanbari, Yasser; Spence, Larry; Papamichalis, Panos

2009-01-01

Analysis of extracellular neural spike recordings is highly dependent upon the accuracy of neural waveform classification, commonly referred to as spike sorting. Feature extraction is an important stage of this process because it can limit the quality of clustering which is performed in the feature space. This paper proposes a new feature extraction method (which we call Graph Laplacian Features, GLF) based on minimizing the graph Laplacian and maximizing the weighted variance. The algorithm is compared with Principal Components Analysis (PCA, the most commonly-used feature extraction method) using simulated neural data. The results show that the proposed algorithm produces more compact and well-separated clusters compared to PCA. As an added benefit, tentative cluster centers are output which can be used to initialize a subsequent clustering stage.

Integrated heterodyne terahertz transceiver

DOEpatents

Lee, Mark [Albuquerque, NM; Wanke, Michael C [Albuquerque, NM

2009-06-23

A heterodyne terahertz transceiver comprises a quantum cascade laser that is integrated on-chip with a Schottky diode mixer. An antenna connected to the Schottky diode receives a terahertz signal. The quantum cascade laser couples terahertz local oscillator power to the Schottky diode to mix with the received terahertz signal to provide an intermediate frequency output signal. The fully integrated transceiver optimizes power efficiency, sensitivity, compactness, and reliability. The transceiver can be used in compact, fieldable systems covering a wide variety of deployable applications not possible with existing technology.

Global existence of the three-dimensional viscous quantum magnetohydrodynamic model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yang, Jianwei, E-mail: yangjianwei@ncwu.edu.cn; Ju, Qiangchang, E-mail: qiangchang-ju@yahoo.com

2014-08-15

The global-in-time existence of weak solutions to the viscous quantum Magnetohydrodynamic equations in a three-dimensional torus with large data is proved. The global existence of weak solutions to the viscous quantum Magnetohydrodynamic equations is shown by using the Faedo-Galerkin method and weak compactness techniques.

Approximate water-level changes in wells completed in the Chicot and Evangeline aquifers, 1977-91 and 1990-91, and measured compaction, 1973-90, in the Houston-Galveston region, Texas

USGS Publications Warehouse

Barbie, Dana L.; Kasmarek, M.C.; Campodonico, Al

1991-01-01

This report is one in a series of reports that depict water-level changes and compaction of subsurface material in the Houston-Galveston region. The maps present approximate water-level changes in wells in the Chicot and Evangeline aquifers, 1977-91 and 1990-91 (figs. 1-4). The location of borehole extensometers is shown in figure 5, and graphs present measured compation for 1973-90 (fig. 6).

ASCR Workshop on Quantum Computing for Science

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aspuru-Guzik, Alan; Van Dam, Wim; Farhi, Edward

This report details the findings of the DOE ASCR Workshop on Quantum Computing for Science that was organized to assess the viability of quantum computing technologies to meet the computational requirements of the DOE’s science and energy mission, and to identify the potential impact of quantum technologies. The workshop was held on February 17-18, 2015, in Bethesda, MD, to solicit input from members of the quantum computing community. The workshop considered models of quantum computation and programming environments, physical science applications relevant to DOE's science mission as well as quantum simulation, and applied mathematics topics including potential quantum algorithms formore » linear algebra, graph theory, and machine learning. This report summarizes these perspectives into an outlook on the opportunities for quantum computing to impact problems relevant to the DOE’s mission as well as the additional research required to bring quantum computing to the point where it can have such impact.« less

Ramsey numbers and adiabatic quantum computing.

PubMed

Gaitan, Frank; Clark, Lane

2012-01-06

The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers R(m,n) with m, n≥3, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers R(m,n). We show how the computation of R(m,n) can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evolution. We numerically simulate this adiabatic quantum algorithm and show that it correctly determines the Ramsey numbers R(3,3) and R(2,s) for 5≤s≤7. We then discuss the algorithm's experimental implementation, and close by showing that Ramsey number computation belongs to the quantum complexity class quantum Merlin Arthur.

Group velocity of discrete-time quantum walks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kempf, A.; Department of Applied Mathematics, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1; Portugal, R.

2009-05-15

We show that certain types of quantum walks can be modeled as waves that propagate in a medium with phase and group velocities that are explicitly calculable. Since the group and phase velocities indicate how fast wave packets can propagate causally, we propose the use of these wave velocities in our definition for the hitting time of quantum walks. Our definition of hitting time has the advantage that it requires neither the specification of a walker's initial condition nor of an arrival probability threshold. We give full details for the case of quantum walks on the Cayley graphs of Abelianmore » groups. This includes the special cases of quantum walks on the line and on hypercubes.« less

Bounds for percolation thresholds on directed and undirected graphs

NASA Astrophysics Data System (ADS)

Hamilton, Kathleen; Pryadko, Leonid

2015-03-01

Percolation theory is an efficient approach to problems with strong disorder, e.g., in quantum or classical transport, composite materials, and diluted magnets. Recently, the growing role of big data in scientific and industrial applications has led to a renewed interest in graph theory as a tool for describing complex connections in various kinds of networks: social, biological, technological, etc. In particular, percolation on graphs has been used to describe internet stability, spread of contagious diseases and computer viruses; related models describe market crashes and viral spread in social networks. We consider site-dependent percolation on directed and undirected graphs, and present several exact bounds for location of the percolation transition in terms of the eigenvalues of matrices associated with graphs, including the adjacency matrix and the Hashimoto matrix used to enumerate non-backtracking walks. These bounds correspond t0 a mean field approximation and become asymptotically exact for graphs with no short cycles. We illustrate this convergence numerically by simulating percolation on several families of graphs with different cycle lengths. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-11-1-0027.

Quantum Groups, Property (T), and Weak Mixing

NASA Astrophysics Data System (ADS)

Brannan, Michael; Kerr, David

2018-06-01

For second countable discrete quantum groups, and more generally second countable locally compact quantum groups with trivial scaling group, we show that property (T) is equivalent to every weakly mixing unitary representation not having almost invariant vectors. This is a generalization of a theorem of Bekka and Valette from the group setting and was previously established in the case of low dual by Daws, Skalski, and Viselter. Our approach uses spectral techniques and is completely different from those of Bekka-Valette and Daws-Skalski-Viselter. By a separate argument we furthermore extend the result to second countable nonunimodular locally compact quantum groups, which are shown in particular not to have property (T), generalizing a theorem of Fima from the discrete setting. We also obtain quantum group versions of characterizations of property (T) of Kerr and Pichot in terms of the Baire category theory of weak mixing representations and of Connes and Weiss in terms of the prevalence of strongly ergodic actions.

A Measure for the Cohesion of Weighted Networks.

ERIC Educational Resources Information Center

Egghe, Leo; Rousseau, Ronald

2003-01-01

Discusses graph theory in information science, focusing on measures for the cohesion of networks. Illustrates how a set of weights between connected nodes can be transformed into a set of dissimilarity measures and presents an example of the new compactness measures for a cocitation and a bibliographic coupling network. (Author/LRW)

Discriminating Drug-Like Compounds by Partition Trees with Quantum Similarity Indices and Graph Invariants.

PubMed

Julián-Ortiz, Jesus V de; Gozalbes, Rafael; Besalú, Emili

2016-01-01

The search for new drug candidates in databases is of paramount importance in pharmaceutical chemistry. The selection of molecular subsets is greatly optimized and much more promising when potential drug-like molecules are detected a priori. In this work, about one hundred thousand molecules are ranked following a new methodology: a drug/non-drug classifier constructed by a consensual set of classification trees. The classification trees arise from the stochastic generation of training sets, which in turn are used to estimate probability factors of test molecules to be drug-like compounds. Molecules were represented by Topological Quantum Similarity Indices and their Graph Theoretical counterparts. The contribution of the present paper consists of presenting an effective ranking method able to improve the probability of finding drug-like substances by using these types of molecular descriptors.

Yoink: An interaction-based partitioning API.

PubMed

Zheng, Min; Waller, Mark P

2018-05-15

Herein, we describe the implementation details of our interaction-based partitioning API (application programming interface) called Yoink for QM/MM modeling and fragment-based quantum chemistry studies. Interactions are detected by computing density descriptors such as reduced density gradient, density overlap regions indicator, and single exponential decay detector. Only molecules having an interaction with a user-definable QM core are added to the QM region of a hybrid QM/MM calculation. Moreover, a set of molecule pairs having density-based interactions within a molecular system can be computed in Yoink, and an interaction graph can then be constructed. Standard graph clustering methods can then be applied to construct fragments for further quantum chemical calculations. The Yoink API is licensed under Apache 2.0 and can be accessed via yoink.wallerlab.org. © 2018 Wiley Periodicals, Inc. © 2018 Wiley Periodicals, Inc.

Droplet states in quantum XXZ spin systems on general graphs

NASA Astrophysics Data System (ADS)

Fischbacher, C.; Stolz, G.

2018-05-01

We study XXZ spin systems on general graphs. In particular, we describe the formation of droplet states near the bottom of the spectrum in the Ising phase of the model, where the Z-term dominates the XX-term. As key tools, we use particle number conservation of XXZ systems and symmetric products of graphs with their associated adjacency matrices and Laplacians. Of particular interest to us are strips and multi-dimensional Euclidean lattices, for which we discuss the existence of spectral gaps above the droplet regime. We also prove a Combes-Thomas bound which shows that the eigenstates in the droplet regime are exponentially small perturbations of strict (classical) droplets.

The signed permutation group on Feynman graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Purkart, Julian, E-mail: purkart@physik.hu-berlin.de

2016-08-15

The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalization group are small, we can expand the integral and only consider the lowest orders in the scaling. The aim of this article is to determine specific combinations of graphs in a scalar quantum field theory that lead to a remarkable simplification of the first non-trivial term in the perturbation series. It will be seen that the result is independent of the renormalization schememore » and the scattering angles. To achieve that goal we will utilize the parametric representation of scalar Feynman integrals as well as the Hopf algebraic structure of the Feynman graphs under consideration. Moreover, we will present a formula which reduces the effort of determining the first-order term in the perturbation series for the specific combination of graphs to a minimum.« less

Design of sub-Angstrom compact free-electron laser source

NASA Astrophysics Data System (ADS)

Bonifacio, Rodolfo; Fares, Hesham; Ferrario, Massimo; McNeil, Brian W. J.; Robb, Gordon R. M.

2017-01-01

In this paper, we propose for first time practical parameters to construct a compact sub-Angstrom Free Electron Laser (FEL) based on Compton backscattering. Our recipe is based on using picocoulomb electron bunch, enabling very low emittance and ultracold electron beam. We assume the FEL is operating in a quantum regime of Self Amplified Spontaneous Emission (SASE). The fundamental quantum feature is a significantly narrower spectrum of the emitted radiation relative to classical SASE. The quantum regime of the SASE FEL is reached when the momentum spread of the electron beam is smaller than the photon recoil momentum. Following the formulae describing SASE FEL operation, realistic designs for quantum FEL experiments are proposed. We discuss the practical constraints that influence the experimental parameters. Numerical simulations of power spectra and intensities are presented and attractive radiation characteristics such as high flux, narrow linewidth, and short pulse structure are demonstrated.

Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program

NASA Astrophysics Data System (ADS)

Manin, Yuri I.

Introduction. The main observable quantities in Quantum Field Theory, correlation functions, are expressed by the celebrated Feynman path integrals. A mathematical definition of them involving a measure and actual integration is still lacking. Instead, it is replaced by a series of ad hoc but highly efficient and suggestive heuristic formulas such as perturbation formalism. The latter interprets such an integral as a formal series of finite-dimensional but divergent integrals, indexed by Feynman graphs, the list of which is determined by the Lagrangian of the theory. Renormalization is a prescription that allows one to systematically "subtract infinities" from these divergent terms producing an asymptotic series for quantum correlation functions. On the other hand, graphs treated as "flowcharts", also form a combinatorial skeleton of the abstract computation theory. Partial recursive functions that according to Church's thesis exhaust the universe of (semi)computable maps are generally not everywhere defined due to potentially infinite searches and loops. In this paper I argue that such infinities can be addressed in the same way as Feynman divergences. More details can be found in [9,10].

Approximate Locality for Quantum Systems on Graphs

NASA Astrophysics Data System (ADS)

Osborne, Tobias J.

2008-10-01

In this Letter we make progress on a long-standing open problem of Aaronson and Ambainis [Theory Comput. 1, 47 (2005)1557-2862]: we show that if U is a sparse unitary operator with a gap Δ in its spectrum, then there exists an approximate logarithm H of U which is also sparse. The sparsity pattern of H gets more dense as 1/Δ increases. This result can be interpreted as a way to convert between local continuous-time and local discrete-time quantum processes. As an example we show that the discrete-time coined quantum walk can be realized stroboscopically from an approximately local continuous-time quantum walk.

Quantum red-green-blue image steganography

NASA Astrophysics Data System (ADS)

Heidari, Shahrokh; Pourarian, Mohammad Rasoul; Gheibi, Reza; Naseri, Mosayeb; Houshmand, Monireh

One of the most considering matters in the field of quantum information processing is quantum data hiding including quantum steganography and quantum watermarking. This field is an efficient tool for protecting any kind of digital data. In this paper, three quantum color images steganography algorithms are investigated based on Least Significant Bit (LSB). The first algorithm employs only one of the image’s channels to cover secret data. The second procedure is based on LSB XORing technique, and the last algorithm utilizes two channels to cover the color image for hiding secret quantum data. The performances of the proposed schemes are analyzed by using software simulations in MATLAB environment. The analysis of PSNR, BER and Histogram graphs indicate that the presented schemes exhibit acceptable performances and also theoretical analysis demonstrates that the networks complexity of the approaches scales squarely.

Compact mode-locked diode laser system for high precision frequency comparisons in microgravity

NASA Astrophysics Data System (ADS)

Christopher, H.; Kovalchuk, E. V.; Wicht, A.; Erbert, G.; Tränkle, G.; Peters, A.

2017-11-01

Nowadays cold atom-based quantum sensors such as atom interferometers start leaving optical labs to put e.g. fundamental physics under test in space. One of such intriguing applications is the test of the Weak Equivalence Principle, the Universality of Free Fall (UFF), using different quantum objects such as rubidium (Rb) and potassium (K) ultra-cold quantum gases. The corresponding atom interferometers are implemented with light pulses from narrow linewidth lasers emitting near 767 nm (K) and 780 nm (Rb). To determine any relative acceleration of the K and Rb quantum ensembles during free fall, the frequency difference between the K and Rb lasers has to be measured very accurately by means of an optical frequency comb. Micro-gravity applications not only require good electro-optical characteristics but are also stringent in their demand for compactness, robustness and efficiency. For frequency comparison experiments the rather complex fiber laser-based frequency comb system may be replaced by one semiconductor laser chip and some passive components. Here we present an important step towards this direction, i.e. we report on the development of a compact mode-locked diode laser system designed to generate a highly stable frequency comb in the wavelength range of 780 nm.

Generalized monogamy of contextual inequalities from the no-disturbance principle.

PubMed

Ramanathan, Ravishankar; Soeda, Akihito; Kurzyński, Paweł; Kaszlikowski, Dagomir

2012-08-03

In this Letter, we demonstrate that the property of monogamy of Bell violations seen for no-signaling correlations in composite systems can be generalized to the monogamy of contextuality in single systems obeying the Gleason property of no disturbance. We show how one can construct monogamies for contextual inequalities by using the graph-theoretic technique of vertex decomposition of a graph representing a set of measurements into subgraphs of suitable independence numbers that themselves admit a joint probability distribution. After establishing that all the subgraphs that are chordal graphs admit a joint probability distribution, we formulate a precise graph-theoretic condition that gives rise to the monogamy of contextuality. We also show how such monogamies arise within quantum theory for a single four-dimensional system and interpret violation of these relations in terms of a violation of causality. These monogamies can be tested with current experimental techniques.

Realization of reliable solid-state quantum memory for photonic polarization qubit.

PubMed

Zhou, Zong-Quan; Lin, Wei-Bin; Yang, Ming; Li, Chuan-Feng; Guo, Guang-Can

2012-05-11

Faithfully storing an unknown quantum light state is essential to advanced quantum communication and distributed quantum computation applications. The required quantum memory must have high fidelity to improve the performance of a quantum network. Here we report the reversible transfer of photonic polarization states into collective atomic excitation in a compact solid-state device. The quantum memory is based on an atomic frequency comb (AFC) in rare-earth ion-doped crystals. We obtain up to 0.999 process fidelity for the storage and retrieval process of single-photon-level coherent pulse. This reliable quantum memory is a crucial step toward quantum networks based on solid-state devices.

Quantum Effects in Cosmology

NASA Astrophysics Data System (ADS)

Saharian, A. A.

2016-09-01

We investigate the vacuum expectation value of the current density for a charged scalar field on a slice of anti-de Sitter (AdS) space with toroidally compact dimensions. Along the compact dimensions periodicity conditions are imposed on the field operator with general phases and the presence of a constant gauge field is assumed. The latter gives rise to Aharonov-Bohm-like effects on the vacuum currents. The current density along compact dimensions is a periodic function of the gauge field flux with the period equal to the flux quantum. It vanishes on the AdS boundary and, near the horizon, to the leading order, it is conformally related to the corresponding quantity in Minkowski bulk for a massless field. For large values of the length of the compact dimension compared with the AdS curvature radius, the vacuum current decays as power-law for both massless and massive fields. This behavior is essentially different from the corresponding one in Minkowski background, where the currents for a massive field are suppressed exponentially.

The Versatility of Photo CD Technology in the Classroom.

ERIC Educational Resources Information Center

Mustoe, Myles

The Kodak Photo CD (compact disk) system provides a fun, new, very accessible way to integrate images into geography classroom presentations. Graphicacy deals with spatial information that can only be expressed by a graph, map, or photograph. The importance for geography students to develop visual observation and graphic interpretive skills is…

Graph theory and the Virasoro master equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Obers, N.A.J.

1991-04-01

A brief history of affine Lie algebra, the Virasoro algebra and its culmination in the Virasoro master equations is given. By studying ansaetze of the master equation, we obtain exact solutions and gain insight in the structure of large slices of affine-Virasoro space. We find an isomorphism between the constructions in the ansatz SO(n){sub diag}, which is a set of unitary, generically irrational affine-Virasoro constructions on SO(n), and the unlabelled graphs, while, conversely, a group-theoretic and conformal field-theoretic identification is obtained for every graph of graph theory. We also define a class of magic'' Lie group bases in which themore » Virasoro master equation admits a simple metric ansatz (gmetric), whose structure is visible in the high-level expansion. When a magic basis is real on compact g, the corresponding g{sub metric} is a large system of unitary, generically irrational conformal field theories. Examples in this class include the graph-theory ansatz SO(n){sub diag} in the Cartesian basis of SO(n), and the ansatz SU(n){sub metric} in the Pauli-like basis of SU(n). Finally, we define the sine-area graphs'' of SU(n), which label the conformal field theories of SU(n){sub metric}, and we note that, in similar fashion, each magic basis of g defines a generalized graph theory on g which labels the conformal field theories of g{sub metric}. 24 figs., 4 tabs.« less

Gambler's ruin problem on Erdős-Rényi graphs

NASA Astrophysics Data System (ADS)

Néda, Zoltán; Davidova, Larissa; Újvári, Szeréna; Istrate, Gabriel

2017-02-01

A multiagent ruin-game is studied on Erdős-Rényi type graphs. Initially the players have the same wealth. At each time step a monopolist game is played on all active links (links that connect nodes with nonzero wealth). In such a game each player puts a unit wealth in the pot and the pot is won with equal probability by one of the players. The game ends when there are no connected players such that both of them have non-zero wealth. In order to characterize the final state for dense graphs a compact formula is given for the expected number of the remaining players with non-zero wealth and the wealth distribution among these players. Theoretical predictions are given for the expected duration of the ruin game. The dynamics of the number of active players is also investigated. Validity of the theoretical predictions is investigated by Monte Carlo experiments.

High-power lightweight external-cavity quantum cascade lasers

NASA Astrophysics Data System (ADS)

Day, Timothy; Takeuchi, Eric B.; Weida, Miles; Arnone, David; Pushkarsky, Michael; Boyden, David; Caffey, David

2009-05-01

Commercially available quantum cascade gain media has been integrated with advanced coating and die attach technologies, mid-IR micro-optics and telecom-style assembly and packaging to yield cutting edge performance. When combined into Daylight's external-cavity quantum cascade laser (ECqcL) platform, multi-Watt output power has been obtained. Daylight will describe their most recent results obtained from this platform, including high cw power from compact hermetically sealed packages and narrow spectral linewidth devices. Fiber-coupling and direct amplitude modulation from such multi-Watt lasers will also be described. In addition, Daylight will present the most recent results from their compact, portable, battery-operated "thermal laser pointers" that are being used for illumination and aiming applications. When combined with thermal imaging technology, such devices provide significant benefits in contrast and identification.

Compact Quantum Random Number Generator with Silicon Nanocrystals Light Emitting Device Coupled to a Silicon Photomultiplier

NASA Astrophysics Data System (ADS)

Bisadi, Zahra; Acerbi, Fabio; Fontana, Giorgio; Zorzi, Nicola; Piemonte, Claudio; Pucker, Georg; Pavesi, Lorenzo

2018-02-01

A small-sized photonic quantum random number generator, easy to be implemented in small electronic devices for secure data encryption and other applications, is highly demanding nowadays. Here, we propose a compact configuration with Silicon nanocrystals large area light emitting device (LED) coupled to a Silicon photomultiplier to generate random numbers. The random number generation methodology is based on the photon arrival time and is robust against the non-idealities of the detector and the source of quantum entropy. The raw data show high quality of randomness and pass all the statistical tests in national institute of standards and technology tests (NIST) suite without a post-processing algorithm. The highest bit rate is 0.5 Mbps with the efficiency of 4 bits per detected photon.

Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems

NASA Astrophysics Data System (ADS)

Mandrà, Salvatore; Giacomo Guerreschi, Gian; Aspuru-Guzik, Alán

2016-07-01

We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists in the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the Exact Satisfiability; while the second part performs a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to certify that no solution exists) or to count the total number of valid assignments. The query complexities for the worst-case are respectively bounded by O(\\sqrt{{2}n-{M\\prime }}) and O({2}n-{M\\prime }), where n is the number of variables and {M}\\prime the number of linearly independent clauses. Remarkably, the proposed quantum algorithm results to be faster than any known exact classical algorithm to solve dense formulas of Exact Satisfiability. As a concrete application, we provide the worst-case complexity for the Hamiltonian cycle problem obtained after mapping it to a suitable Occupation problem. Specifically, we show that the time complexity for the proposed quantum algorithm is bounded by O({2}n/4) for 3-regular undirected graphs, where n is the number of nodes. The same worst-case complexity holds for (3,3)-regular bipartite graphs. As a reference, the current best classical algorithm has a (worst-case) running time bounded by O({2}31n/96). Finally, when compared to heuristic techniques for Exact Satisfiability problems, the proposed quantum algorithm is faster than the classical WalkSAT and Adiabatic Quantum Optimization for random instances with a density of constraints close to the satisfiability threshold, the regime in which instances are typically the hardest to solve. The proposed quantum algorithm can be straightforwardly extended to the generalized version of the Exact Satisfiability known as Occupation problem. The general version of the algorithm is presented and analyzed.

Percolation bounds for decoding thresholds with correlated erasures in quantum LDPC codes

NASA Astrophysics Data System (ADS)

Hamilton, Kathleen; Pryadko, Leonid

Correlations between errors can dramatically affect decoding thresholds, in some cases eliminating the threshold altogether. We analyze the existence of a threshold for quantum low-density parity-check (LDPC) codes in the case of correlated erasures. When erasures are positively correlated, the corresponding multi-variate Bernoulli distribution can be modeled in terms of cluster errors, where qubits in clusters of various size can be marked all at once. In a code family with distance scaling as a power law of the code length, erasures can be always corrected below percolation on a qubit adjacency graph associated with the code. We bound this correlated percolation transition by weighted (uncorrelated) percolation on a specially constructed cluster connectivity graph, and apply our recent results to construct several bounds for the latter. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-14-1-0272.

Spacetime Replication of Quantum Information Using (2 , 3) Quantum Secret Sharing and Teleportation

NASA Astrophysics Data System (ADS)

Wu, Yadong; Khalid, Abdullah; Davijani, Masoud; Sanders, Barry

The aim of this work is to construct a protocol to replicate quantum information in any valid configuration of causal diamonds and assess resources required to physically realize spacetime replication. We present a set of codes to replicate quantum information along with a scheme to realize these codes using continuous-variable quantum optics. We use our proposed experimental realizations to determine upper bounds on the quantum and classical resources required to simulate spacetime replication. For four causal diamonds, our implementation scheme is more efficient than the one proposed previously. Our codes are designed using a decomposition algorithm for complete directed graphs, (2 , 3) quantum secret sharing, quantum teleportation and entanglement swapping. These results show the simulation of spacetime replication of quantum information is feasible with existing experimental methods. Alberta Innovates, NSERC, China's 1000 Talent Plan and the Institute for Quantum Information and Matter, which is an NSF Physics Frontiers Center (NSF Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-2644).

A compact free space quantum key distribution system capable of daylight operation

NASA Astrophysics Data System (ADS)

Benton, David M.; Gorman, Phillip M.; Tapster, Paul R.; Taylor, David M.

2010-06-01

A free space quantum key distribution system has been demonstrated. Consideration has been given to factors such as field of view and spectral width, to cut down the deleterious effect from background light levels. Suitable optical sources such as lasers and RCLEDs have been investigated as well as optimal wavelength choices, always with a view to building a compact and robust system. The implementation of background reduction measures resulted in a system capable of operating in daylight conditions. An autonomous system was left running and generating shared key material continuously for over 7 days.

[A Compact Source of Terahertz Radiation Based on Interaction of Electrons in à Quantum Well with an Electromagnetic Wave of a Corrugated Waveguide].

PubMed

Shchurova, L Yu; Namiot, V A; Sarkisyan, D R

2015-01-01

Coherent sources of electromagnetic waves in the terahertz frequency range are very promising for various applications, including biology and medicine. In this paper we propose a scheme of a compact terahertz source, in which terahertz radiation is generated due to effective interaction of electrons in a quantum well with an electromagnetic wave of a corrugated waveguide. We have shown that the generation of electromagnetic waves with a frequency of 1012 sec(-1) and an output power of up to 25. mW is possible in the proposed scheme.

Compact quantum random number generator based on superluminescent light-emitting diodes

NASA Astrophysics Data System (ADS)

Wei, Shihai; Yang, Jie; Fan, Fan; Huang, Wei; Li, Dashuang; Xu, Bingjie

2017-12-01

By measuring the amplified spontaneous emission (ASE) noise of the superluminescent light emitting diodes, we propose and realize a quantum random number generator (QRNG) featured with practicability. In the QRNG, after the detection and amplification of the ASE noise, the data acquisition and randomness extraction which is integrated in a field programmable gate array (FPGA) are both implemented in real-time, and the final random bit sequences are delivered to a host computer with a real-time generation rate of 1.2 Gbps. Further, to achieve compactness, all the components of the QRNG are integrated on three independent printed circuit boards with a compact design, and the QRNG is packed in a small enclosure sized 140 mm × 120 mm × 25 mm. The final random bit sequences can pass all the NIST-STS and DIEHARD tests.

Moduli of quantum Riemannian geometries on <=4 points

NASA Astrophysics Data System (ADS)

Majid, S.; Raineri, E.

2004-12-01

We classify parallelizable noncommutative manifold structures on finite sets of small size in the general formalism of framed quantum manifolds and vielbeins introduced previously [S. Majid, Commun. Math. Phys. 225, 131 (2002)]. The full moduli space is found for ⩽3 points, and a restricted moduli space for 4 points. Generalized Levi-Cività connections and their curvatures are found for a variety of models including models of a discrete torus. The topological part of the moduli space is found for ⩽9 points based on the known atlas of regular graphs. We also remark on aspects of quantum gravity in this approach.

Quantum correlations are tightly bound by the exclusivity principle.

PubMed

Yan, Bin

2013-06-28

It is a fundamental problem in physics of what principle limits the correlations as predicted by our current description of nature, based on quantum mechanics. One possible explanation is the "global exclusivity" principle recently discussed in Phys. Rev. Lett. 110, 060402 (2013). In this work we show that this principle actually has a much stronger restriction on the probability distribution. We provide a tight constraint inequality imposed by this principle and prove that this principle singles out quantum correlations in scenarios represented by any graph. Our result implies that the exclusivity principle might be one of the fundamental principles of nature.

Operating single quantum emitters with a compact Stirling cryocooler

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schlehahn, A.; Krüger, L.; Gschrey, M.

2015-01-15

The development of an easy-to-operate light source emitting single photons has become a major driving force in the emerging field of quantum information technology. Here, we report on the application of a compact and user-friendly Stirling cryocooler in the field of nanophotonics. The Stirling cryocooler is used to operate a single quantum emitter constituted of a semiconductor quantum dot (QD) at a base temperature below 30 K. Proper vibration decoupling of the cryocooler and its surrounding enables free-space micro-photoluminescence spectroscopy to identify and analyze different charge-carrier states within a single quantum dot. As an exemplary application in quantum optics, wemore » perform a Hanbury-Brown and Twiss experiment demonstrating a strong suppression of multi-photon emission events with g{sup (2)}(0) < 0.04 from this Stirling-cooled single quantum emitter under continuous wave excitation. Comparative experiments performed on the same quantum dot in a liquid helium (LHe)-flow cryostat show almost identical values of g{sup (2)}(0) for both configurations at a given temperature. The results of this proof of principle experiment demonstrate that low-vibration Stirling cryocoolers that have so far been considered exotic to the field of nanophotonics are an attractive alternative to expensive closed-cycle cryostats or LHe-flow cryostats, which could pave the way for the development of high-quality table-top non-classical light sources.« less

Operating single quantum emitters with a compact Stirling cryocooler.

PubMed

Schlehahn, A; Krüger, L; Gschrey, M; Schulze, J-H; Rodt, S; Strittmatter, A; Heindel, T; Reitzenstein, S

2015-01-01

The development of an easy-to-operate light source emitting single photons has become a major driving force in the emerging field of quantum information technology. Here, we report on the application of a compact and user-friendly Stirling cryocooler in the field of nanophotonics. The Stirling cryocooler is used to operate a single quantum emitter constituted of a semiconductor quantum dot (QD) at a base temperature below 30 K. Proper vibration decoupling of the cryocooler and its surrounding enables free-space micro-photoluminescence spectroscopy to identify and analyze different charge-carrier states within a single quantum dot. As an exemplary application in quantum optics, we perform a Hanbury-Brown and Twiss experiment demonstrating a strong suppression of multi-photon emission events with g((2))(0) < 0.04 from this Stirling-cooled single quantum emitter under continuous wave excitation. Comparative experiments performed on the same quantum dot in a liquid helium (LHe)-flow cryostat show almost identical values of g((2))(0) for both configurations at a given temperature. The results of this proof of principle experiment demonstrate that low-vibration Stirling cryocoolers that have so far been considered exotic to the field of nanophotonics are an attractive alternative to expensive closed-cycle cryostats or LHe-flow cryostats, which could pave the way for the development of high-quality table-top non-classical light sources.

Geographic information modeling of Econet of Northwestern Federal District territory on graph theory basis

NASA Astrophysics Data System (ADS)

Kopylova, N. S.; Bykova, A. A.; Beregovoy, D. N.

2018-05-01

Based on the landscape-geographical approach, a structural and logical scheme for the Northwestern Federal District Econet has been developed, which can be integrated into the federal and world ecological network in order to improve the environmental infrastructure of the region. The method of Northwestern Federal District Econet organization on the basis of graph theory by means of the Quantum GIS geographic information system is proposed as an effective mean of preserving and recreating the unique biodiversity of landscapes, regulation of the sphere of environmental protection.

Quantum simulation of a quantum stochastic walk

NASA Astrophysics Data System (ADS)

Govia, Luke C. G.; Taketani, Bruno G.; Schuhmacher, Peter K.; Wilhelm, Frank K.

2017-03-01

The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk (QSW), which allows for incoherent movement of the walker, and therefore, directionality, is a generalization on the fully coherent quantum walk. While a QSW can always be described in Lindblad formalism, this does not mean that it can be microscopically derived in the standard weak-coupling limit under the Born-Markov approximation. This restricts the class of QSWs that can be experimentally realized in a simple manner. To circumvent this restriction, we introduce a technique to simulate open system evolution on a fully coherent quantum computer, using a quantum trajectories style approach. We apply this technique to a broad class of QSWs, and show that they can be simulated with minimal experimental resources. Our work opens the path towards the experimental realization of QSWs on large graphs with existing quantum technologies.

A graph-based evolutionary algorithm: Genetic Network Programming (GNP) and its extension using reinforcement learning.

PubMed

Mabu, Shingo; Hirasawa, Kotaro; Hu, Jinglu

2007-01-01

This paper proposes a graph-based evolutionary algorithm called Genetic Network Programming (GNP). Our goal is to develop GNP, which can deal with dynamic environments efficiently and effectively, based on the distinguished expression ability of the graph (network) structure. The characteristics of GNP are as follows. 1) GNP programs are composed of a number of nodes which execute simple judgment/processing, and these nodes are connected by directed links to each other. 2) The graph structure enables GNP to re-use nodes, thus the structure can be very compact. 3) The node transition of GNP is executed according to its node connections without any terminal nodes, thus the past history of the node transition affects the current node to be used and this characteristic works as an implicit memory function. These structural characteristics are useful for dealing with dynamic environments. Furthermore, we propose an extended algorithm, "GNP with Reinforcement Learning (GNPRL)" which combines evolution and reinforcement learning in order to create effective graph structures and obtain better results in dynamic environments. In this paper, we applied GNP to the problem of determining agents' behavior to evaluate its effectiveness. Tileworld was used as the simulation environment. The results show some advantages for GNP over conventional methods.

Decentralized Routing and Diameter Bounds in Entangled Quantum Networks

NASA Astrophysics Data System (ADS)

Gyongyosi, Laszlo; Imre, Sandor

2017-04-01

Entangled quantum networks are a necessity for any future quantum internet, long-distance quantum key distribution, and quantum repeater networks. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous, multi-level entangled network structure. The level of entanglement between the quantum nodes determines the hop distance, the number of spanned nodes, and the probability of the existence of an entangled link in the network. In this work we define a decentralized routing for entangled quantum networks. We show that the probability distribution of the entangled links can be modeled by a specific distribution in a base-graph. The results allow us to perform efficient routing to find the shortest paths in entangled quantum networks by using only local knowledge of the quantum nodes. We give bounds on the maximum value of the total number of entangled links of a path. The proposed scheme can be directly applied in practical quantum communications and quantum networking scenarios. This work was partially supported by the Hungarian Scientific Research Fund - OTKA K-112125.

Performing quantum computing experiments in the cloud

NASA Astrophysics Data System (ADS)

Devitt, Simon J.

2016-09-01

Quantum computing technology has reached a second renaissance in the past five years. Increased interest from both the private and public sector combined with extraordinary theoretical and experimental progress has solidified this technology as a major advancement in the 21st century. As anticipated my many, some of the first realizations of quantum computing technology has occured over the cloud, with users logging onto dedicated hardware over the classical internet. Recently, IBM has released the Quantum Experience, which allows users to access a five-qubit quantum processor. In this paper we take advantage of this online availability of actual quantum hardware and present four quantum information experiments. We utilize the IBM chip to realize protocols in quantum error correction, quantum arithmetic, quantum graph theory, and fault-tolerant quantum computation by accessing the device remotely through the cloud. While the results are subject to significant noise, the correct results are returned from the chip. This demonstrates the power of experimental groups opening up their technology to a wider audience and will hopefully allow for the next stage of development in quantum information technology.

Compact transmission system using single-sideband modulation of light for quantum cryptography.

PubMed

Duraffourg, L; Merolla, J M; Goedgebuer, J P; Mazurenko, Y; Rhodes, W T

2001-09-15

We report a new transmission that can be used for quantum key distribution. The system uses single-sideband-modulated light in an implementation of the BB84 quantum cryptography protocol. The system is formed by two integrated unbalanced Mach-Zehnder interferometers and is based on interference between phase-modulated sidebands in the spectral domain. Experiments show that high interference visibility can be obtained.

Continuous-variable quantum computing in optical time-frequency modes using quantum memories.

PubMed

Humphreys, Peter C; Kolthammer, W Steven; Nunn, Joshua; Barbieri, Marco; Datta, Animesh; Walmsley, Ian A

2014-09-26

We develop a scheme for time-frequency encoded continuous-variable cluster-state quantum computing using quantum memories. In particular, we propose a method to produce, manipulate, and measure two-dimensional cluster states in a single spatial mode by exploiting the intrinsic time-frequency selectivity of Raman quantum memories. Time-frequency encoding enables the scheme to be extremely compact, requiring a number of memories that are a linear function of only the number of different frequencies in which the computational state is encoded, independent of its temporal duration. We therefore show that quantum memories can be a powerful component for scalable photonic quantum information processing architectures.

Compact localized states and flat bands from local symmetry partitioning

NASA Astrophysics Data System (ADS)

Röntgen, M.; Morfonios, C. V.; Schmelcher, P.

2018-01-01

We propose a framework for the connection between local symmetries of discrete Hamiltonians and the design of compact localized states. Such compact localized states are used for the creation of tunable, local symmetry-induced bound states in an energy continuum and flat energy bands for periodically repeated local symmetries in one- and two-dimensional lattices. The framework is based on very recent theorems in graph theory which are here employed to obtain a block partitioning of the Hamiltonian induced by the symmetry of a given system under local site permutations. The diagonalization of the Hamiltonian is thereby reduced to finding the eigenspectra of smaller matrices, with eigenvectors automatically divided into compact localized and extended states. We distinguish between local symmetry operations which commute with the Hamiltonian, and those which do not commute due to an asymmetric coupling to the surrounding sites. While valuable as a computational tool for versatile discrete systems with locally symmetric structures, the approach provides in particular a unified, intuitive, and efficient route to the flexible design of compact localized states at desired energies.

The spectra of rectangular lattices of quantum waveguides

NASA Astrophysics Data System (ADS)

Nazarov, S. A.

2017-02-01

We obtain asymptotic formulae for the spectral segments of a thin (h\\ll 1) rectangular lattice of quantum waveguides which is described by a Dirichlet problem for the Laplacian. We establish that the structure of the spectrum of the lattice is incorrectly described by the commonly accepted quantum graph model with the traditional Kirchhoff conditions at the vertices. It turns out that the lengths of the spectral segments are infinitesimals of order O(e-δ/h), δ> 0, and O(h) as h\\to+0, and gaps of width O(h-2) and O(1) arise between them in the low- frequency and middle- frequency spectral ranges respectively. The first spectral segment is generated by the (unique) eigenvalue in the discrete spectrum of an infinite cross-shaped waveguide \\Theta. The absence of bounded solutions of the problem in \\Theta at the threshold frequency means that the correct model of the lattice is a graph with Dirichlet conditions at the vertices which splits into two infinite subsets of identical edges- intervals. By using perturbations of finitely many joints, we construct any given number of discrete spectrum points of the lattice below the essential spectrum as well as inside the gaps.

Kirchhoff's rule for quantum wires

NASA Astrophysics Data System (ADS)

Kostrykin, V.; Schrader, R.

1999-01-01

We formulate and discuss one-particle quantum scattering theory on an arbitrary finite graph with n open ends and where we define the Hamiltonian to be (minus) the Laplace operator with general boundary conditions at the vertices. This results in a scattering theory with n channels. The corresponding on-shell S-matrix formed by the reflection and transmission amplitudes for incoming plane waves of energy E>0 is given explicitly in terms of the boundary conditions and the lengths of the internal lines. It is shown to be unitary, which may be viewed as the quantum version of Kirchhoff's law. We exhibit covariance and symmetry properties. It is symmetric if the boundary conditions are real. Also there is a duality transformation on the set of boundary conditions and the lengths of the internal lines such that the low-energy behaviour of one theory gives the high-energy behaviour of the transformed theory. Finally, we provide a composition rule by which the on-shell S-matrix of a graph is factorizable in terms of the S-matrices of its subgraphs. All proofs use only known facts from the theory of self-adjoint extensions, standard linear algebra, complex function theory and elementary arguments from the theory of Hermitian symplectic forms.

The entropic boundary law in BF theory

NASA Astrophysics Data System (ADS)

Livine, Etera R.; Terno, Daniel R.

2009-01-01

We compute the entropy of a closed bounded region of space for pure 3d Riemannian gravity formulated as a topological BF theory for the gauge group SU(2) and show its holographic behavior. More precisely, we consider a fixed graph embedded in space and study the flat connection spin network state without and with particle-like topological defects. We regularize and compute exactly the entanglement for a bipartite splitting of the graph and show it scales at leading order with the number of vertices on the boundary (or equivalently with the number of loops crossing the boundary). More generally these results apply to BF theory with any compact gauge group in any space-time dimension.

Graph theory and the Virasoro master equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Obers, N.A.J.

1991-01-01

A brief history of affine Lie algebra, the Virasoro algebra and its culmination in the Virasoro master equation is given. By studying ansaetze of the master equation, the author obtains exact solutions and gains insight in the structure of large slices of affine-Virasoro space. He finds an isomorphism between the constructions in the ansatz SO(n){sub diag}, which is a set of unitary, generically irrational affine-Virasoro constructions on SO(n), and the unlabeled graphs of order n. On the one hand, the conformal constructions, are classified by the graphs, while, conversely, a group-theoretic and conformal field-theoretic identification is obtained for every graphmore » of graph theory. He also defines a class of magic Lie group bases in which the Virasoro master equation admits a simple metric ansatz {l brace}g{sub metric}{r brace}, whose structure is visible in the high-level expansion. When a magic basis is real on compact g, the corresponding g{sub metric} is a large system of unitary, generically irrational conformal field theories. Examples in this class include the graph-theory ansatz SO(n){sub diag} in the Cartesian basis of SO(n), and the ansatz SU(n){sub metric} in the Pauli-like basis of SU(n). Finally, he defines the sine-area graphs' of SU(n), which label the conformal field theories of SU(n){sub metric}, and he notes that, in similar fashion, each magic basis of g defines a generalized graph theory on g which labels the conformal field theories of g{sub metric}.« less

Enhanced Hole Mobility and Density in GaSb Quantum Wells

DTIC Science & Technology

2013-01-01

Keywords: Molecular beam epitaxy Quantum wells Semiconducting III–V materials Field-effect transistors GaSb a b s t r a c t Modulation-doped quantum wells...QWs) of GaSb clad by AlAsSb were grown by molecular beam epitaxy on InP substrates. By virtue of quantum confinement and compressive strain of the...heterostructures studied here are grown by molecular beam epitaxy (MBE) on semi-insulating (001) InP substrates using a Riber Compact 21T MBE system. A cross

Integrated heterodyne terahertz transceiver

DOEpatents

Wanke, Michael C [Albuquerque, NM; Lee, Mark [Albuquerque, NM; Nordquist, Christopher D [Albuquerque, NM; Cich, Michael J [Albuquerque, NM

2012-09-25

A heterodyne terahertz transceiver comprises a quantum cascade laser that is integrated on-chip with a Schottky diode mixer. A terahertz signal can be received by an antenna connected to the mixer, an end facet or sidewall of the laser, or through a separate active section that can amplify the incident signal. The quantum cascade laser couples terahertz local oscillator power to the Schottky diode to mix with the received terahertz signal to provide an intermediate frequency output signal. The fully integrated transceiver optimizes power efficiency, sensitivity, compactness, and reliability. The transceiver can be used in compact, fieldable systems covering a wide variety of deployable applications not possible with existing technology.

Computational studies of thermal and quantum phase transitions approached through non-equilibrium quenching

NASA Astrophysics Data System (ADS)

Liu, Cheng-Wei

Phase transitions and their associated critical phenomena are of fundamental importance and play a crucial role in the development of statistical physics for both classical and quantum systems. Phase transitions embody diverse aspects of physics and also have numerous applications outside physics, e.g., in chemistry, biology, and combinatorial optimization problems in computer science. Many problems can be reduced to a system consisting of a large number of interacting agents, which under some circumstances (e.g., changes of external parameters) exhibit collective behavior; this type of scenario also underlies phase transitions. The theoretical understanding of equilibrium phase transitions was put on a solid footing with the establishment of the renormalization group. In contrast, non-equilibrium phase transition are relatively less understood and currently a very active research topic. One important milestone here is the Kibble-Zurek (KZ) mechanism, which provides a useful framework for describing a system with a transition point approached through a non-equilibrium quench process. I developed two efficient Monte Carlo techniques for studying phase transitions, one is for classical phase transition and the other is for quantum phase transitions, both are under the framework of KZ scaling. For classical phase transition, I develop a non-equilibrium quench (NEQ) simulation that can completely avoid the critical slowing down problem. For quantum phase transitions, I develop a new algorithm, named quasi-adiabatic quantum Monte Carlo (QAQMC) algorithm for studying quantum quenches. I demonstrate the utility of QAQMC quantum Ising model and obtain high-precision results at the transition point, in particular showing generalized dynamic scaling in the quantum system. To further extend the methods, I study more complex systems such as spin-glasses and random graphs. The techniques allow us to investigate the problems efficiently. From the classical perspective, using the NEQ approach I verify the universality class of the 3D Ising spin-glasses. I also investigate the random 3-regular graphs in terms of both classical and quantum phase transitions. I demonstrate that under this simulation scheme, one can extract information associated with the classical and quantum spin-glass transitions without any knowledge prior to the simulation.

Deterministic Generation of All-Photonic Quantum Repeaters from Solid-State Emitters

NASA Astrophysics Data System (ADS)

Buterakos, Donovan; Barnes, Edwin; Economou, Sophia E.

2017-10-01

Quantum repeaters are nodes in a quantum communication network that allow reliable transmission of entanglement over large distances. It was recently shown that highly entangled photons in so-called graph states can be used for all-photonic quantum repeaters, which require substantially fewer resources compared to atomic-memory-based repeaters. However, standard approaches to building multiphoton entangled states through pairwise probabilistic entanglement generation severely limit the size of the state that can be created. Here, we present a protocol for the deterministic generation of large photonic repeater states using quantum emitters such as semiconductor quantum dots and defect centers in solids. We show that arbitrarily large repeater states can be generated using only one emitter coupled to a single qubit, potentially reducing the necessary number of photon sources by many orders of magnitude. Our protocol includes a built-in redundancy, which makes it resilient to photon loss.

The isentropic quantum drift-diffusion model in two or three space dimensions

NASA Astrophysics Data System (ADS)

Chen, Xiuqing

2009-05-01

We investigate the isentropic quantum drift-diffusion model, a fourth order parabolic system, in space dimensions d = 2, 3. First, we establish the global weak solutions with large initial value and periodic boundary conditions. Then we show the semiclassical limit by delicate interpolation estimates and compactness argument.

Material platforms for spin-based photonic quantum technologies

NASA Astrophysics Data System (ADS)

Atatüre, Mete; Englund, Dirk; Vamivakas, Nick; Lee, Sang-Yun; Wrachtrup, Joerg

2018-05-01

A central goal in quantum optics and quantum information science is the development of quantum networks to generate entanglement between distributed quantum memories. Experimental progress relies on the quality and efficiency of the light-matter quantum interface connecting the quantum states of photons to internal states of quantum emitters. Quantum emitters in solids, which have properties resembling those of atoms and ions, offer an opportunity for realizing light-matter quantum interfaces in scalable and compact hardware. These quantum emitters require a material platform that enables stable spin and optical properties, as well as a robust manufacturing of quantum photonic circuits. Because no emitter system is yet perfect and different applications may require different properties, several light-matter quantum interfaces are being developed in various platforms. This Review highlights the progress in three leading material platforms: diamond, silicon carbide and atomically thin semiconductors.

Multifractal analysis of multiparticle emission data in the framework of visibility graph and sandbox algorithm

NASA Astrophysics Data System (ADS)

Mali, P.; Manna, S. K.; Mukhopadhyay, A.; Haldar, P. K.; Singh, G.

2018-03-01

Multiparticle emission data in nucleus-nucleus collisions are studied in a graph theoretical approach. The sandbox algorithm used to analyze complex networks is employed to characterize the multifractal properties of the visibility graphs associated with the pseudorapidity distribution of charged particles produced in high-energy heavy-ion collisions. Experimental data on 28Si+Ag/Br interaction at laboratory energy Elab = 14 . 5 A GeV, and 16O+Ag/Br and 32S+Ag/Br interactions both at Elab = 200 A GeV, are used in this analysis. We observe a scale free nature of the degree distributions of the visibility and horizontal visibility graphs associated with the event-wise pseudorapidity distributions. Equivalent event samples simulated by ultra-relativistic quantum molecular dynamics, produce degree distributions that are almost identical to the respective experiment. However, the multifractal variables obtained by using sandbox algorithm for the experiment to some extent differ from the respective simulated results.

Continuous-time quantum walk on an extended star graph: Trapping and superradiance transition

NASA Astrophysics Data System (ADS)

Yalouz, Saad; Pouthier, Vincent

2018-02-01

A tight-binding model is introduced for describing the dynamics of an exciton on an extended star graph whose central node is occupied by a trap. On this graph, the exciton dynamics is governed by two kinds of eigenstates: many eigenstates are associated with degenerate real eigenvalues insensitive to the trap, whereas three decaying eigenstates characterized by complex energies contribute to the trapping process. It is shown that the excitonic population absorbed by the trap depends on the size of the graph, only. By contrast, both the size parameters and the absorption rate control the dynamics of the trapping. When these parameters are judiciously chosen, the efficiency of the transfer is optimized resulting in the minimization of the absorption time. Analysis of the eigenstates reveals that such a feature arises around the superradiance transition. Moreover, depending on the size of the network, two situations are highlighted where the transport efficiency is either superoptimized or suboptimized.

Modular architectures for quantum networks

NASA Astrophysics Data System (ADS)

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.

The Full Ward-Takahashi Identity for Colored Tensor Models

NASA Astrophysics Data System (ADS)

Pérez-Sánchez, Carlos I.

2018-03-01

Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank- D interactions including, but not restricted to, all melonic φ^4 -vertices—to wit, solely those quartic vertices that can lead to dominant spherical contributions in the large- N expansion—the aforementioned boundary graphs are shown to be precisely all (possibly disconnected) vertex-bipartite regularly edge- D-colored graphs. The concept of CTM-compatible boundary-graph automorphism is introduced and an auxiliary graph calculus is developed. With the aid of these constructs, certain U (∞)-invariance of the path integral measure is fully exploited in order to derive a strong Ward-Takahashi Identity for CTMs with a symmetry-breaking kinetic term. For the rank-3 φ^4 -theory, we get the exact integral-like equation for the 2-point function. Similarly, exact equations for higher multipoint functions can be readily obtained departing from this full Ward-Takahashi identity. Our results hold for some Group Field Theories as well. Altogether, our non-perturbative approach trades some graph theoretical methods for analytical ones. We believe that these tools can be extended to tensorial SYK-models.

Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds

DOE Office of Scientific and Technical Information (OSTI.GOV)

Guth, Larry, E-mail: lguth@math.mit.edu; Lubotzky, Alexander, E-mail: alex.lubotzky@mail.huji.ac.il

2014-08-15

Using 4-dimensional arithmetic hyperbolic manifolds, we construct some new homological quantum error correcting codes. They are low density parity check codes with linear rate and distance n{sup ε}. Their rate is evaluated via Euler characteristic arguments and their distance using Z{sub 2}-systolic geometry. This construction answers a question of Zémor [“On Cayley graphs, surface codes, and the limits of homological coding for quantum error correction,” in Proceedings of Second International Workshop on Coding and Cryptology (IWCC), Lecture Notes in Computer Science Vol. 5557 (2009), pp. 259–273], who asked whether homological codes with such parameters could exist at all.

Numbers and functions in quantum field theory

NASA Astrophysics Data System (ADS)

Schnetz, Oliver

2018-04-01

We review recent results in the theory of numbers and single-valued functions on the complex plane which arise in quantum field theory. These results are the basis for a new approach to high-loop-order calculations. As concrete examples, we provide scheme-independent counterterms of primitive log-divergent graphs in ϕ4 theory up to eight loops and the renormalization functions β , γ , γm of dimensionally regularized ϕ4 theory in the minimal subtraction scheme up to seven loops.

Oriented matroids—combinatorial structures underlying loop quantum gravity

NASA Astrophysics Data System (ADS)

Brunnemann, Johannes; Rideout, David

2010-10-01

We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator (Ashtekar A and Lewandowski J 1998 Adv. Theor. Math. Phys. 1 388) in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence vertices of a graph in three-dimensional Riemannian space and can be represented by sign strings containing relative orientations of embedded edges. We demonstrate that these signature factors are a special representation of the general mathematical concept of an oriented matroid (Ziegler G M 1998 Electron. J. Comb.; Björner A et al 1999 Oriented Matroids (Cambridge: Cambridge University Press)). Moreover, we show that oriented matroids can also be used to describe the topology (connectedness) of directed graphs. Hence, the mathematical methods developed for oriented matroids can be applied to the difficult combinatorics of embedded graphs underlying the construction of LQG. As a first application we revisit the analysis of Brunnemann and Rideout (2008 Class. Quantum Grav. 25 065001 and 065002), and find that enumeration of all possible sign configurations used there is equivalent to enumerating all realizable oriented matroids of rank 3 (Ziegler G M 1998 Electron. J. Comb.; Björner A et al 1999 Oriented Matroids (Cambridge: Cambridge University Press)), and thus can be greatly simplified. We find that for 7-valent vertices having no coplanar triples of edge tangents, the smallest non-zero eigenvalue of the volume spectrum does not grow as one increases the maximum spin jmax at the vertex, for any orientation of the edge tangents. This indicates that, in contrast to the area operator, considering large jmax does not necessarily imply large volume eigenvalues. In addition we give an outlook to possible starting points for rewriting the combinatorics of LQG in terms of oriented matroids.

Tunable Microcavity-Stabilized Quantum Cascade Laser for Mid-IR High-Resolution Spectroscopy and Sensing.

PubMed

Borri, Simone; Siciliani de Cumis, Mario; Insero, Giacomo; Bartalini, Saverio; Cancio Pastor, Pablo; Mazzotti, Davide; Galli, Iacopo; Giusfredi, Giovanni; Santambrogio, Gabriele; Savchenkov, Anatoliy; Eliyahu, Danny; Ilchenko, Vladimir; Akikusa, Naota; Matsko, Andrey; Maleki, Lute; De Natale, Paolo

2016-02-17

The need for highly performing and stable methods for mid-IR molecular sensing and metrology pushes towards the development of more and more compact and robust systems. Among the innovative solutions aimed at answering the need for stable mid-IR references are crystalline microresonators, which have recently shown excellent capabilities for frequency stabilization and linewidth narrowing of quantum cascade lasers with compact setups. In this work, we report on the first system for mid-IR high-resolution spectroscopy based on a quantum cascade laser locked to a CaF₂ microresonator. Electronic locking narrows the laser linewidth by one order of magnitude and guarantees good stability over long timescales, allowing, at the same time, an easy way for finely tuning the laser frequency over the molecular absorption line. Improvements in terms of resolution and frequency stability of the source are demonstrated by direct sub-Doppler recording of a molecular line.

Active mode locking of quantum cascade lasers in an external ring cavity.

PubMed

Revin, D G; Hemingway, M; Wang, Y; Cockburn, J W; Belyanin, A

2016-05-05

Stable ultrashort light pulses and frequency combs generated by mode-locked lasers have many important applications including high-resolution spectroscopy, fast chemical detection and identification, studies of ultrafast processes, and laser metrology. While compact mode-locked lasers emitting in the visible and near infrared range have revolutionized photonic technologies, the systems operating in the mid-infrared range where most gases have their strong absorption lines, are bulky and expensive and rely on nonlinear frequency down-conversion. Quantum cascade lasers are the most powerful and versatile compact light sources in the mid-infrared range, yet achieving their mode-locked operation remains a challenge, despite dedicated effort. Here we report the demonstration of active mode locking of an external-cavity quantum cascade laser. The laser operates in the mode-locked regime at room temperature and over the full dynamic range of injection currents.

Active mode locking of quantum cascade lasers in an external ring cavity

PubMed Central

Revin, D. G.; Hemingway, M.; Wang, Y.; Cockburn, J. W.; Belyanin, A.

2016-01-01

Stable ultrashort light pulses and frequency combs generated by mode-locked lasers have many important applications including high-resolution spectroscopy, fast chemical detection and identification, studies of ultrafast processes, and laser metrology. While compact mode-locked lasers emitting in the visible and near infrared range have revolutionized photonic technologies, the systems operating in the mid-infrared range where most gases have their strong absorption lines, are bulky and expensive and rely on nonlinear frequency down-conversion. Quantum cascade lasers are the most powerful and versatile compact light sources in the mid-infrared range, yet achieving their mode-locked operation remains a challenge, despite dedicated effort. Here we report the demonstration of active mode locking of an external-cavity quantum cascade laser. The laser operates in the mode-locked regime at room temperature and over the full dynamic range of injection currents. PMID:27147409

Toward a compact fibered squeezing parametric source.

PubMed

Brieussel, Alexandre; Ott, Konstantin; Joos, Maxime; Treps, Nicolas; Fabre, Claude

2018-03-15

In this work, we investigate three different compact fibered systems generating vacuum squeezing that involve optical cavities limited by the end surface of a fiber and by a curved mirror and containing a thin parametric crystal. These systems have the advantage to couple squeezed states directly to a fiber, allowing the user to benefit from the flexibility of fibers in the use of squeezing. Three types of fibers are investigated: standard single-mode fibers, photonic-crystal large-mode-area single-mode fibers, and short multimode fibers taped to a single-mode fiber. The observed squeezing is modest (-0.56  dB, -0.9  dB, -1  dB), but these experiments open the way for miniaturized squeezing devices that could be a very interesting advantage in scaling up quantum systems for quantum processing, opening new perspectives in the domain of integrated quantum optics.

Tunable Microcavity-Stabilized Quantum Cascade Laser for Mid-IR High-Resolution Spectroscopy and Sensing

PubMed Central

Borri, Simone; Siciliani de Cumis, Mario; Insero, Giacomo; Bartalini, Saverio; Cancio Pastor, Pablo; Mazzotti, Davide; Galli, Iacopo; Giusfredi, Giovanni; Santambrogio, Gabriele; Savchenkov, Anatoliy; Eliyahu, Danny; Ilchenko, Vladimir; Akikusa, Naota; Matsko, Andrey; Maleki, Lute; De Natale, Paolo

2016-01-01

The need for highly performing and stable methods for mid-IR molecular sensing and metrology pushes towards the development of more and more compact and robust systems. Among the innovative solutions aimed at answering the need for stable mid-IR references are crystalline microresonators, which have recently shown excellent capabilities for frequency stabilization and linewidth narrowing of quantum cascade lasers with compact setups. In this work, we report on the first system for mid-IR high-resolution spectroscopy based on a quantum cascade laser locked to a CaF2 microresonator. Electronic locking narrows the laser linewidth by one order of magnitude and guarantees good stability over long timescales, allowing, at the same time, an easy way for finely tuning the laser frequency over the molecular absorption line. Improvements in terms of resolution and frequency stability of the source are demonstrated by direct sub-Doppler recording of a molecular line. PMID:26901199

Magic bases, metric ansaetze and generalized graph theories in the Virasoro master equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Halpern, M.B.; Obers, N.A.

1991-11-15

The authors define a class of magic Lie group bases in which the Virasoro master equation admits a class of simple metric ansaetze (g{sub metric}), whose structure is visible in the high-level expansion. When a magic basis is real on compact g, the corresponding g{sub metric} is a large system of unitary, generically irrational conformal field theories. Examples in this class include the graph-theory ansatz SO(n){sub diag} in the Cartesian basis of So(n) and the ansatz SU(n){sub metric} in the Pauli-like basis of SU(n). A new phenomenon is observed in the high-level comparison of SU(n){sub metric}: Due to the trigonometricmore » structure constants of the Pauli-like basis, irrational central charge is clearly visible at finite order of the expansion. They also define the sine-area graphs of SU(n), which label the conformal field theories of SU(n){sub metric} and note that, in a similar fashion, each magic basis of g defines a generalize graph theory on g which labels the conformal field theories of g{sub metric}.« less

Graph analysis of functional brain networks: practical issues in translational neuroscience

PubMed Central

De Vico Fallani, Fabrizio; Richiardi, Jonas; Chavez, Mario; Achard, Sophie

2014-01-01

The brain can be regarded as a network: a connected system where nodes, or units, represent different specialized regions and links, or connections, represent communication pathways. From a functional perspective, communication is coded by temporal dependence between the activities of different brain areas. In the last decade, the abstract representation of the brain as a graph has allowed to visualize functional brain networks and describe their non-trivial topological properties in a compact and objective way. Nowadays, the use of graph analysis in translational neuroscience has become essential to quantify brain dysfunctions in terms of aberrant reconfiguration of functional brain networks. Despite its evident impact, graph analysis of functional brain networks is not a simple toolbox that can be blindly applied to brain signals. On the one hand, it requires the know-how of all the methodological steps of the pipeline that manipulate the input brain signals and extract the functional network properties. On the other hand, knowledge of the neural phenomenon under study is required to perform physiologically relevant analysis. The aim of this review is to provide practical indications to make sense of brain network analysis and contrast counterproductive attitudes. PMID:25180301

Quantum Markov chains

NASA Astrophysics Data System (ADS)

Gudder, Stanley

2008-07-01

A new approach to quantum Markov chains is presented. We first define a transition operation matrix (TOM) as a matrix whose entries are completely positive maps whose column sums form a quantum operation. A quantum Markov chain is defined to be a pair (G,E) where G is a directed graph and E =[Eij] is a TOM whose entry Eij labels the edge from vertex j to vertex i. We think of the vertices of G as sites that a quantum system can occupy and Eij is the transition operation from site j to site i in one time step. The discrete dynamics of the system is obtained by iterating the TOM E. We next consider a special type of TOM called a transition effect matrix. In this case, there are two types of dynamics, a state dynamics and an operator dynamics. Although these two types are not identical, they are statistically equivalent. We next give examples that illustrate various properties of quantum Markov chains. We conclude by showing that our formalism generalizes the usual framework for quantum random walks.

Quantum Well Intrasubband Photodetector for Far Infared and Terahertz Radiation Detection

NASA Technical Reports Server (NTRS)

Ting, David Z. -Y.; Chang, Yia-Chung; Bandara, Sumith V.; Gunapala, Sarath D.

2007-01-01

The authors present a theoretical analysis on the possibility of using the dopant-assisted intrasubband absorption mechanism in quantum wells for normal-incidence far infrared/terahertz radiation detection. The authors describe the proposed concept of the quantum well intrasubband photodetector (QWISP), which is a compact semiconductor heterostructure device compatible with existing GaAs focal-plane array technology, and present theoretical results demonstrating strong normal-incidence absorption and responsivity in the QWISP.

Irreconcilable difference between quantum walks and adiabatic quantum computing

NASA Astrophysics Data System (ADS)

Wong, Thomas G.; Meyer, David A.

2016-06-01

Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schrödinger's equation. In the former, the Hamiltonian is fixed, while in the latter, the Hamiltonian varies with time. As a result, their formulations of Grover's algorithm evolve differently through Hilbert space. We show that this difference is fundamental; they cannot be made to evolve along each other's path without introducing structure more powerful than the standard oracle for unstructured search. For an adiabatic quantum evolution to evolve like the quantum walk search algorithm, it must interpolate between three fixed Hamiltonians, one of which is complex and introduces structure that is stronger than the oracle for unstructured search. Conversely, for a quantum walk to evolve along the path of the adiabatic search algorithm, it must be a chiral quantum walk on a weighted, directed star graph with structure that is also stronger than the oracle for unstructured search. Thus, the two techniques, although similar in being described by Hamiltonians that govern their evolution, compute by fundamentally irreconcilable means.

Compactness Aromaticity of Atoms in Molecules

PubMed Central

Putz, Mihai V.

2010-01-01

A new aromaticity definition is advanced as the compactness formulation through the ratio between atoms-in-molecule and orbital molecular facets of the same chemical reactivity property around the pre- and post-bonding stabilization limit, respectively. Geometrical reactivity index of polarizability was assumed as providing the benchmark aromaticity scale, since due to its observable character; with this occasion new Hydrogenic polarizability quantum formula that recovers the exact value of 4.5 a03 for Hydrogen is provided, where a0 is the Bohr radius; a polarizability based–aromaticity scale enables the introduction of five referential aromatic rules (Aroma 1 to 5 Rules). With the help of these aromatic rules, the aromaticity scales based on energetic reactivity indices of electronegativity and chemical hardness were computed and analyzed within the major semi-empirical and ab initio quantum chemical methods. Results show that chemical hardness based-aromaticity is in better agreement with polarizability based-aromaticity than the electronegativity-based aromaticity scale, while the most favorable computational environment appears to be the quantum semi-empirical for the first and quantum ab initio for the last of them, respectively. PMID:20480020

Graph-based segmentation for RGB-D data using 3-D geometry enhanced superpixels.

PubMed

Yang, Jingyu; Gan, Ziqiao; Li, Kun; Hou, Chunping

2015-05-01

With the advances of depth sensing technologies, color image plus depth information (referred to as RGB-D data hereafter) is more and more popular for comprehensive description of 3-D scenes. This paper proposes a two-stage segmentation method for RGB-D data: 1) oversegmentation by 3-D geometry enhanced superpixels and 2) graph-based merging with label cost from superpixels. In the oversegmentation stage, 3-D geometrical information is reconstructed from the depth map. Then, a K-means-like clustering method is applied to the RGB-D data for oversegmentation using an 8-D distance metric constructed from both color and 3-D geometrical information. In the merging stage, treating each superpixel as a node, a graph-based model is set up to relabel the superpixels into semantically-coherent segments. In the graph-based model, RGB-D proximity, texture similarity, and boundary continuity are incorporated into the smoothness term to exploit the correlations of neighboring superpixels. To obtain a compact labeling, the label term is designed to penalize labels linking to similar superpixels that likely belong to the same object. Both the proposed 3-D geometry enhanced superpixel clustering method and the graph-based merging method from superpixels are evaluated by qualitative and quantitative results. By the fusion of color and depth information, the proposed method achieves superior segmentation performance over several state-of-the-art algorithms.

Black holes as quantum gravity condensates

NASA Astrophysics Data System (ADS)

Oriti, Daniele; Pranzetti, Daniele; Sindoni, Lorenzo

2018-03-01

We model spherically symmetric black holes within the group field theory formalism for quantum gravity via generalized condensate states, involving sums over arbitrarily refined graphs (dual to three-dimensional triangulations). The construction relies heavily on both the combinatorial tools of random tensor models and the quantum geometric data of loop quantum gravity, both part of the group field theory formalism. Armed with the detailed microscopic structure, we compute the entropy associated with the black hole horizon, which turns out to be equivalently the Boltzmann entropy of its microscopic degrees of freedom and the entanglement entropy between the inside and outside regions. We recover the area law under very general conditions, as well as the Bekenstein-Hawking formula. The result is also shown to be generically independent of any specific value of the Immirzi parameter.

Qudit hypergraph states and their properties

NASA Astrophysics Data System (ADS)

Xiong, Fei-Lei; Zhen, Yi-Zheng; Cao, Wen-Fei; Chen, Kai; Chen, Zeng-Bing

2018-01-01

Hypergraph states, a generalization of graph states, constitute a large class of quantum states with intriguing nonlocal properties, and they have promising applications in quantum information science and technology. In this paper, we study some features of an independently proposed generalization of hypergraph states to qudit hypergraph states, i.e., each vertex in the generalized hypergraph (multi-hypergraph) represents a d -level system instead of a two-level one. It is shown that multi-hypergraphs and d -level hypergraph states have a one-to-one correspondence, and the structure of a multi-hypergraph exhibits the entanglement property of the corresponding quantum state. We discuss their relationship with some well-known state classes, e.g., real equally weighted states and stabilizer states. The Bell nonlocality, an important resource in fulfilling many quantum information tasks, is also investigated.

High Productivity Computing Systems Analysis and Performance

DTIC Science & Technology

2005-07-01

cubic grid Discrete Math Global Updates per second (GUP/S) RandomAccess Paper & Pencil Contact Bob Lucas (ISI) Multiple Precision none...can be found at the web site. One of the HPCchallenge codes, RandomAccess, is derived from the HPCS discrete math benchmarks that we released, and...Kernels Discrete Math … Graph Analysis … Linear Solvers … Signal Processi ng Execution Bounds Execution Indicators 6 Scalable Compact

Photonic multipartite entanglement conversion using nonlocal operations

NASA Astrophysics Data System (ADS)

Tashima, T.; Tame, M. S.; Özdemir, Ş. K.; Nori, F.; Koashi, M.; Weinfurter, H.

2016-11-01

We propose a simple setup for the conversion of multipartite entangled states in a quantum network with restricted access. The scheme uses nonlocal operations to enable the preparation of states that are inequivalent under local operations and classical communication, but most importantly does not require full access to the states. It is based on a flexible linear optical conversion gate that uses photons, which are ideally suited for distributed quantum computation and quantum communication in extended networks. In order to show the basic working principles of the gate, we focus on converting a four-qubit entangled cluster state to other locally inequivalent four-qubit states, such as the Greenberger-Horne-Zeilinger and symmetric Dicke states. We also show how the gate can be incorporated into extended graph state networks and can be used to generate variable entanglement and quantum correlations without entanglement but nonvanishing quantum discord.

QSPIN: A High Level Java API for Quantum Computing Experimentation

NASA Technical Reports Server (NTRS)

Barth, Tim

2017-01-01

QSPIN is a high level Java language API for experimentation in QC models used in the calculation of Ising spin glass ground states and related quadratic unconstrained binary optimization (QUBO) problems. The Java API is intended to facilitate research in advanced QC algorithms such as hybrid quantum-classical solvers, automatic selection of constraint and optimization parameters, and techniques for the correction and mitigation of model and solution errors. QSPIN includes high level solver objects tailored to the D-Wave quantum annealing architecture that implement hybrid quantum-classical algorithms [Booth et al.] for solving large problems on small quantum devices, elimination of variables via roof duality, and classical computing optimization methods such as GPU accelerated simulated annealing and tabu search for comparison. A test suite of documented NP-complete applications ranging from graph coloring, covering, and partitioning to integer programming and scheduling are provided to demonstrate current capabilities.

Dynamical modeling and analysis of large cellular regulatory networks

NASA Astrophysics Data System (ADS)

Bérenguier, D.; Chaouiya, C.; Monteiro, P. T.; Naldi, A.; Remy, E.; Thieffry, D.; Tichit, L.

2013-06-01

The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.

Mixing times in quantum walks on two-dimensional grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Marquezino, F. L.; Portugal, R.; Abal, G.

2010-10-15

Mixing properties of discrete-time quantum walks on two-dimensional grids with toruslike boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution operator for this particular graph. The limiting distribution and mixing time of a quantum walk with a coin operator modified as in the abstract search algorithm are obtained numerically. On the basis of these results, the relation between the mixing time of the modified walk and themore » running time of the corresponding abstract search algorithm is discussed.« less

Mixing times in quantum walks on two-dimensional grids

NASA Astrophysics Data System (ADS)

Marquezino, F. L.; Portugal, R.; Abal, G.

2010-10-01

Mixing properties of discrete-time quantum walks on two-dimensional grids with toruslike boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution operator for this particular graph. The limiting distribution and mixing time of a quantum walk with a coin operator modified as in the abstract search algorithm are obtained numerically. On the basis of these results, the relation between the mixing time of the modified walk and the running time of the corresponding abstract search algorithm is discussed.

A compact, continuous-wave terahertz source based on a quantum-cascade laser and a miniature cryocooler.

PubMed

Richter, H; Greiner-Bär, M; Pavlov, S G; Semenov, A D; Wienold, M; Schrottke, L; Giehler, M; Hey, R; Grahn, H T; Hübers, H-W

2010-05-10

We report on the development of a compact, easy-to-use terahertz radiation source, which combines a quantum-cascade laser (QCL) operating at 3.1 THz with a compact, low-input-power Stirling cooler. The QCL, which is based on a two-miniband design, has been developed for high output and low electrical pump power. The amount of generated heat complies with the nominal cooling capacity of the Stirling cooler of 7 W at 65 K with 240 W of electrical input power. Special care has been taken to achieve a good thermal coupling between the QCL and the cold finger of the cooler. The whole system weighs less than 15 kg including the cooler and power supplies. The maximum output power is 8 mW at 3.1 THz. With an appropriate optical beam shaping, the emission profile of the laser is fundamental Gaussian. The applicability of the system is demonstrated by imaging and molecular-spectroscopy experiments. (c) 2010 Optical Society of America.

A Comparison of Approaches for Solving Hard Graph-Theoretic Problems

DTIC Science & Technology

2015-04-29

can be converted to a quadratic unconstrained binary optimization ( QUBO ) problem that uses 0/1-valued variables, and so they are often used...Frontiers in Physics, 2:5 (12 Feb 2014). [7] “Programming with QUBOs ,” (instructional document) D-Wave: The Quantum Computing Company, 2013. [8

Quantum Dot Surface Engineering: Toward Inert Fluorophores with Compact Size and Bright, Stable Emission

PubMed Central

Lim, Sung Jun; Ma, Liang; Schleife, André; Smith, Andrew M.

2016-01-01

The surfaces of colloidal nanocrystals are complex interfaces between solid crystals, coordinating ligands, and liquid solutions. For fluorescent quantum dots, the properties of the surface vastly influence the efficiency of light emission, stability, and physical interactions, and thus determine their sensitivity and specificity when they are used to detect and image biological molecules. But after more than 30 years of study, the surfaces of quantum dots remain poorly understood and continue to be an important subject of both experimental and theoretical research. In this article, we review the physics and chemistry of quantum dot surfaces and describe approaches to engineer optimal fluorescent probes for applications in biomolecular imaging and sensing. We describe the structure and electronic properties of crystalline facets, the chemistry of ligand coordination, and the impact of ligands on optical properties. We further describe recent advances in compact coatings that have significantly improved their properties by providing small hydrodynamic size, high stability and fluorescence efficiency, and minimal nonspecific interactions with cells and biological molecules. While major progress has been made in both basic and applied research, many questions remain in the chemistry and physics of quantum dot surfaces that have hindered key breakthroughs to fully optimize their properties. PMID:28344357

Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Mantri, Atul; Demarie, Tommaso F.; Menicucci, Nicolas C.; Fitzsimons, Joseph F.

2017-07-01

Blind quantum computation protocols allow a user to delegate a computation to a remote quantum computer in such a way that the privacy of their computation is preserved, even from the device implementing the computation. To date, such protocols are only known for settings involving at least two quantum devices: either a user with some quantum capabilities and a remote quantum server or two or more entangled but noncommunicating servers. In this work, we take the first step towards the construction of a blind quantum computing protocol with a completely classical client and single quantum server. Specifically, we show how a classical client can exploit the ambiguity in the flow of information in measurement-based quantum computing to construct a protocol for hiding critical aspects of a computation delegated to a remote quantum computer. This ambiguity arises due to the fact that, for a fixed graph, there exist multiple choices of the input and output vertex sets that result in deterministic measurement patterns consistent with the same fixed total ordering of vertices. This allows a classical user, computing only measurement angles, to drive a measurement-based computation performed on a remote device while hiding critical aspects of the computation.

Computational quantum-classical boundary of noisy commuting quantum circuits

PubMed Central

Fujii, Keisuke; Tamate, Shuhei

2016-01-01

It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region. PMID:27189039

Computational quantum-classical boundary of noisy commuting quantum circuits.

PubMed

Fujii, Keisuke; Tamate, Shuhei

2016-05-18

It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region.

Computational quantum-classical boundary of noisy commuting quantum circuits

NASA Astrophysics Data System (ADS)

Fujii, Keisuke; Tamate, Shuhei

2016-05-01

It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region.

Bounded solutions in a T-shaped waveguide and the spectral properties of the Dirichlet ladder

NASA Astrophysics Data System (ADS)

Nazarov, S. A.

2014-08-01

The Dirichlet problem is considered on the junction of thin quantum waveguides (of thickness h ≪ 1) in the shape of an infinite two-dimensional ladder. Passage to the limit as h → +0 is discussed. It is shown that the asymptotically correct transmission conditions at nodes of the corresponding one-dimensional quantum graph are Dirichlet conditions rather than the conventional Kirchhoff transmission conditions. The result is obtained by analyzing bounded solutions of a problem in the T-shaped waveguide that the boundary layer phenomenon.

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

NASA Astrophysics Data System (ADS)

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.

Computationally Efficient Nonlinear Bell Inequalities for Quantum Networks

NASA Astrophysics Data System (ADS)

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.

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

PubMed

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.

Boosting quantum annealer performance via sample persistence

NASA Astrophysics Data System (ADS)

Karimi, Hamed; Rosenberg, Gili

2017-07-01

We propose a novel method for reducing the number of variables in quadratic unconstrained binary optimization problems, using a quantum annealer (or any sampler) to fix the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are usually much easier for the quantum annealer to solve, due to their being smaller and consisting of disconnected components. This approach significantly increases the success rate and number of observations of the best known energy value in samples obtained from the quantum annealer, when compared with calling the quantum annealer without using it, even when using fewer annealing cycles. Use of the method results in a considerable improvement in success metrics even for problems with high-precision couplers and biases, which are more challenging for the quantum annealer to solve. The results are further enhanced by applying the method iteratively and combining it with classical pre-processing. We present results for both Chimera graph-structured problems and embedded problems from a real-world application.

The geometry of on-shell diagrams

NASA Astrophysics Data System (ADS)

Franco, Sebastián; Galloni, Daniele; Mariotti, Alberto

2014-08-01

The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such as the Grassmannian. We perform a detailed investigation of the combinatorial and geometric objects associated to these graphs. We mainly focus on their relation to polytopes and toric geometry, the Grassmannian and its stratification. Our work extends the current understanding of these connections along several important fronts, most notably eliminating restrictions imposed by planarity, positivity, reducibility and edge removability. We illustrate our ideas with several explicit examples and introduce concrete methods that considerably simplify computations. We consider it highly likely that the structures unveiled in this article will arise in the on-shell study of scattering amplitudes beyond the planar limit. Our results can be conversely regarded as an expansion in the understanding of the Grassmannian in terms of bipartite graphs.

A novel conductivity mechanism of highly disordered carbon systems based on an investigation of graph zeta function

NASA Astrophysics Data System (ADS)

Matsutani, Shigeki; Sato, Iwao

2017-09-01

In the previous report (Matsutani and Suzuki, 2000 [21]), by proposing the mechanism under which electric conductivity is caused by the activational hopping conduction with the Wigner surmise of the level statistics, the temperature-dependent of electronic conductivity of a highly disordered carbon system was evaluated including apparent metal-insulator transition. Since the system consists of small pieces of graphite, it was assumed that the reason why the level statistics appears is due to the behavior of the quantum chaos in each granular graphite. In this article, we revise the assumption and show another origin of the Wigner surmise, which is more natural for the carbon system based on a recent investigation of graph zeta function in graph theory. Our method can be applied to the statistical treatment of the electronic properties of the randomized molecular system in general.

Melonic Phase Transition in Group Field Theory

NASA Astrophysics Data System (ADS)

Baratin, Aristide; Carrozza, Sylvain; Oriti, Daniele; Ryan, James; Smerlak, Matteo

2014-08-01

Group field theories have recently been shown to admit a 1/N expansion dominated by so-called `melonic graphs', dual to triangulated spheres. In this note, we deepen the analysis of this melonic sector. We obtain a combinatorial formula for the melonic amplitudes in terms of a graph polynomial related to a higher-dimensional generalization of the Kirchhoff tree-matrix theorem. Simple bounds on these amplitudes show the existence of a phase transition driven by melonic interaction processes. We restrict our study to the Boulatov-Ooguri models, which describe topological BF theories and are the basis for the construction of 4-dimensional models of quantum gravity.

Parametric number covariance in quantum chaotic spectra.

PubMed

Vinayak; Kumar, Sandeep; Pandey, Akhilesh

2016-03-01

We study spectral parametric correlations in quantum chaotic systems and introduce the number covariance as a measure of such correlations. We derive analytic results for the classical random matrix ensembles using the binary correlation method and obtain compact expressions for the covariance. We illustrate the universality of this measure by presenting the spectral analysis of the quantum kicked rotors for the time-reversal invariant and time-reversal noninvariant cases. A local version of the parametric number variance introduced earlier is also investigated.

Single frequency free-running low noise compact extended-cavity semiconductor laser at high power level

NASA Astrophysics Data System (ADS)

Garnache, Arnaud; Myara, Mikhaël.; Laurain, A.; Bouchier, Aude; Perez, J. P.; Signoret, P.; Sagnes, I.; Romanini, D.

2017-11-01

We present a highly coherent semiconductor laser device formed by a ½-VCSEL structure and an external concave mirror in a millimetre high finesse stable cavity. The quantum well structure is diode-pumped by a commercial single mode GaAs laser diode system. This free running low noise tunable single-frequency laser exhibits >50mW output power in a low divergent circular TEM00 beam with a spectral linewidth below 1kHz and a relative intensity noise close to the quantum limit. This approach ensures, with a compact design, homogeneous gain behaviour and a sufficiently long photon lifetime to reach the oscillation-relaxation-free class-A regime, with a cut off frequency around 10MHz.

Low cost and compact quantum key distribution

NASA Astrophysics Data System (ADS)

Duligall, J. L.; Godfrey, M. S.; Harrison, K. A.; Munro, W. J.; Rarity, J. G.

2006-10-01

We present the design of a novel free-space quantum cryptography system, complete with purpose-built software, that can operate in daylight conditions. The transmitter and receiver modules are built using inexpensive off-the-shelf components. Both modules are compact allowing the generation of renewed shared secrets on demand over a short range of a few metres. An analysis of the software is shown as well as results of error rates and therefore shared secret yields at varying background light levels. As the system is designed to eventually work in short-range consumer applications, we also present a use scenario where the consumer can regularly 'top up' a store of secrets for use in a variety of one-time-pad (OTP) and authentication protocols.

When quantum optics meets topology

NASA Astrophysics Data System (ADS)

Amo, Alberto

2018-02-01

Routing photons at the micrometer scale remains one of the greatest challenges of integrated quantum optics. The main difficulty is the scattering losses at bends and splitters in the photonic circuit. Current approaches imply elaborate designs, quite sensitive to fabrication details (1). Inspired by the physics underlying the one-way transport of electrons in topological insulators, on page 666 of this issue, Barik et al. (2) report a topological photonic crystal in which single photons are emitted and routed through bends with negligible loss. The marriage between quantum optics and topology promises new opportunities for compact quantum optics gating and manipulation.

Product-State Approximations to Quantum States

NASA Astrophysics Data System (ADS)

Brandão, Fernando G. S. L.; Harrow, Aram W.

2016-02-01

We show that for any many-body quantum state there exists an unentangled quantum state such that most of the two-body reduced density matrices are close to those of the original state. This is a statement about the monogamy of entanglement, which cannot be shared without limit in the same way as classical correlation. Our main application is to Hamiltonians that are sums of two-body terms. For such Hamiltonians we show that there exist product states with energy that is close to the ground-state energy whenever the interaction graph of the Hamiltonian has high degree. This proves the validity of mean-field theory and gives an explicitly bounded approximation error. If we allow states that are entangled within small clusters of systems but product across clusters then good approximations exist when the Hamiltonian satisfies one or more of the following properties: (1) high degree, (2) small expansion, or (3) a ground state where the blocks in the partition have sublinear entanglement. Previously this was known only in the case of small expansion or in the regime where the entanglement was close to zero. Our approximations allow an extensive error in energy, which is the scale considered by the quantum PCP (probabilistically checkable proof) and NLTS (no low-energy trivial-state) conjectures. Thus our results put restrictions on the possible Hamiltonians that could be used for a possible proof of the qPCP or NLTS conjectures. By contrast the classical PCP constructions are often based on constraint graphs with high degree. Likewise we show that the parallel repetition that is possible with classical constraint satisfaction problems cannot also be possible for quantum Hamiltonians, unless qPCP is false. The main technical tool behind our results is a collection of new classical and quantum de Finetti theorems which do not make any symmetry assumptions on the underlying states.

Coevolution of Glauber-like Ising dynamics and topology

NASA Astrophysics Data System (ADS)

Mandrà, Salvatore; Fortunato, Santo; Castellano, Claudio

2009-11-01

We study the coevolution of a generalized Glauber dynamics for Ising spins with tunable threshold and of the graph topology where the dynamics takes place. This simple coevolution dynamics generates a rich phase diagram in the space of the two parameters of the model, the threshold and the rewiring probability. The diagram displays phase transitions of different types: spin ordering, percolation, and connectedness. At variance with traditional coevolution models, in which all spins of each connected component of the graph have equal value in the stationary state, we find that, for suitable choices of the parameters, the system may converge to a state in which spins of opposite sign coexist in the same component organized in compact clusters of like-signed spins. Mean field calculations enable one to estimate some features of the phase diagram.

Quantization, Frobenius and Bi algebras from the Categorical Framework of Quantum Mechanics to Natural Language Semantics

NASA Astrophysics Data System (ADS)

Sadrzadeh, Mehrnoosh

2017-07-01

Compact Closed categories and Frobenius and Bi algebras have been applied to model and reason about Quantum protocols. The same constructions have also been applied to reason about natural language semantics under the name: ``categorical distributional compositional'' semantics, or in short, the ``DisCoCat'' model. This model combines the statistical vector models of word meaning with the compositional models of grammatical structure. It has been applied to natural language tasks such as disambiguation, paraphrasing and entailment of phrases and sentences. The passage from the grammatical structure to vectors is provided by a functor, similar to the Quantization functor of Quantum Field Theory. The original DisCoCat model only used compact closed categories. Later, Frobenius algebras were added to it to model long distance dependancies such as relative pronouns. Recently, bialgebras have been added to the pack to reason about quantifiers. This paper reviews these constructions and their application to natural language semantics. We go over the theory and present some of the core experimental results.

Algorithms Bridging Quantum Computation and Chemistry

NASA Astrophysics Data System (ADS)

McClean, Jarrod Ryan

The design of new materials and chemicals derived entirely from computation has long been a goal of computational chemistry, and the governing equation whose solution would permit this dream is known. Unfortunately, the exact solution to this equation has been far too expensive and clever approximations fail in critical situations. Quantum computers offer a novel solution to this problem. In this work, we develop not only new algorithms to use quantum computers to study hard problems in chemistry, but also explore how such algorithms can help us to better understand and improve our traditional approaches. In particular, we first introduce a new method, the variational quantum eigensolver, which is designed to maximally utilize the quantum resources available in a device to solve chemical problems. We apply this method in a real quantum photonic device in the lab to study the dissociation of the helium hydride (HeH+) molecule. We also enhance this methodology with architecture specific optimizations on ion trap computers and show how linear-scaling techniques from traditional quantum chemistry can be used to improve the outlook of similar algorithms on quantum computers. We then show how studying quantum algorithms such as these can be used to understand and enhance the development of classical algorithms. In particular we use a tool from adiabatic quantum computation, Feynman's Clock, to develop a new discrete time variational principle and further establish a connection between real-time quantum dynamics and ground state eigenvalue problems. We use these tools to develop two novel parallel-in-time quantum algorithms that outperform competitive algorithms as well as offer new insights into the connection between the fermion sign problem of ground states and the dynamical sign problem of quantum dynamics. Finally we use insights gained in the study of quantum circuits to explore a general notion of sparsity in many-body quantum systems. In particular we use developments from the field of compressed sensing to find compact representations of ground states. As an application we study electronic systems and find solutions dramatically more compact than traditional configuration interaction expansions, offering hope to extend this methodology to challenging systems in chemical and material design.

Scale free effects in world currency exchange network

NASA Astrophysics Data System (ADS)

Górski, A. Z.; Drożdż, S.; Kwapień, J.

2008-11-01

A large collection of daily time series for 60 world currencies' exchange rates is considered. The correlation matrices are calculated and the corresponding Minimal Spanning Tree (MST) graphs are constructed for each of those currencies used as reference for the remaining ones. It is shown that multiplicity of the MST graphs' nodes to a good approximation develops a power like, scale free distribution with the scaling exponent similar as for several other complex systems studied so far. Furthermore, quantitative arguments in favor of the hierarchical organization of the world currency exchange network are provided by relating the structure of the above MST graphs and their scaling exponents to those that are derived from an exactly solvable hierarchical network model. A special status of the USD during the period considered can be attributed to some departures of the MST features, when this currency (or some other tied to it) is used as reference, from characteristics typical to such a hierarchical clustering of nodes towards those that correspond to the random graphs. Even though in general the basic structure of the MST is robust with respect to changing the reference currency some trace of a systematic transition from somewhat dispersed - like the USD case - towards more compact MST topology can be observed when correlations increase.

Trace identities and their semiclassical implications

NASA Astrophysics Data System (ADS)

Smilansky, Uzy

2000-03-01

The compatibility of the semiclassical quantization of area-preserving maps with some exact identities which follow from the unitarity of the quantum evolution operator is discussed. The quantum identities involve relations between traces of powers of the evolution operator. For classically integrable maps, the semiclassical approximation is shown to be compatible with the trace identities. This is done by the identification of stationary phase manifolds which give the main contributions to the result. The compatibility of the semiclassical quantization with the trace identities demonstrates the crucial importance of non-diagonal contributions. The same technique is not applicable for chaotic maps, and the compatibility of the semiclassical theory in this case remains unsettled. However, the trace identities are applied to maps which appear naturally in the theory of quantum graphs, revealing some features of the periodic orbit theory for these paradigms of quantum chaos.

Quantum Hurwitz numbers and Macdonald polynomials

NASA Astrophysics Data System (ADS)

Harnad, J.

2016-11-01

Parametric families in the center Z(C[Sn]) of the group algebra of the symmetric group are obtained by identifying the indeterminates in the generating function for Macdonald polynomials as commuting Jucys-Murphy elements. Their eigenvalues provide coefficients in the double Schur function expansion of 2D Toda τ-functions of hypergeometric type. Expressing these in the basis of products of power sum symmetric functions, the coefficients may be interpreted geometrically as parametric families of quantum Hurwitz numbers, enumerating weighted branched coverings of the Riemann sphere. Combinatorially, they give quantum weighted sums over paths in the Cayley graph of Sn generated by transpositions. Dual pairs of bases for the algebra of symmetric functions with respect to the scalar product in which the Macdonald polynomials are orthogonal provide both the geometrical and combinatorial significance of these quantum weighted enumerative invariants.

Noninvasive Quantum Measurement of Arbitrary Operator Order by Engineered Non-Markovian Detectors

NASA Astrophysics Data System (ADS)

Bülte, Johannes; Bednorz, Adam; Bruder, Christoph; Belzig, Wolfgang

2018-04-01

The development of solid-state quantum technologies requires the understanding of quantum measurements in interacting, nonisolated quantum systems. In general, a permanent coupling of detectors to a quantum system leads to memory effects that have to be taken into account in interpreting the measurement results. We analyze a generic setup of two detectors coupled to a quantum system and derive a compact formula in the weak-measurement limit that interpolates between an instantaneous (text-book type) and almost continuous—detector dynamics-dependent—measurement. A quantum memory effect that we term "system-mediated detector-detector interaction" is crucial to observe noncommuting observables simultaneously. Finally, we propose a mesoscopic double-dot detector setup in which the memory effect is tunable and that can be used to explore the transition to non-Markovian quantum measurements experimentally.

Force-Balance Dynamic Display

NASA Technical Reports Server (NTRS)

Ferris, Alice T.; White, William C.

1988-01-01

Balance dynamic display unit (BDDU) is compact system conditioning six dynamic analog signals so they are monitored simultaneously in real time on single-trace oscilloscope. Typical BDDU oscilloscope display in scan mode shows each channel occupying one-sixth of total trace. System features two display modes usable with conventional, single-channel oscilloscope: multiplexed six-channel "bar-graph" format and single-channel display. Two-stage visual and audible limit alarm provided for each channel.

CYBERWAR-2012/13: Siegel 2011 Predicted Cyberwar Via ACHILLES-HEEL DIGITS BEQS BEC ZERO-DIGIT BEC of/in ACHILLES-HEEL DIGITS Log-Law Algebraic-Inversion to ONLY BEQS BEC Digit-Physics U Barabasi Network/Graph-Physics BEQS BEC JAMMING Denial-of-Access(DOA) Attacks 2012-Instantiations

NASA Astrophysics Data System (ADS)

Huffmann, Master; Siegel, Edward Carl-Ludwig

2013-03-01

Newcomb-Benford(NeWBe)-Siegel log-law BEC Digit-Physics Network/Graph-Physics Barabasi et.al. evolving-``complex''-networks/graphs BEC JAMMING DOA attacks: Amazon(weekends: Microsoft I.E.-7/8(vs. Firefox): Memorial-day, Labor-day,...), MANY U.S.-Banks:WF,BoA,UB,UBS,...instantiations AGAIN militate for MANDATORY CONVERSION to PARALLEL ANALOG FAULT-TOLERANT but slow(er) SECURITY-ASSURANCE networks/graphs in parallel with faster ``sexy'' DIGITAL-Networks/graphs:``Cloud'', telecomm: n-G,..., because of common ACHILLES-HEEL VULNERABILITY: DIGITS!!! ``In fast-hare versus slow-tortoise race, Slow-But-Steady ALWAYS WINS!!!'' (Zeno). {Euler [#s(1732)] ∑- ∏()-Riemann[Monats. Akad. Berlin (1859)] ∑- ∏()- Kummer-Bernoulli (#s)}-Newcomb [Am.J.Math.4(1),39 (81) discovery of the QUANTUM!!!]-{Planck (01)]}-{Einstein (05)]-Poincar e [Calcul Probabilités,313(12)]-Weyl[Goett. Nach.(14); Math.Ann.77,313(16)]-(Bose (24)-Einstein(25)]-VS. -Fermi (27)-Dirac(27))-Menger [Dimensiontheorie(29)]-Benford [J.Am. Phil.Soc.78,115(38)]-Kac[Maths Stats.-Reason. (55)]- Raimi [Sci.Am.221,109(69)]-Jech-Hill [Proc.AMS,123,3,887(95)] log-function

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

NASA Technical Reports Server (NTRS)

Wang, Zhihui; Rubin, Nicholas; Rieffel, Eleanor G.

2018-01-01

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

Heralded quantum repeater based on the scattering of photons off single emitters using parametric down-conversion source.

PubMed

Song, Guo-Zhu; Wu, Fang-Zhou; Zhang, Mei; Yang, Guo-Jian

2016-06-28

Quantum repeater is the key element in quantum communication and quantum information processing. Here, we investigate the possibility of achieving a heralded quantum repeater based on the scattering of photons off single emitters in one-dimensional waveguides. We design the compact quantum circuits for nonlocal entanglement generation, entanglement swapping, and entanglement purification, and discuss the feasibility of our protocols with current experimental technology. In our scheme, we use a parametric down-conversion source instead of ideal single-photon sources to realize the heralded quantum repeater. Moreover, our protocols can turn faulty events into the detection of photon polarization, and the fidelity can reach 100% in principle. Our scheme is attractive and scalable, since it can be realized with artificial solid-state quantum systems. With developed experimental technique on controlling emitter-waveguide systems, the repeater may be very useful in long-distance quantum communication.

Heralded quantum repeater based on the scattering of photons off single emitters using parametric down-conversion source

PubMed Central

Song, Guo-Zhu; Wu, Fang-Zhou; Zhang, Mei; Yang, Guo-Jian

2016-01-01

Quantum repeater is the key element in quantum communication and quantum information processing. Here, we investigate the possibility of achieving a heralded quantum repeater based on the scattering of photons off single emitters in one-dimensional waveguides. We design the compact quantum circuits for nonlocal entanglement generation, entanglement swapping, and entanglement purification, and discuss the feasibility of our protocols with current experimental technology. In our scheme, we use a parametric down-conversion source instead of ideal single-photon sources to realize the heralded quantum repeater. Moreover, our protocols can turn faulty events into the detection of photon polarization, and the fidelity can reach 100% in principle. Our scheme is attractive and scalable, since it can be realized with artificial solid-state quantum systems. With developed experimental technique on controlling emitter-waveguide systems, the repeater may be very useful in long-distance quantum communication. PMID:27350159

Shortest-path constraints for 3D multiobject semiautomatic segmentation via clustering and Graph Cut.

PubMed

Kéchichian, Razmig; Valette, Sébastien; Desvignes, Michel; Prost, Rémy

2013-11-01

We derive shortest-path constraints from graph models of structure adjacency relations and introduce them in a joint centroidal Voronoi image clustering and Graph Cut multiobject semiautomatic segmentation framework. The vicinity prior model thus defined is a piecewise-constant model incurring multiple levels of penalization capturing the spatial configuration of structures in multiobject segmentation. Qualitative and quantitative analyses and comparison with a Potts prior-based approach and our previous contribution on synthetic, simulated, and real medical images show that the vicinity prior allows for the correct segmentation of distinct structures having identical intensity profiles and improves the precision of segmentation boundary placement while being fairly robust to clustering resolution. The clustering approach we take to simplify images prior to segmentation strikes a good balance between boundary adaptivity and cluster compactness criteria furthermore allowing to control the trade-off. Compared with a direct application of segmentation on voxels, the clustering step improves the overall runtime and memory footprint of the segmentation process up to an order of magnitude without compromising the quality of the result.

Experimental Study of Quantum Graphs With and Without Time-Reversal Invariance

NASA Astrophysics Data System (ADS)

Anlage, Steven Mark; Fu, Ziyuan; Koch, Trystan; Antonsen, Thomas; Ott, Edward

An experimental setup consisting of a microwave network is used to simulate quantum graphs. The random coupling model (RCM) is applied to describe the universal statistical properties of the system with and without time-reversal invariance. The networks which are large compared to the wavelength, are constructed from coaxial cables connected by T junctions, and by making nodes with circulators time-reversal invariance for microwave propagation in the networks can be broken. The results of experimental study of microwave networks with and without time-reversal invariance are presented both in frequency domain and time domain. With the measured S-parameter data of two-port networks, the impedance statistics and the nearest-neighbor spacing statistics are examined. Moreover, the experiments of time reversal mirrors for networks demonstrate that the reconstruction quality can be used to quantify the degree of the time-reversal invariance for wave propagation. Numerical models of networks are also presented to verify the time domain experiments. We acknowledge support under contract AFOSR COE Grant FA9550-15-1-0171 and the ONR Grant N000141512134.

Spatial search on a two-dimensional lattice with long-range interactions

NASA Astrophysics Data System (ADS)

Osada, Tomo; Sanaka, Kaoru; Munro, William J.; Nemoto, Kae

2018-06-01

Quantum-walk-based algorithms that search a marked location among N locations on a d -dimensional lattice succeeds in time O (√{N }) for d >2 , while this is not found to be possible when d =2 . In this paper, we consider a spatial search algorithm using continuous-time quantum walk on a two-dimensional square lattice with the existence of additional long-range edges. We examined such a search on a probabilistic graph model where an edge connecting non-nearest-neighbor lattice points i and j apart by a distance |i -j | is added by probability pi j=|i-j | -α(α ≥0 ) . Through numerical analysis, we found that the search succeeds in time O (√{N }) when α ≤αc=2.4 ±0.1 . For α >2 , the expectation value of the additional long-range edges on each node scales as a constant when N →∞ , which means that search time of O (√{N }) is achieved on a graph with average degree scaling as a constant.

History dependent quantum walk on the cycle with an unbalanced coin

NASA Astrophysics Data System (ADS)

Krawec, Walter O.

2015-06-01

Recently, a new model of quantum walk, utilizing recycled coins, was introduced; however little is yet known about its properties. In this paper, we study its behavior on the cycle graph. In particular, we will consider its time averaged distribution and how it is affected by the walk's "memory parameter"-a real parameter, between zero and eight, which affects the walk's coin flip operator. Despite an infinite number of different parameters, our analysis provides evidence that only a few produce non-uniform behavior. Our analysis also shows that the initial state, and cycle size modulo four all affect the behavior of this walk. We also prove an interesting relationship between the recycled coin model and a different memory-based quantum walk recently proposed.

Fate of the Hoop Conjecture in Quantum Gravity.

PubMed

Anzà, Fabio; Chirco, Goffredo

2017-12-08

We consider a closed region R of 3D quantum space described via SU(2) spin networks. Using the concentration of measure phenomenon we prove that, whenever the ratio between the boundary ∂R and the bulk edges of the graph overcomes a finite threshold, the state of the boundary is always thermal, with an entropy proportional to its area. The emergence of a thermal state of the boundary can be traced back to a large amount of entanglement between boundary and bulk degrees of freedom. Using the dual geometric interpretation provided by loop quantum gravity, we interpret such phenomenon as a pregeometric analogue of Thorne's "hoop conjecture," at the core of the formation of a horizon in general relativity.

Compact Single Site Resolution Cold Atom Experiment for Adiabatic Quantum Computing

DTIC Science & Technology

2016-02-03

goal of our scientific investigation is to demonstrate high fidelity and fast atom-atom entanglement between physically 1. REPORT DATE (DD-MM-YYYY) 4...of our scientific investigation is to demonstrate high fidelity and fast atom-atom entanglement between physically separated and optically addressed...Specifically, we will design and construct a set of compact single atom traps with integrated optics, suitable for heralded entanglement and loophole

Frequency and amplitude modulation of ultra-compact terahertz quantum cascade lasers using an integrated avalanche diode oscillator.

PubMed

Castellano, Fabrizio; Li, Lianhe; Linfield, Edmund H; Davies, A Giles; Vitiello, Miriam S

2016-03-15

Mode-locked comb sources operating at optical frequencies underpin applications ranging from spectroscopy and ultrafast physics, through to absolute frequency measurements and atomic clocks. Extending their operation into the terahertz frequency range would greatly benefit from the availability of compact semiconductor-based sources. However, the development of any compact mode-locked THz laser, which itself is inherently a frequency comb, has yet to be achieved without the use of an external stimulus. High-power, electrically pumped quantum cascade lasers (QCLs) have recently emerged as a promising solution, owing to their octave spanning bandwidths, the ability to achieve group-velocity dispersion compensation and the possibility of obtaining active mode-locking. Here, we propose an unprecedented compact architecture to induce both frequency and amplitude self-modulation in a THz QCL. By engineering a microwave avalanche oscillator into the laser cavity, which provides a 10 GHz self-modulation of the bias current and output power, we demonstrate multimode laser emission centered around 3 THz, with distinct multiple sidebands. The resulting microwave amplitude and frequency self-modulation of THz QCLs opens up intriguing perspectives, for engineering integrated self-mode-locked THz lasers, with impact in fields such as nano- and ultrafast photonics and optical metrology.

Frequency and amplitude modulation of ultra-compact terahertz quantum cascade lasers using an integrated avalanche diode oscillator

PubMed Central

Castellano, Fabrizio; Li, Lianhe; Linfield, Edmund H.; Davies, A. Giles; Vitiello, Miriam S.

2016-01-01

Mode-locked comb sources operating at optical frequencies underpin applications ranging from spectroscopy and ultrafast physics, through to absolute frequency measurements and atomic clocks. Extending their operation into the terahertz frequency range would greatly benefit from the availability of compact semiconductor-based sources. However, the development of any compact mode-locked THz laser, which itself is inherently a frequency comb, has yet to be achieved without the use of an external stimulus. High-power, electrically pumped quantum cascade lasers (QCLs) have recently emerged as a promising solution, owing to their octave spanning bandwidths, the ability to achieve group-velocity dispersion compensation and the possibility of obtaining active mode-locking. Here, we propose an unprecedented compact architecture to induce both frequency and amplitude self-modulation in a THz QCL. By engineering a microwave avalanche oscillator into the laser cavity, which provides a 10 GHz self-modulation of the bias current and output power, we demonstrate multimode laser emission centered around 3 THz, with distinct multiple sidebands. The resulting microwave amplitude and frequency self-modulation of THz QCLs opens up intriguing perspectives, for engineering integrated self-mode-locked THz lasers, with impact in fields such as nano- and ultrafast photonics and optical metrology. PMID:26976199

Latest developments for low-power infrared laser-based trace gas sensors for sensor networks

NASA Astrophysics Data System (ADS)

So, Stephen; Thomazy, David; Wang, Wen; Marchat, Oscar; Wysocki, Gerard

2011-09-01

Academic and industrial researchers require ultra-low power, compact laser based trace-gas sensor systems for the most demanding environmental and space-borne applications. Here the latest results from research projects addressing these applications will be discussed: 1) an ultra-compact CO2 sensor based on a continuous wave quantum cascade laser, 2) an ultra-sensitive Faraday rotation spectrometer for O2 detection, 3) a fully ruggedized compact and low-power laser spectrometer, and 4) a novel non-paraxial nonthin multipass cell. Preliminary tests and projection for performance of future sensors based on this technology is presented.

Universal quantum gates on electron-spin qubits with quantum dots inside single-side optical microcavities.

PubMed

Wei, Hai-Rui; Deng, Fu-Guo

2014-01-13

We present some compact quantum circuits for a deterministic quantum computing on electron-spin qubits assisted by quantum dots inside single-side optical microcavities, including the CNOT, Toffoli, and Fredkin gates. They are constructed by exploiting the giant optical Faraday rotation induced by a single-electron spin in a quantum dot inside a single-side optical microcavity as a result of cavity quantum electrodynamics. Our universal quantum gates have some advantages. First, all the gates are accomplished with a success probability of 100% in principle. Second, our schemes require no additional electron-spin qubits and they are achieved by some input-output processes of a single photon. Third, our circuits for these gates are simple and economic. Moreover, our devices for these gates work in both the weak coupling and the strong coupling regimes, and they are feasible in experiment.

Numerical characteristics of quantum computer simulation

NASA Astrophysics Data System (ADS)

Chernyavskiy, A.; Khamitov, K.; Teplov, A.; Voevodin, V.; Voevodin, Vl.

2016-12-01

The simulation of quantum circuits is significantly important for the implementation of quantum information technologies. The main difficulty of such modeling is the exponential growth of dimensionality, thus the usage of modern high-performance parallel computations is relevant. As it is well known, arbitrary quantum computation in circuit model can be done by only single- and two-qubit gates, and we analyze the computational structure and properties of the simulation of such gates. We investigate the fact that the unique properties of quantum nature lead to the computational properties of the considered algorithms: the quantum parallelism make the simulation of quantum gates highly parallel, and on the other hand, quantum entanglement leads to the problem of computational locality during simulation. We use the methodology of the AlgoWiki project (algowiki-project.org) to analyze the algorithm. This methodology consists of theoretical (sequential and parallel complexity, macro structure, and visual informational graph) and experimental (locality and memory access, scalability and more specific dynamic characteristics) parts. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia). We show that the simulation of quantum gates is a good base for the research and testing of the development methods for data intense parallel software, and considered methodology of the analysis can be successfully used for the improvement of the algorithms in quantum information science.

Compact Graphical Representation of Phylogenetic Data and Metadata with GraPh1An

DTIC Science & Technology

2016-09-12

pipelines . This allows for a higher degree of analysis reproducibility, but the software must correspondingly be available for local installation and callable...these operations are available in the GraPhlAn software repository). Reproducible integration with existing analysis tools and pipelines Graphical...from different analysis pipelines , generating the necessary input files for GraPhlAn. Export2graphlan directly supports MetaPhlAn2, LEfSe, and HUMAnN

Equivariant Gromov-Witten Invariants of Algebraic GKM Manifolds

NASA Astrophysics Data System (ADS)

Liu, Chiu-Chu Melissa; Sheshmani, Artan

2017-07-01

An algebraic GKM manifold is a non-singular algebraic variety equipped with an algebraic action of an algebraic torus, with only finitely many torus fixed points and finitely many 1-dimensional orbits. In this expository article, we use virtual localization to express equivariant Gromov-Witten invariants of any algebraic GKM manifold (which is not necessarily compact) in terms of Hodge integrals over moduli stacks of stable curves and the GKM graph of the GKM manifold.

Quantum Stat Mech in a Programmable Spin Chain of Trapped Ions

NASA Astrophysics Data System (ADS)

Monroe, Christopher

2017-04-01

Trapped atomic ions are a versatile and very clean platform for the quantum programming of interacting spin models and the study of quantum nonequilibrium phenomena. When spin-dependent optical dipole forces are applied to a collection of trapped ions, an effective long-range quantum magnetic interaction arises, with reconfigurable and tunable graphs. Following earlier work on many-body spectroscopy and quench dynamics, we have recently studied many body non-thermalization processes in this system. Frustrated Hamiltonian dynamics can lead to prethermalization, and by adding programmable disorder between the sites, we have observed the phenomenon of many body localization (MBL). Finally, by applying a periodically driven Floquet Hamiltonian tempered by MBL, we report the observation of a discrete ``time crystal'' in the stable appearance of a subharmonic response of the system to the periodic drive. This work is supported by the ARO Atomic Physics Program, the AFOSR MURI on Quantum Measurement and Verification, the IARPA LogiQ Program, and the NSF Physics Frontier Center at JQI.

Locality for quantum systems on graphs depends on the number field

NASA Astrophysics Data System (ADS)

Hall, H. Tracy; Severini, Simone

2013-07-01

Adapting a definition of Aaronson and Ambainis (2005 Theory Comput. 1 47-79), we call a quantum dynamics on a digraph saturated Z-local if the nonzero transition amplitudes specifying the unitary evolution are in exact correspondence with the directed edges (including loops) of the digraph. This idea appears recurrently in a variety of contexts including angular momentum, quantum chaos, and combinatorial matrix theory. Complete characterization of the digraph properties that allow such a process to exist is a long-standing open question that can also be formulated in terms of minimum rank problems. We prove that saturated Z-local dynamics involving complex amplitudes occur on a proper superset of the digraphs that allow restriction to the real numbers or, even further, the rationals. Consequently, among these fields, complex numbers guarantee the largest possible choice of topologies supporting a discrete quantum evolution. A similar construction separates complex numbers from the skew field of quaternions. The result proposes a concrete ground for distinguishing between complex and quaternionic quantum mechanics.

Performance of Continuous Quantum Thermal Devices Indirectly Connected to Environments

NASA Astrophysics Data System (ADS)

González, J.; Alonso, Daniel; Palao, José

2016-04-01

A general quantum thermodynamics network is composed of thermal devices connected to the environments through quantum wires. The coupling between the devices and the wires may introduce additional decay channels which modify the system performance with respect to the directly-coupled device. We analyze this effect in a quantum three-level device connected to a heat bath or to a work source through a two-level wire. The steady state heat currents are decomposed into the contributions of the set of simple circuits in the graph representing the master equation. Each circuit is associated with a mechanism in the device operation and the system performance can be described by a small number of circuit representatives of those mechanisms. Although in the limit of weak coupling between the device and the wire the new irreversible contributions can become small, they prevent the system from reaching the Carnot efficiency.

The case of escape probability as linear in short time

NASA Astrophysics Data System (ADS)

Marchewka, A.; Schuss, Z.

2018-02-01

We derive rigorously the short-time escape probability of a quantum particle from its compactly supported initial state, which has a discontinuous derivative at the boundary of the support. We show that this probability is linear in time, which seems to be a new result. The novelty of our calculation is the inclusion of the boundary layer of the propagated wave function formed outside the initial support. This result has applications to the decay law of the particle, to the Zeno behaviour, quantum absorption, time of arrival, quantum measurements, and more.

Scalable effective-temperature reduction for quantum annealers via nested quantum annealing correction

NASA Astrophysics Data System (ADS)

Vinci, Walter; Lidar, Daniel A.

2018-02-01

Nested quantum annealing correction (NQAC) is an error-correcting scheme for quantum annealing that allows for the encoding of a logical qubit into an arbitrarily large number of physical qubits. The encoding replaces each logical qubit by a complete graph of degree C . The nesting level C represents the distance of the error-correcting code and controls the amount of protection against thermal and control errors. Theoretical mean-field analyses and empirical data obtained with a D-Wave Two quantum annealer (supporting up to 512 qubits) showed that NQAC has the potential to achieve a scalable effective-temperature reduction, Teff˜C-η , with 0 <η ≤2 . We confirm that this scaling is preserved when NQAC is tested on a D-Wave 2000Q device (supporting up to 2048 qubits). In addition, we show that NQAC can also be used in sampling problems to lower the effective-temperature of a quantum annealer. Such effective-temperature reduction is relevant for machine-learning applications. Since we demonstrate that NQAC achieves error correction via a reduction of the effective-temperature of the quantum annealing device, our results address the problem of the "temperature scaling law for quantum annealers," which requires the temperature of quantum annealers to be reduced as problems of larger sizes are attempted to be solved.

Progress towards the development of a source of entangled photons for Space

NASA Astrophysics Data System (ADS)

Fedrizzi, Alessandro; Jennewein, Thomas; Ursin, Rupert; Zeilinger, Anton

2007-03-01

Quantum entanglement offers exciting applications like quantum computing, quantum teleportation and quantum cryptography. Ground based quantum communication schemes in optical fibres however are limited to a distance of the order of ˜100 km. In order to extend this limit to a global scale we are working on the realization of an entanglement-based quantum communication transceiver for space deployment. Here we report on a compact, extremely bright source for polarization entangled photons meeting the scientific requirements for a potential space to ground optical link. The pair production rate exceeds 4*10̂6 pairs/s at just 20mW of laser diode pump power. Furthermore, we will present the results of various experiments proving the feasibility of quantum information in space, including a weak coherent pulse single-photon downlink from a LEO satellite and the distribution of entanglement over a 144km free space link, using ESAs optical ground station.

Compact 3D quantum memory

NASA Astrophysics Data System (ADS)

Xie, Edwar; Deppe, Frank; Renger, Michael; Repp, Daniel; Eder, Peter; Fischer, Michael; Goetz, Jan; Pogorzalek, Stefan; Fedorov, Kirill G.; Marx, Achim; Gross, Rudolf

2018-05-01

Superconducting 3D microwave cavities offer state-of-the-art coherence times and a well-controlled environment for superconducting qubits. In order to realize at the same time fast readout and long-lived quantum information storage, one can couple the qubit to both a low-quality readout and a high-quality storage cavity. However, such systems are bulky compared to their less coherent 2D counterparts. A more compact and scalable approach is achieved by making use of the multimode structure of a 3D cavity. In our work, we investigate such a device where a transmon qubit is capacitively coupled to two modes of a single 3D cavity. External coupling is engineered so that the memory mode has an about 100 times larger quality factor than the readout mode. Using an all-microwave second-order protocol, we realize a lifetime enhancement of the stored state over the qubit lifetime by a factor of 6 with a fidelity of approximately 80% determined via quantum process tomography. We also find that this enhancement is not limited by fundamental constraints.

Quantum return probability of a system of N non-interacting lattice fermions

NASA Astrophysics Data System (ADS)

Krapivsky, P. L.; Luck, J. M.; Mallick, K.

2018-02-01

We consider N non-interacting fermions performing continuous-time quantum walks on a one-dimensional lattice. The system is launched from a most compact configuration where the fermions occupy neighboring sites. We calculate exactly the quantum return probability (sometimes referred to as the Loschmidt echo) of observing the very same compact state at a later time t. Remarkably, this probability depends on the parity of the fermion number—it decays as a power of time for even N, while for odd N it exhibits periodic oscillations modulated by a decaying power law. The exponent also slightly depends on the parity of N, and is roughly twice smaller than what it would be in the continuum limit. We also consider the same problem, and obtain similar results, in the presence of an impenetrable wall at the origin constraining the particles to remain on the positive half-line. We derive closed-form expressions for the amplitudes of the power-law decay of the return probability in all cases. The key point in the derivation is the use of Mehta integrals, which are limiting cases of the Selberg integral.

On the location of spectral edges in \\ {Z}-periodic media

NASA Astrophysics Data System (ADS)

Exner, Pavel; Kuchment, Peter; Winn, Brian

2010-11-01

Periodic second-order ordinary differential operators on \\ {R} are known to have the edges of their spectra to occur only at the spectra of periodic and anti-periodic boundary value problems. The multi-dimensional analog of this property is false, as was shown in a 2007 paper by some of the authors of this paper. However, one sometimes encounters the claims that in the case of a single periodicity (i.e., with respect to the lattice \\ {Z}), the 1D property still holds, and spectral edges occur at the periodic and anti-periodic spectra only. In this work, we show that even in the simplest case of quantum graphs this is not true. It is shown that this is true if the graph consists of a 1D chain of finite graphs connected by single edges, while if the connections are formed by at least two edges, the spectral edges can already occur away from the periodic and anti-periodic spectra. This paper is dedicated to the memory of P Duclos.

Critical space-time networks and geometric phase transitions from frustrated edge antiferromagnetism

NASA Astrophysics Data System (ADS)

Trugenberger, Carlo A.

2015-12-01

Recently I proposed a simple dynamical network model for discrete space-time that self-organizes as a graph with Hausdorff dimension dH=4 . The model has a geometric quantum phase transition with disorder parameter (dH-ds) , where ds is the spectral dimension of the dynamical graph. Self-organization in this network model is based on a competition between a ferromagnetic Ising model for vertices and an antiferromagnetic Ising model for edges. In this paper I solve a toy version of this model defined on a bipartite graph in the mean-field approximation. I show that the geometric phase transition corresponds exactly to the antiferromagnetic transition for edges, the dimensional disorder parameter of the former being mapped to the staggered magnetization order parameter of the latter. The model has a critical point with long-range correlations between edges, where a continuum random geometry can be defined, exactly as in Kazakov's famed 2D random lattice Ising model but now in any number of dimensions.

Graph theory data for topological quantum chemistry.

PubMed

Vergniory, M G; Elcoro, L; Wang, Zhijun; Cano, Jennifer; Felser, C; Aroyo, M I; Bernevig, B Andrei; Bradlyn, Barry

2017-08-01

Topological phases of noninteracting particles are distinguished by the global properties of their band structure and eigenfunctions in momentum space. On the other hand, group theory as conventionally applied to solid-state physics focuses only on properties that are local (at high-symmetry points, lines, and planes) in the Brillouin zone. To bridge this gap, we have previously [Bradlyn et al., Nature (London) 547, 298 (2017)NATUAS0028-083610.1038/nature23268] mapped the problem of constructing global band structures out of local data to a graph construction problem. In this paper, we provide the explicit data and formulate the necessary algorithms to produce all topologically distinct graphs. Furthermore, we show how to apply these algorithms to certain "elementary" band structures highlighted in the aforementioned reference, and thus we identified and tabulated all orbital types and lattices that can give rise to topologically disconnected band structures. Finally, we show how to use the newly developed bandrep program on the Bilbao Crystallographic Server to access the results of our computation.

Experimental Satellite Quantum Communications

NASA Astrophysics Data System (ADS)

Vallone, Giuseppe; Bacco, Davide; Dequal, Daniele; Gaiarin, Simone; Luceri, Vincenza; Bianco, Giuseppe; Villoresi, Paolo

2015-07-01

Quantum communication (QC), namely, the faithful transmission of generic quantum states, is a key ingredient of quantum information science. Here we demonstrate QC with polarization encoding from space to ground by exploiting satellite corner cube retroreflectors as quantum transmitters in orbit and the Matera Laser Ranging Observatory of the Italian Space Agency in Matera, Italy, as a quantum receiver. The quantum bit error ratio (QBER) has been kept steadily low to a level suitable for several quantum information protocols, as the violation of Bell inequalities or quantum key distribution (QKD). Indeed, by taking data from different satellites, we demonstrate an average value of QBER =4.6 % for a total link duration of 85 s. The mean photon number per pulse μsat leaving the satellites was estimated to be of the order of one. In addition, we propose a fully operational satellite QKD system by exploiting our communication scheme with orbiting retroreflectors equipped with a modulator, a very compact payload. Our scheme paves the way toward the implementation of a QC worldwide network leveraging existing receivers.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bianchi, Eugenio; Speziale, Simone; Dona, Pietro

Intertwiners are the building blocks of spin-network states. The space of intertwiners is the quantization of a classical symplectic manifold introduced by Kapovich and Millson. Here we show that a theorem by Minkowski allows us to interpret generic configurations in this space as bounded convex polyhedra in R{sup 3}: A polyhedron is uniquely described by the areas and normals to its faces. We provide a reconstruction of the geometry of the polyhedron: We give formulas for the edge lengths, the volume, and the adjacency of its faces. At the quantum level, this correspondence allows us to identify an intertwiner withmore » the state of a quantum polyhedron, thus generalizing the notion of the quantum tetrahedron familiar in the loop quantum gravity literature. Moreover, coherent intertwiners result to be peaked on the classical geometry of polyhedra. We discuss the relevance of this result for loop quantum gravity. In particular, coherent spin-network states with nodes of arbitrary valence represent a collection of semiclassical polyhedra. Furthermore, we introduce an operator that measures the volume of a quantum polyhedron and examine its relation with the standard volume operator of loop quantum gravity. We also comment on the semiclassical limit of spin foams with nonsimplicial graphs.« less

Multimode quantum interference of photons in multiport integrated devices

PubMed Central

Peruzzo, Alberto; Laing, Anthony; Politi, Alberto; Rudolph, Terry; O'Brien, Jeremy L.

2011-01-01

Photonics is a leading approach in realizing future quantum technologies and recently, optical waveguide circuits on silicon chips have demonstrated high levels of miniaturization and performance. Multimode interference (MMI) devices promise a straightforward implementation of compact and robust multiport circuits. Here, we show quantum interference in a 2×2 MMI coupler with visibility of V=95.6±0.9%. We further demonstrate the operation of a 4×4 port MMI device with photon pairs, which exhibits complex quantum interference behaviour. We have developed a new technique to fully characterize such multiport devices, which removes the need for phase-sensitive measurements and may find applications for a wide range of photonic devices. Our results show that MMI devices can operate in the quantum regime with high fidelity and promise substantial simplification and concatenation of photonic quantum circuits. PMID:21364563

An Adynamical, Graphical Approach to Quantum Gravity and Unification

NASA Astrophysics Data System (ADS)

Stuckey, W. M.; Silberstein, Michael; McDevitt, Timothy

We use graphical field gradients in an adynamical, background independent fashion to propose a new approach to quantum gravity (QG) and unification. Our proposed reconciliation of general relativity (GR) and quantum field theory (QFT) is based on a modification of their graphical instantiations, i.e. Regge calculus and lattice gauge theory (LGT), respectively, which we assume are fundamental to their continuum counterparts. Accordingly, the fundamental structure is a graphical amalgam of space, time, and sources (in parlance of QFT) called a "space-time source element". These are fundamental elements of space, time, and sources, not source elements in space and time. The transition amplitude for a space-time source element is computed using a path integral with discrete graphical action. The action for a space-time source element is constructed from a difference matrix K and source vector J on the graph, as in lattice gauge theory. K is constructed from graphical field gradients so that it contains a non-trivial null space and J is then restricted to the row space of K, so that it is divergence-free and represents a conserved exchange of energy-momentum. This construct of K and J represents an adynamical global constraint (AGC) between sources, the space-time metric, and the energy-momentum content of the element, rather than a dynamical law for time-evolved entities. In this view, one manifestation of quantum gravity becomes evident when, for example, a single space-time source element spans adjoining simplices of the Regge calculus graph. Thus, energy conservation for the space-time source element includes contributions to the deficit angles between simplices. This idea is used to correct proper distance in the Einstein-de Sitter (EdS) cosmology model yielding a fit of the Union2 Compilation supernova data that matches ΛCDM without having to invoke accelerating expansion or dark energy. A similar modification to LGT results in an adynamical account of quantum interference.

Hollow fibers for compact infrared gas sensors

NASA Astrophysics Data System (ADS)

Lambrecht, A.; Hartwig, S.; Herbst, J.; Wöllenstein, J.

2008-02-01

Hollow fibers can be used for compact infrared gas sensors. The guided light is absorbed by the gas introduced into the hollow core. High sensitivity and a very small sampling volume can be achieved depending on fiber parameters i.e. attenuation, flexibility, and gas exchange rates. Different types of infrared hollow fibers including photonic bandgap fibers were characterized using quantum cascade lasers and thermal radiation sources. Obtained data are compared with available product specifications. Measurements with a compact fiber based ethanol sensor are compared with a system simulation. First results on the detection of trace amounts of the explosive material TATP using hollow fibers and QCL will be shown.

Frequency locking of compact laser-diode modules at 633 nm

NASA Astrophysics Data System (ADS)

Nölleke, Christian; Leisching, Patrick; Blume, Gunnar; Jedrzejczyk, Daniel; Pohl, Johannes; Feise, David; Sahm, Alexander; Paschke, Katrin

2018-02-01

This work reports on a compact diode-laser module emitting at 633 nm. The emission frequency can be tuned with temperature and current, while optical feedback of an internal DBR grating ensures single-mode operation. The laser diode is integrated into a micro-fabricated package, which includes optics for beam shaping, a miniaturized optical isolator, and a vapor cell as frequency reference. The achieved absolute frequency stability is below 10-8 , while the output power can be more than 10 mW. This compact absolute frequency-stabilized laser system can replace gas lasers and may be integrated in future quantum technology devices.

Projective loop quantum gravity. I. State space

NASA Astrophysics Data System (ADS)

Lanéry, Suzanne; Thiemann, Thomas

2016-12-01

Instead of formulating the state space of a quantum field theory over one big Hilbert space, it has been proposed by Kijowski to describe quantum states as projective families of density matrices over a collection of smaller, simpler Hilbert spaces. Beside the physical motivations for this approach, it could help designing a quantum state space holding the states we need. In a latter work by Okolów, the description of a theory of Abelian connections within this framework was developed, an important insight being to use building blocks labeled by combinations of edges and surfaces. The present work generalizes this construction to an arbitrary gauge group G (in particular, G is neither assumed to be Abelian nor compact). This involves refining the definition of the label set, as well as deriving explicit formulas to relate the Hilbert spaces attached to different labels. If the gauge group happens to be compact, we also have at our disposal the well-established Ashtekar-Lewandowski Hilbert space, which is defined as an inductive limit using building blocks labeled by edges only. We then show that the quantum state space presented here can be thought as a natural extension of the space of density matrices over this Hilbert space. In addition, it is manifest from the classical counterparts of both formalisms that the projective approach allows for a more balanced treatment of the holonomy and flux variables, so it might pave the way for the development of more satisfactory coherent states.

Intense laser field effects on a Woods-Saxon potential quantum well

NASA Astrophysics Data System (ADS)

Restrepo, R. L.; Morales, A. L.; Akimov, V.; Tulupenko, V.; Kasapoglu, E.; Ungan, F.; Duque, C. A.

2015-11-01

This paper presents the results of the theoretical study of the effects of non-resonant intense laser field and electric and magnetic fields on the optical properties in an quantum well (QW) make with Woods-Saxon potential profile. The electric field and intense laser field are applied along the growth direction of the Woods-Saxon quantum well and the magnetic field is oriented perpendicularly. To calculate the energy and the wave functions of the electron in the Woods-Saxon quantum well, the effective mass approximation and the method of envelope wave function are used. The confinement in the Woods-Saxon quantum well is changed drastically by the application of intense laser field or either the effect of electric and magnetic fields. The optical properties are calculated using the compact density matrix.

Quantum Anosov flows: A new family of examples

NASA Astrophysics Data System (ADS)

Peter, Ingo J.; Emch, Gérard G.

1998-09-01

A quantum version is presented for the Anosov system defined by the time evolution implemented by the geodesic coflow on the cotangent bundle of any compact quotient manifold obtained from the Poincaré half-plane. While the canonical Weyl algebra does not close under time evolution, the symplectic structure of these classical systems can be exploited to produce objects akin to the CCR algebras encountered in quantum field theory. This construction allows one to lift both the geodesic and the horocyclic flows to a Weyl algebra describing the quantum dynamics corresponding to the systems under consideration. The Anosov relations as proposed in Ref. Reference 1 are found to be valid for these models. A quantum version of the classical ergodicity of these systems is discussed in the last section.

Compact and highly stable quantum dots through optimized aqueous phase transfer

NASA Astrophysics Data System (ADS)

Tamang, Sudarsan; Beaune, Grégory; Poillot, Cathy; De Waard, Michel; Texier-Nogues, Isabelle; Reiss, Peter

2011-03-01

A large number of different approaches for the aqueous phase transfer of quantum dots have been proposed. Surface ligand exchange with small hydrophilic thiols, such as L-cysteine, yields the lowest particle hydrodynamic diameter. However, cysteine is prone to dimer formation, which limits colloidal stability. We demonstrate that precise pH control during aqueous phase transfer dramatically increases the colloidal stability of InP/ZnS quantum dots. Various bifunctional thiols have been applied. The formation of disulfides, strongly diminishing the fluorescence QY has been prevented through addition of appropriate reducing agents. Bright InP/ZnS quantum dots with a hydrodynamic diameter <10 nm and long-term stability have been obtained. Finally we present in vitro studies of the quantum dots functionalized with the cell-penetrating peptide maurocalcine.

Exciton Scattering approach for conjugated macromolecules: from electronic spectra to electron-phonon coupling

NASA Astrophysics Data System (ADS)

Tretiak, Sergei

2014-03-01

The exciton scattering (ES) technique is a multiscale approach developed for efficient calculations of excited-state electronic structure and optical spectra in low-dimensional conjugated macromolecules. Within the ES method, the electronic excitations in the molecular structure are attributed to standing waves representing quantum quasi-particles (excitons), which reside on the graph. The exciton propagation on the linear segments is characterized by the exciton dispersion, whereas the exciton scattering on the branching centers is determined by the energy-dependent scattering matrices. Using these ES energetic parameters, the excitation energies are then found by solving a set of generalized ``particle in a box'' problems on the graph that represents the molecule. All parameters can be extracted from quantum-chemical computations of small molecular fragments and tabulated in the ES library for further applications. Subsequently, spectroscopic modeling for any macrostructure within considered molecular family could be performed with negligible numerical effort. The exciton scattering properties of molecular vertices can be further described by tight-binding or equivalently lattice models. The on-site energies and hopping constants are obtained from the exciton dispersion and scattering matrices. Such tight-binding model approach is particularly useful to describe the exciton-phonon coupling, energetic disorder and incoherent energy transfer in large branched conjugated molecules. Overall the ES applications accurately reproduce the optical spectra compared to the reference quantum chemistry results, and make possible to predict spectra of complex macromolecules, where conventional electronic structure calculations are unfeasible.

Hopf algebras of rooted forests, cocyles, and free Rota-Baxter algebras

NASA Astrophysics Data System (ADS)

Zhang, Tianjie; Gao, Xing; Guo, Li

2016-10-01

The Hopf algebra and the Rota-Baxter algebra are the two algebraic structures underlying the algebraic approach of Connes and Kreimer to renormalization of perturbative quantum field theory. In particular, the Hopf algebra of rooted trees serves as the "baby model" of Feynman graphs in their approach and can be characterized by certain universal properties involving a Hochschild 1-cocycle. Decorated rooted trees have also been applied to study Feynman graphs. We will continue the study of universal properties of various spaces of decorated rooted trees with such a 1-cocycle, leading to the concept of a cocycle Hopf algebra. We further apply the universal properties to equip a free Rota-Baxter algebra with the structure of a cocycle Hopf algebra.

Electric field induced optical gain of a hydrogenic impurity in a Cd{sub 0.8}Zn{sub 0.2}Se/ZnSe parabolic quantum dot

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jasmine, P. Christina Lily; Peter, A. John, E-mail: a.john.peter@gmail.com

The dependence of electric field on the electronic and optical properties is investigated in a Cd{sub 0.8}Zn{sub 0.2}Se/ZnSe quantum dot. The hydrogenic binding energy, in the presence of electric field, is calculated with the spatial confinement effect. The electric field dependent optical gain with the photon energy is found using compact density matrix method. The results show that the electric field has a great influence on the optical properties of II-VI semiconductor quantum dot.

Statistical mechanics of high-density bond percolation

NASA Astrophysics Data System (ADS)

Timonin, P. N.

2018-05-01

High-density (HD) percolation describes the percolation of specific κ -clusters, which are the compact sets of sites each connected to κ nearest filled sites at least. It takes place in the classical patterns of independently distributed sites or bonds in which the ordinary percolation transition also exists. Hence, the study of series of κ -type HD percolations amounts to the description of classical clusters' structure for which κ -clusters constitute κ -cores nested one into another. Such data are needed for description of a number of physical, biological, and information properties of complex systems on random lattices, graphs, and networks. They range from magnetic properties of semiconductor alloys to anomalies in supercooled water and clustering in biological and social networks. Here we present the statistical mechanics approach to study HD bond percolation on an arbitrary graph. It is shown that the generating function for κ -clusters' size distribution can be obtained from the partition function of the specific q -state Potts-Ising model in the q →1 limit. Using this approach we find exact κ -clusters' size distributions for the Bethe lattice and Erdos-Renyi graph. The application of the method to Euclidean lattices is also discussed.

Spectral identification of topological domains

PubMed Central

Chen, Jie; Hero, Alfred O.; Rajapakse, Indika

2016-01-01

Motivation: Topological domains have been proposed as the backbone of interphase chromosome structure. They are regions of high local contact frequency separated by sharp boundaries. Genes within a domain often have correlated transcription. In this paper, we present a computational efficient spectral algorithm to identify topological domains from chromosome conformation data (Hi-C data). We consider the genome as a weighted graph with vertices defined by loci on a chromosome and the edge weights given by interaction frequency between two loci. Laplacian-based graph segmentation is then applied iteratively to obtain the domains at the given compactness level. Comparison with algorithms in the literature shows the advantage of the proposed strategy. Results: An efficient algorithm is presented to identify topological domains from the Hi-C matrix. Availability and Implementation: The Matlab source code and illustrative examples are available at http://bionetworks.ccmb.med.umich.edu/ Contact: indikar@med.umich.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:27153657

1:2,000,000-scale digital line graph data on CD-ROM

USGS Publications Warehouse

,

1995-01-01

Updated U.S. Geological Survey digital line graph (DLG) data collected at a scale of 1:2,000,000 are now available on two compact discs-read only memory (CD-ROM). Each CD-ROM contains digital cartographic data for 49 States and the District of Columbia. The U.S. Virgin Islands, Puerto Rico, and Alaska will be ready within the next year. These DLG data were originally collected from maps published in 1970. Extensive revisions have been made and no data source more than 5 years old was used in this update. In addition, text files containing information such as place names and population have been added for the first time. The records in these text files can be related to corresponding features in the DLG data files. Metadata that comply with the Federal Geographic Data Committee Content Standards for Digital Geospatial Metadata are included for each category of DLG data.

"SMART": A Compact and Handy FORTRAN Code for the Physics of Stellar Atmospheres

NASA Astrophysics Data System (ADS)

Sapar, A.; Poolamäe, R.

2003-01-01

A new computer code SMART (Spectra from Model Atmospheres by Radiative Transfer) for computing the stellar spectra, forming in plane-parallel atmospheres, has been compiled by us and A. Aret. To guarantee wide compatibility of the code with shell environment, we chose FORTRAN-77 as programming language and tried to confine ourselves to common part of its numerous versions both in WINDOWS and LINUX. SMART can be used for studies of several processes in stellar atmospheres. The current version of the programme is undergoing rapid changes due to our goal to elaborate a simple, handy and compact code. Instead of linearisation (being a mathematical method of recurrent approximations) we propose to use the physical evolutionary changes or in other words relaxation of quantum state populations rates from LTE to NLTE has been studied using small number of NLTE states. This computational scheme is essentially simpler and more compact than the linearisation. This relaxation scheme enables using instead of the Λ-iteration procedure a physically changing emissivity (or the source function) which incorporates in itself changing Menzel coefficients for NLTE quantum state populations. However, the light scattering on free electrons is in the terms of Feynman graphs a real second-order quantum process and cannot be reduced to consequent processes of absorption and emission as in the case of radiative transfer in spectral lines. With duly chosen input parameters the code SMART enables computing radiative acceleration to the matter of stellar atmosphere in turbulence clumps. This also enables to connect the model atmosphere in more detail with the problem of the stellar wind triggering. Another problem, which has been incorporated into the computer code SMART, is diffusion of chemical elements and their isotopes in the atmospheres of chemically peculiar (CP) stars due to usual radiative acceleration and the essential additional acceleration generated by the light-induced drift. As a special case, using duly chosen pixels on the stellar disk, the spectrum of rotating star can be computed. No instrumental broadening has been incorporated in the code of SMART. To facilitate study of stellar spectra, a GUI (Graphical User Interface) with selection of labels by ions has been compiled to study the spectral lines of different elements and ions in the computed emergent flux. An amazing feature of SMART is that its code is very short: it occupies only 4 two-sided two-column A4 sheets in landscape format. In addition, if well commented, it is quite easily readable and understandable. We have used the tactics of writing the comments on the right-side margin (columns starting from 73). Such short code has been composed widely using the unified input physics (for example the ionisation cross-sections for bound-free transitions and the electron and ion collision rates). As current restriction to the application area of the present version of the SMART is that molecules are since ignored. Thus, it can be used only for luke and hot stellar atmospheres. In the computer code we have tried to avoid bulky often over-optimised methods, primarily meant to spare the time of computations. For instance, we compute the continuous absorption coefficient at every wavelength. Nevertheless, during an hour by the personal computer in our disposal AMD Athlon XP 1700+, 512MB DDRAM) a stellar spectrum with spectral step resolution λ / dλ = 3D100,000 for spectral interval 700 -- 30,000 Å is computed. The model input data and the line data used by us are both the ones computed and compiled by R. Kurucz. In order to follow presence and representability of quantum states and to enumerate them for NLTE studies a C++ code, transforming the needed data to the LATEX version, has been compiled. Thus we have composed a quantum state list for all neutrals and ions in the Kurucz file 'gfhyperall.dat'. The list enables more adequately to compose the concept of super-states, including partly correlating super-states. We are grateful to R. Kurucz for making available by CD-ROMs and Internet his computer codes ATLAS and SYNTHE used by us as a starting point in composing of the new computer code. We are also grateful to Estonian Science Foundation for grant ESF-4701.

Monolithically, widely tunable quantum cascade lasers based on a heterogeneous active region design.

PubMed

Zhou, Wenjia; Bandyopadhyay, Neelanjan; Wu, Donghai; McClintock, Ryan; Razeghi, Manijeh

2016-06-08

Quantum cascade lasers (QCLs) have become important laser sources for accessing the mid-infrared (mid-IR) spectral range, achieving watt-level continuous wave operation in a compact package at room temperature. However, up to now, wavelength tuning, which is desirable for most applications, has relied on external cavity feedback or exhibited a limited monolithic tuning range. Here we demonstrate a widely tunable QCL source over the 6.2 to 9.1 μm wavelength range with a single emitting aperture by integrating an eight-laser sampled grating distributed feedback laser array with an on-chip beam combiner. The laser gain medium is based on a five-core heterogeneous QCL wafer. A compact tunable laser system was built to drive the individual lasers within the array and produce any desired wavelength within the available spectral range. A rapid, broadband spectral measurement (520 cm(-1)) of methane using the tunable laser source shows excellent agreement to a measurement made using a standard low-speed infrared spectrometer. This monolithic, widely tunable laser technology is compact, with no moving parts, and will open new opportunities for MIR spectroscopy and chemical sensing.

Monolithically, widely tunable quantum cascade lasers based on a heterogeneous active region design

PubMed Central

Zhou, Wenjia; Bandyopadhyay, Neelanjan; Wu, Donghai; McClintock, Ryan; Razeghi, Manijeh

2016-01-01

Quantum cascade lasers (QCLs) have become important laser sources for accessing the mid-infrared (mid-IR) spectral range, achieving watt-level continuous wave operation in a compact package at room temperature. However, up to now, wavelength tuning, which is desirable for most applications, has relied on external cavity feedback or exhibited a limited monolithic tuning range. Here we demonstrate a widely tunable QCL source over the 6.2 to 9.1 μm wavelength range with a single emitting aperture by integrating an eight-laser sampled grating distributed feedback laser array with an on-chip beam combiner. The laser gain medium is based on a five-core heterogeneous QCL wafer. A compact tunable laser system was built to drive the individual lasers within the array and produce any desired wavelength within the available spectral range. A rapid, broadband spectral measurement (520 cm−1) of methane using the tunable laser source shows excellent agreement to a measurement made using a standard low-speed infrared spectrometer. This monolithic, widely tunable laser technology is compact, with no moving parts, and will open new opportunities for MIR spectroscopy and chemical sensing. PMID:27270634

Subleading soft theorem for multiple soft gravitons

NASA Astrophysics Data System (ADS)

Chakrabarti, Subhroneel; Kashyap, Sitender Pratap; Sahoo, Biswajit; Sen, Ashoke; Verma, Mritunjay

2017-12-01

We derive the subleading soft graviton theorem in a generic quantum theory of gravity for arbitrary number of soft external gravitons and arbitrary number of finite energy external states carrying arbitrary mass and spin. Our results are valid to all orders in perturbation theory when the number of non-compact space-time dimensions is six or more, but only for tree amplitudes for five or less non-compact space-time dimensions due to enhanced contribution to loop amplitudes from the infrared region.

Exploring quantum computing application to satellite data assimilation

NASA Astrophysics Data System (ADS)

Cheung, S.; Zhang, S. Q.

2015-12-01

This is an exploring work on potential application of quantum computing to a scientific data optimization problem. On classical computational platforms, the physical domain of a satellite data assimilation problem is represented by a discrete variable transform, and classical minimization algorithms are employed to find optimal solution of the analysis cost function. The computation becomes intensive and time-consuming when the problem involves large number of variables and data. The new quantum computer opens a very different approach both in conceptual programming and in hardware architecture for solving optimization problem. In order to explore if we can utilize the quantum computing machine architecture, we formulate a satellite data assimilation experimental case in the form of quadratic programming optimization problem. We find a transformation of the problem to map it into Quadratic Unconstrained Binary Optimization (QUBO) framework. Binary Wavelet Transform (BWT) will be applied to the data assimilation variables for its invertible decomposition and all calculations in BWT are performed by Boolean operations. The transformed problem will be experimented as to solve for a solution of QUBO instances defined on Chimera graphs of the quantum computer.

Physical plausibility of cold star models satisfying Karmarkar conditions

NASA Astrophysics Data System (ADS)

Fuloria, Pratibha; Pant, Neeraj

2017-11-01

In the present article, we have obtained a new well behaved solution to Einstein's field equations in the background of Karmarkar spacetime. The solution has been used for stellar modelling within the demand of current observational evidences. All the physical parameters are well behaved inside the stellar interior and our model satisfies all the required conditions to be physically realizable. The obtained compactness parameter is within the Buchdahl limit, i.e. 2M/R ≤ 8/9 . The TOV equation is well maintained inside the fluid spheres. The stability of the models has been further confirmed by using Herrera's cracking method. The models proposed in the present work are compatible with observational data of compact objects 4U1608-52 and PSRJ1903+327. The necessary graphs have been shown to authenticate the physical viability of our models.

Universal Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Fitzsimons, Joseph; Kashefi, Elham

2012-02-01

Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's inputs, outputs and computation remain private. Recently we proposed a universal unconditionally secure BQC scheme, based on the conceptual framework of the measurement-based quantum computing model, where the client only needs to be able to prepare single qubits in separable states randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. Here we present a refinement of the scheme which vastly expands the class of quantum circuits which can be directly implemented as a blind computation, by introducing a new class of resource states which we term dotted-complete graph states and expanding the set of single qubit states the client is required to prepare. These two modifications significantly simplify the overall protocol and remove the previously present restriction that only nearest-neighbor circuits could be implemented as blind computations directly. As an added benefit, the refined protocol admits a substantially more intuitive and simplified verification mechanism, allowing the correctness of a blind computation to be verified with arbitrarily small probability of error.

Water-level altitudes 2001, water-level changes 1977-2001 and 2000-2001, and compaction 1973-2000 in the Chicot and Evangeline aquifers, Houston-Galveston region, Texas

USGS Publications Warehouse

Coplin, L.S.; Houston, Natalie A.; Brown, Dexter W.

2001-01-01

This report is one in an annual series of reports that depicts water-level altitudes and water-level changes since 1977 and compaction since 1973 in the Chicot and Evangeline aquifers in the Houston-Galveston region, Texas. The report, prepared in cooperation with the City of Houston and the Harris-Galveston Coastal Subsidence District, presents maps for the Chicot and Evangeline aquifers showing the approximate water-level altitudes in wells in 2001 (figs 1,4) and approximate water-level changes in wells from 1977 to 2001 and from 2000 to 2001 (figs 2,3,5,6), a map showing extensometer site locations (fig. 7), and graphs showing measured compaction of subserface material at selected sites from 1973 to 2000 (fig. 8). The most recent previously published water-level-altitude maps and water-level-change maps for the two aquifers in the region are by Coplin and Santos. (2000). The Houston-Galveston region comprises Harris and Galveston Counties and adjacent parts of Brazoria, Fort Bend, Waller, Montgomery, Liberty, and Chambers Counties.

Metropolitan Quantum Key Distribution with Silicon Photonics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bunandar, Darius; Lentine, Anthony; Lee, Catherine

Photonic integrated circuits provide a compact and stable platform for quantum photonics. Here we demonstrate a silicon photonics quantum key distribution (QKD) encoder in the first high-speed polarization-based QKD field tests. The systems reach composable secret key rates of 1.039 Mbps in a local test (on a 103.6-m fiber with a total emulated loss of 9.2 dB) and 157 kbps in an intercity metropolitan test (on a 43-km fiber with 16.4 dB loss). Our results represent the highest secret key generation rate for polarization-based QKD experiments at a standard telecom wavelength and demonstrate photonic integrated circuits as a promising, scalablemore » resource for future formation of metropolitan quantum-secure communications networks.« less

Metropolitan Quantum Key Distribution with Silicon Photonics

DOE PAGES

Bunandar, Darius; Lentine, Anthony; Lee, Catherine; ...

2018-04-06

Photonic integrated circuits provide a compact and stable platform for quantum photonics. Here we demonstrate a silicon photonics quantum key distribution (QKD) encoder in the first high-speed polarization-based QKD field tests. The systems reach composable secret key rates of 1.039 Mbps in a local test (on a 103.6-m fiber with a total emulated loss of 9.2 dB) and 157 kbps in an intercity metropolitan test (on a 43-km fiber with 16.4 dB loss). Our results represent the highest secret key generation rate for polarization-based QKD experiments at a standard telecom wavelength and demonstrate photonic integrated circuits as a promising, scalablemore » resource for future formation of metropolitan quantum-secure communications networks.« less

Grassmann matrix quantum mechanics

DOE PAGES

Anninos, Dionysios; Denef, Frederik; Monten, Ruben

2016-04-21

We explore quantum mechanical theories whose fundamental degrees of freedom are rectangular matrices with Grassmann valued matrix elements. We study particular models where the low energy sector can be described in terms of a bosonic Hermitian matrix quantum mechanics. We describe the classical curved phase space that emerges in the low energy sector. The phase space lives on a compact Kähler manifold parameterized by a complex matrix, of the type discovered some time ago by Berezin. The emergence of a semiclassical bosonic matrix quantum mechanics at low energies requires that the original Grassmann matrices be in the long rectangular limit.more » In conclusion, we discuss possible holographic interpretations of such matrix models which, by construction, are endowed with a finite dimensional Hilbert space.« less

Metropolitan Quantum Key Distribution with Silicon Photonics

NASA Astrophysics Data System (ADS)

Bunandar, Darius; Lentine, Anthony; Lee, Catherine; Cai, Hong; Long, Christopher M.; Boynton, Nicholas; Martinez, Nicholas; DeRose, Christopher; Chen, Changchen; Grein, Matthew; Trotter, Douglas; Starbuck, Andrew; Pomerene, Andrew; Hamilton, Scott; Wong, Franco N. C.; Camacho, Ryan; Davids, Paul; Urayama, Junji; Englund, Dirk

2018-04-01

Photonic integrated circuits provide a compact and stable platform for quantum photonics. Here we demonstrate a silicon photonics quantum key distribution (QKD) encoder in the first high-speed polarization-based QKD field tests. The systems reach composable secret key rates of 1.039 Mbps in a local test (on a 103.6-m fiber with a total emulated loss of 9.2 dB) and 157 kbps in an intercity metropolitan test (on a 43-km fiber with 16.4 dB loss). Our results represent the highest secret key generation rate for polarization-based QKD experiments at a standard telecom wavelength and demonstrate photonic integrated circuits as a promising, scalable resource for future formation of metropolitan quantum-secure communications networks.

Multimode optomechanical system in the quantum regime.

PubMed

Nielsen, William Hvidtfelt Padkær; Tsaturyan, Yeghishe; Møller, Christoffer Bo; Polzik, Eugene S; Schliesser, Albert

2017-01-03

We realize a simple and robust optomechanical system with a multitude of long-lived (Q > 10 7 ) mechanical modes in a phononic-bandgap shielded membrane resonator. An optical mode of a compact Fabry-Perot resonator detects these modes' motion with a measurement rate (96 kHz) that exceeds the mechanical decoherence rates already at moderate cryogenic temperatures (10 K). Reaching this quantum regime entails, inter alia, quantum measurement backaction exceeding thermal forces and thus strong optomechanical quantum correlations. In particular, we observe ponderomotive squeezing of the output light mediated by a multitude of mechanical resonator modes, with quantum noise suppression up to -2.4 dB (-3.6 dB if corrected for detection losses) and bandwidths ≲90 kHz. The multimode nature of the membrane and Fabry-Perot resonators will allow multimode entanglement involving electromagnetic, mechanical, and spin degrees of freedom.

Multimode optomechanical system in the quantum regime

NASA Astrophysics Data System (ADS)

Hvidtfelt Padkær Nielsen, William; Tsaturyan, Yeghishe; Møller, Christoffer Bo; Polzik, Eugene S.; Schliesser, Albert

2017-01-01

We realize a simple and robust optomechanical system with a multitude of long-lived (Q > 107) mechanical modes in a phononic-bandgap shielded membrane resonator. An optical mode of a compact Fabry-Perot resonator detects these modes’ motion with a measurement rate (96 kHz) that exceeds the mechanical decoherence rates already at moderate cryogenic temperatures (10 K). Reaching this quantum regime entails, inter alia, quantum measurement backaction exceeding thermal forces and thus strong optomechanical quantum correlations. In particular, we observe ponderomotive squeezing of the output light mediated by a multitude of mechanical resonator modes, with quantum noise suppression up to -2.4 dB (-3.6 dB if corrected for detection losses) and bandwidths ≲90 kHz. The multimode nature of the membrane and Fabry-Perot resonators will allow multimode entanglement involving electromagnetic, mechanical, and spin degrees of freedom.

Hybrid VLSI/QCA Architecture for Computing FFTs

NASA Technical Reports Server (NTRS)

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

2003-01-01

A data-processor architecture that would incorporate elements of both conventional very-large-scale integrated (VLSI) circuitry and quantum-dot cellular automata (QCA) has been proposed to enable the highly parallel and systolic computation of fast Fourier transforms (FFTs). The proposed circuit would complement the QCA-based circuits described in several prior NASA Tech Briefs articles, namely Implementing Permutation Matrices by Use of Quantum Dots (NPO-20801), Vol. 25, No. 10 (October 2001), page 42; Compact Interconnection Networks Based on Quantum Dots (NPO-20855) Vol. 27, No. 1 (January 2003), page 32; and Bit-Serial Adder Based on Quantum Dots (NPO-20869), Vol. 27, No. 1 (January 2003), page 35. The cited prior articles described the limitations of very-large-scale integrated (VLSI) circuitry and the major potential advantage afforded by QCA. To recapitulate: In a VLSI circuit, signal paths that are required not to interact with each other must not cross in the same plane. In contrast, for reasons too complex to describe in the limited space available for this article, suitably designed and operated QCAbased signal paths that are required not to interact with each other can nevertheless 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.

Hierarchical sequencing of online social graphs

NASA Astrophysics Data System (ADS)

Andjelković, Miroslav; Tadić, Bosiljka; Maletić, Slobodan; Rajković, Milan

2015-10-01

In online communications, patterns of conduct of individual actors and use of emotions in the process can lead to a complex social graph exhibiting multilayered structure and mesoscopic communities. Using simplicial complexes representation of graphs, we investigate in-depth topology of the online social network constructed from MySpace dialogs which exhibits original community structure. A simulation of emotion spreading in this network leads to the identification of two emotion-propagating layers. Three topological measures are introduced, referred to as the structure vectors, which quantify graph's architecture at different dimension levels. Notably, structures emerging through shared links, triangles and tetrahedral faces, frequently occur and range from tree-like to maximal 5-cliques and their respective complexes. On the other hand, the structures which spread only negative or only positive emotion messages appear to have much simpler topology consisting of links and triangles. The node's structure vector represents the number of simplices at each topology level in which the node resides and the total number of such simplices determines what we define as the node's topological dimension. The presented results suggest that the node's topological dimension provides a suitable measure of the social capital which measures the actor's ability to act as a broker in compact communities, the so called Simmelian brokerage. We also generalize the results to a wider class of computer-generated networks. Investigating components of the node's vector over network layers reveals that same nodes develop different socio-emotional relations and that the influential nodes build social capital by combining their connections in different layers.

On Functional Module Detection in Metabolic Networks

PubMed Central

Koch, Ina; Ackermann, Jörg

2013-01-01

Functional modules of metabolic networks are essential for understanding the metabolism of an organism as a whole. With the vast amount of experimental data and the construction of complex and large-scale, often genome-wide, models, the computer-aided identification of functional modules becomes more and more important. Since steady states play a key role in biology, many methods have been developed in that context, for example, elementary flux modes, extreme pathways, transition invariants and place invariants. Metabolic networks can be studied also from the point of view of graph theory, and algorithms for graph decomposition have been applied for the identification of functional modules. A prominent and currently intensively discussed field of methods in graph theory addresses the Q-modularity. In this paper, we recall known concepts of module detection based on the steady-state assumption, focusing on transition-invariants (elementary modes) and their computation as minimal solutions of systems of Diophantine equations. We present the Fourier-Motzkin algorithm in detail. Afterwards, we introduce the Q-modularity as an example for a useful non-steady-state method and its application to metabolic networks. To illustrate and discuss the concepts of invariants and Q-modularity, we apply a part of the central carbon metabolism in potato tubers (Solanum tuberosum) as running example. The intention of the paper is to give a compact presentation of known steady-state concepts from a graph-theoretical viewpoint in the context of network decomposition and reduction and to introduce the application of Q-modularity to metabolic Petri net models. PMID:24958145

Electro-optic routing of photons from a single quantum dot in photonic integrated circuits

NASA Astrophysics Data System (ADS)

Midolo, Leonardo; Hansen, Sofie L.; Zhang, Weili; Papon, Camille; Schott, Rüdiger; Ludwig, Arne; Wieck, Andreas D.; Lodahl, Peter; Stobbe, Søren

2017-12-01

Recent breakthroughs in solid-state photonic quantum technologies enable generating and detecting single photons with near-unity efficiency as required for a range of photonic quantum technologies. The lack of methods to simultaneously generate and control photons within the same chip, however, has formed a main obstacle to achieving efficient multi-qubit gates and to harness the advantages of chip-scale quantum photonics. Here we propose and demonstrate an integrated voltage-controlled phase shifter based on the electro-optic effect in suspended photonic waveguides with embedded quantum emitters. The phase control allows building a compact Mach-Zehnder interferometer with two orthogonal arms, taking advantage of the anisotropic electro-optic response in gallium arsenide. Photons emitted by single self-assembled quantum dots can be actively routed into the two outputs of the interferometer. These results, together with the observed sub-microsecond response time, constitute a significant step towards chip-scale single-photon-source de-multiplexing, fiber-loop boson sampling, and linear optical quantum computing.

Algebraic Bethe ansatz for U(1) invariant integrable models: Compact and non-compact applications

NASA Astrophysics Data System (ADS)

Martins, M. J.; Melo, C. S.

2009-10-01

We apply the algebraic Bethe ansatz developed in our previous paper [C.S. Melo, M.J. Martins, Nucl. Phys. B 806 (2009) 567] to three different families of U(1) integrable vertex models with arbitrary N bond states. These statistical mechanics systems are based on the higher spin representations of the quantum group U[SU(2)] for both generic and non-generic values of q as well as on the non-compact discrete representation of the SL(2,R) algebra. We present for all these models the explicit expressions for both the on-shell and the off-shell properties associated to the respective transfer matrices eigenvalue problems. The amplitudes governing the vectors not parallel to the Bethe states are shown to factorize in terms of elementary building blocks functions. The results for the non-compact SL(2,R) model are argued to be derived from those obtained for the compact systems by taking suitable N→∞ limits. This permits us to study the properties of the non-compact SL(2,R) model starting from systems with finite degrees of freedom.

Some Properties of Generalized Connections in Quantum Gravity

NASA Astrophysics Data System (ADS)

Velhinho, J. M.

2002-12-01

Theories of connections play an important role in fundamental interactions, including Yang-Mills theories and gravity in the Ashtekar formulation. Typically in such cases, the classical configuration space {A}/ {G} of connections modulo gauge transformations is an infinite dimensional non-linear space of great complexity. Having in mind a rigorous quantization procedure, methods of functional calculus in an extension of {A}/ {G} have been developed. For a compact gauge group G, the compact space /line { {A}{ {/}} {G}} ( ⊃ {A}/ {G}) introduced by Ashtekar and Isham using C*-algebraic methods is a natural candidate to replace {A}/ {G} in the quantum context, 1 allowing the construction of diffeomorphism invariant measures. 2,3,4 Equally important is the space of generalized connections bar {A} introduced in a similar way by Baez. 5 bar {A} is particularly useful for the definition of vector fields in /line { {A}{ {/}} {G}} , fundamental in the construction of quantum observables. 6 These works crucially depend on the use of (generalized) Wilson variables associated to certain types of curves. We will consider the case of piecewise analytic curves, 1,2,5 althought most of the arguments apply equally to the piecewise smooth case. 7,8...

Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.

PubMed

Kundeti, Vamsi K; Rajasekaran, Sanguthevar; Dinh, Hieu; Vaughn, Matthew; Thapar, Vishal

2010-11-15

Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into two broad categories - based on the data structures which they employ. The first class uses an overlap/string graph and the second type uses a de Bruijn graph. However with the recent advances in short read sequencing technology, de Bruijn graph based algorithms seem to play a vital role in practice. Efficient algorithms for building these massive de Bruijn graphs are very essential in large sequencing projects based on short reads. In an earlier work, an O(n/p) time parallel algorithm has been given for this problem. Here n is the size of the input and p is the number of processors. This algorithm enumerates all possible bi-directed edges which can overlap with a node and ends up generating Θ(nΣ) messages (Σ being the size of the alphabet). In this paper we present a Θ(n/p) time parallel algorithm with a communication complexity that is equal to that of parallel sorting and is not sensitive to Σ. The generality of our algorithm makes it very easy to extend it even to the out-of-core model and in this case it has an optimal I/O complexity of Θ(nlog(n/B)Blog(M/B)) (M being the main memory size and B being the size of the disk block). We demonstrate the scalability of our parallel algorithm on a SGI/Altix computer. A comparison of our algorithm with the previous approaches reveals that our algorithm is faster--both asymptotically and practically. We demonstrate the scalability of our sequential out-of-core algorithm by comparing it with the algorithm used by VELVET to build the bi-directed de Bruijn graph. Our experiments reveal that our algorithm can build the graph with a constant amount of memory, which clearly outperforms VELVET. We also provide efficient algorithms for the bi-directed chain compaction problem. The bi-directed de Bruijn graph is a fundamental data structure for any sequence assembly program based on Eulerian approach. Our algorithms for constructing Bi-directed de Bruijn graphs are efficient in parallel and out of core settings. These algorithms can be used in building large scale bi-directed de Bruijn graphs. Furthermore, our algorithms do not employ any all-to-all communications in a parallel setting and perform better than the prior algorithms. Finally our out-of-core algorithm is extremely memory efficient and can replace the existing graph construction algorithm in VELVET.

Electro-mechanical control of an on-chip optical beam splitter containing an embedded quantum emitter.

PubMed

Bishop, Z K; Foster, A P; Royall, B; Bentham, C; Clarke, E; Skolnick, M S; Wilson, L R

2018-05-01

We demonstrate electro-mechanical control of an on-chip GaAs optical beam splitter containing a quantum dot single-photon source. The beam splitter consists of two nanobeam waveguides, which form a directional coupler (DC). The splitting ratio of the DC is controlled by varying the out-of-plane separation of the two waveguides using electromechanical actuation. We reversibly tune the beam splitter between an initial state, with emission into both output arms, and a final state with photons emitted into a single output arm. The device represents a compact and scalable tuning approach for use in III-V semiconductor integrated quantum optical circuits.

Third-harmonic generation of a laser-driven quantum dot with impurity

NASA Astrophysics Data System (ADS)

Sakiroglu, S.; Kilic, D. Gul; Yesilgul, U.; Ungan, F.; Kasapoglu, E.; Sari, H.; Sokmen, I.

2018-06-01

The third-harmonic generation (THG) coefficient for a laser-driven quantum dot with an on-center Gaussian impurity under static magnetic field is theoretically investigated. Laser field effect is treated within the high-frequency Floquet approach and the analytical expression of the THG coefficient is deduced from the compact density-matrix approach. The numerical results demonstrate that the application of intense laser field causes substantial changes on the behavior of THG. In addition the position and magnitude of the resonant peak of THG coefficient is significantly affected by the magnetic field, quantum dot size and the characteristic parameters of the impurity potential.

Applications of absorption spectroscopy using quantum cascade lasers.

PubMed

Zhang, Lizhu; Tian, Guang; Li, Jingsong; Yu, Benli

2014-01-01

Infrared laser absorption spectroscopy (LAS) is a promising modern technique for sensing trace gases with high sensitivity, selectivity, and high time resolution. Mid-infrared quantum cascade lasers, operating in a pulsed or continuous wave mode, have potential as spectroscopic sources because of their narrow linewidths, single mode operation, tunability, high output power, reliability, low power consumption, and compactness. This paper reviews some important developments in modern laser absorption spectroscopy based on the use of quantum cascade laser (QCL) sources. Among the various laser spectroscopic methods, this review is focused on selected absorption spectroscopy applications of QCLs, with particular emphasis on molecular spectroscopy, industrial process control, combustion diagnostics, and medical breath analysis.

Tri-channel single-mode terahertz quantum cascade laser.

PubMed

Wang, Tao; Liu, Jun-Qi; Liu, Feng-Qi; Wang, Li-Jun; Zhang, Jin-Chuan; Wang, Zhan-Guo

2014-12-01

We report on a compact THz quantum cascade laser source emitting at, individually controllable, three different wavelengths (92.6, 93.9, and 95.1 μm). This multiwavelength laser array can be used as a prototype of the emission source of THz wavelength division multiplex (WDM) wireless communication system. The source consists of three tapered single-mode distributed feedback (DFB) terahertz quantum cascade lasers fabricated monolithically on a single chip. All array elements feature longitudinal as well as lateral single-mode in the entire injection range. The peak output powers of individual lasers are 42, 73, and 37 mW at 10 K, respectively.

CMOS-compatible photonic devices for single-photon generation

NASA Astrophysics Data System (ADS)

Xiong, Chunle; Bell, Bryn; Eggleton, Benjamin J.

2016-09-01

Sources of single photons are one of the key building blocks for quantum photonic technologies such as quantum secure communication and powerful quantum computing. To bring the proof-of-principle demonstration of these technologies from the laboratory to the real world, complementary metal-oxide-semiconductor (CMOS)-compatible photonic chips are highly desirable for photon generation, manipulation, processing and even detection because of their compactness, scalability, robustness, and the potential for integration with electronics. In this paper, we review the development of photonic devices made from materials (e.g., silicon) and processes that are compatible with CMOS fabrication facilities for the generation of single photons.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stottmeister, Alexander, E-mail: alexander.stottmeister@gravity.fau.de; Thiemann, Thomas, E-mail: thomas.thiemann@gravity.fau.de

In this article, the second of three, we discuss and develop the basis of a Weyl quantisation for compact Lie groups aiming at loop quantum gravity-type models. This Weyl quantisation may serve as the main mathematical tool to implement the program of space adiabatic perturbation theory in such models. As we already argued in our first article, space adiabatic perturbation theory offers an ideal framework to overcome the obstacles that hinder the direct implementation of the conventional Born-Oppenheimer approach in the canonical formulation of loop quantum gravity. Additionally, we conjecture the existence of a new form of the Segal-Bargmann-Hall “coherentmore » state” transform for compact Lie groups G, which we prove for G = U(1){sup n} and support by numerical evidence for G = SU(2). The reason for conjoining this conjecture with the main topic of this article originates in the observation that the coherent state transform can be used as a basic building block of a coherent state quantisation (Berezin quantisation) for compact Lie groups G. But, as Weyl and Berezin quantisation for ℝ{sup 2d} are intimately related by heat kernel evolution, it is natural to ask whether a similar connection exists for compact Lie groups as well. Moreover, since the formulation of space adiabatic perturbation theory requires a (deformation) quantisation as minimal input, we analyse the question to what extent the coherent state quantisation, defined by the Segal-Bargmann-Hall transform, can serve as basis of the former.« less

Non-CMC Solutions of the Einstein Constraint Equations on Compact Manifolds with Apparent Horizon Boundaries

NASA Astrophysics Data System (ADS)

Holst, Michael; Meier, Caleb; Tsogtgerel, G.

2018-01-01

In this article we continue our effort to do a systematic development of the solution theory for conformal formulations of the Einstein constraint equations on compact manifolds with boundary. By building in a natural way on our recent work in Holst and Tsogtgerel (Class Quantum Gravity 30:205011, 2013), and Holst et al. (Phys Rev Lett 100(16):161101, 2008, Commun Math Phys 288(2):547-613, 2009), and also on the work of Maxwell (J Hyperbolic Differ Eqs 2(2):521-546, 2005a, Commun Math Phys 253(3):561-583, 2005b, Math Res Lett 16(4):627-645, 2009) and Dain (Class Quantum Gravity 21(2):555-573, 2004), under reasonable assumptions on the data we prove existence of both near- and far-from-constant mean curvature (CMC) solutions for a class of Robin boundary conditions commonly used in the literature for modeling black holes, with a third existence result for CMC appearing as a special case. Dain and Maxwell addressed initial data engineering for space-times that evolve to contain black holes, determining solutions to the conformal formulation on an asymptotically Euclidean manifold in the CMC setting, with interior boundary conditions representing excised interior black hole regions. Holst and Tsogtgerel compiled the interior boundary results covered by Dain and Maxwell, and then developed general interior conditions to model the apparent horizon boundary conditions of Dainand Maxwell for compact manifolds with boundary, and subsequently proved existence of solutions to the Lichnerowicz equation on compact manifolds with such boundary conditions. This paper picks up where Holst and Tsogtgerel left off, addressing the general non-CMC case for compact manifolds with boundary. As in our previous articles, our focus here is again on low regularity data and on the interaction between different types of boundary conditions. While our work here serves primarily to extend the solution theory for the compact with boundary case, we also develop several technical tools that have potential for use for other cases.

The Ponzano-Regge Model and Parametric Representation

NASA Astrophysics Data System (ADS)

Li, Dan

2014-04-01

We give a parametric representation of the effective noncommutative field theory derived from a -deformation of the Ponzano-Regge model and define a generalized Kirchhoff polynomial with -correction terms, obtained in a -linear approximation. We then consider the corresponding graph hypersurfaces and the question of how the presence of the correction term affects their motivic nature. We look in particular at the tetrahedron graph, which is the basic case of relevance to quantum gravity. With the help of computer calculations, we verify that the number of points over finite fields of the corresponding hypersurface does not fit polynomials with integer coefficients, hence the hypersurface of the tetrahedron is not polynomially countable. This shows that the correction term can change significantly the motivic properties of the hypersurfaces, with respect to the classical case.

Exact dimension estimation of interacting qubit systems assisted by a single quantum probe

NASA Astrophysics Data System (ADS)

Sone, Akira; Cappellaro, Paola

2017-12-01

Estimating the dimension of an Hilbert space is an important component of quantum system identification. In quantum technologies, the dimension of a quantum system (or its corresponding accessible Hilbert space) is an important resource, as larger dimensions determine, e.g., the performance of quantum computation protocols or the sensitivity of quantum sensors. Despite being a critical task in quantum system identification, estimating the Hilbert space dimension is experimentally challenging. While there have been proposals for various dimension witnesses capable of putting a lower bound on the dimension from measuring collective observables that encode correlations, in many practical scenarios, especially for multiqubit systems, the experimental control might not be able to engineer the required initialization, dynamics, and observables. Here we propose a more practical strategy that relies not on directly measuring an unknown multiqubit target system, but on the indirect interaction with a local quantum probe under the experimenter's control. Assuming only that the interaction model is given and the evolution correlates all the qubits with the probe, we combine a graph-theoretical approach and realization theory to demonstrate that the system dimension can be exactly estimated from the model order of the system. We further analyze the robustness in the presence of background noise of the proposed estimation method based on realization theory, finding that despite stringent constrains on the allowed noise level, exact dimension estimation can still be achieved.

Resumming the large-N approximation for time evolving quantum systems

NASA Astrophysics Data System (ADS)

Mihaila, Bogdan; Dawson, John F.; Cooper, Fred

2001-05-01

In this paper we discuss two methods of resumming the leading and next to leading order in 1/N diagrams for the quartic O(N) model. These two approaches have the property that they preserve both boundedness and positivity for expectation values of operators in our numerical simulations. These approximations can be understood either in terms of a truncation to the infinitely coupled Schwinger-Dyson hierarchy of equations, or by choosing a particular two-particle irreducible vacuum energy graph in the effective action of the Cornwall-Jackiw-Tomboulis formalism. We confine our discussion to the case of quantum mechanics where the Lagrangian is L(x,ẋ)=(12)∑Ni=1x˙2i-(g/8N)[∑Ni=1x2i- r20]2. The key to these approximations is to treat both the x propagator and the x2 propagator on similar footing which leads to a theory whose graphs have the same topology as QED with the x2 propagator playing the role of the photon. The bare vertex approximation is obtained by replacing the exact vertex function by the bare one in the exact Schwinger-Dyson equations for the one and two point functions. The second approximation, which we call the dynamic Debye screening approximation, makes the further approximation of replacing the exact x2 propagator by its value at leading order in the 1/N expansion. These two approximations are compared with exact numerical simulations for the quantum roll problem. The bare vertex approximation captures the physics at large and modest N better than the dynamic Debye screening approximation.

A 980 nm pseudomorphic single quantum well laser for pumping erbium-doped optical fiber amplifiers

NASA Technical Reports Server (NTRS)

Larsson, A.; Forouhar, S.; Cody, J.; Lang, R. J.; Andrekson, P. A.

1990-01-01

The authors have fabricated ridge waveguide pseudomorphic InGaAs/GaAs/AlGaAs GRIN-SCH SQW (graded-index separate-confinement-heterostructure single-quantum-well) lasers, emitting at 980 nm, with a maximum output power of 240 mW from one facet and a 22 percent coupling efficiency into a 1.55-micron single-mode optical fiber. These lasers satisfy the requirements on efficient and compact pump sources for Er3+-doped fiber amplifiers.

High yield and ultrafast sources of electrically triggered entangled-photon pairs based on strain-tunable quantum dots.

PubMed

Zhang, Jiaxiang; Wildmann, Johannes S; Ding, Fei; Trotta, Rinaldo; Huo, Yongheng; Zallo, Eugenio; Huber, Daniel; Rastelli, Armando; Schmidt, Oliver G

2015-12-01

Triggered sources of entangled photon pairs are key components in most quantum communication protocols. For practical quantum applications, electrical triggering would allow the realization of compact and deterministic sources of entangled photons. Entangled-light-emitting-diodes based on semiconductor quantum dots are among the most promising sources that can potentially address this task. However, entangled-light-emitting-diodes are plagued by a source of randomness, which results in a very low probability of finding quantum dots with sufficiently small fine structure splitting for entangled-photon generation (∼10(-2)). Here we introduce strain-tunable entangled-light-emitting-diodes that exploit piezoelectric-induced strains to tune quantum dots for entangled-photon generation. We demonstrate that up to 30% of the quantum dots in strain-tunable entangled-light-emitting-diodes emit polarization-entangled photons. An entanglement fidelity as high as 0.83 is achieved with fast temporal post selection. Driven at high speed, that is 400 MHz, strain-tunable entangled-light-emitting-diodes emerge as promising devices for high data-rate quantum applications.

Compact DFB laser modules with integrated isolator at 935 nm

NASA Astrophysics Data System (ADS)

Reggentin, M.; Thiem, H.; Tsianos, G.; Malach, M.; Hofmann, J.; Plocke, T.; Kneier, M.; Richter, L.

2018-02-01

New developments in industrial applications and applications under rough environmental conditions within the field of spectroscopy and quantum technology in the 935 nm wavelength regime demand new compact, stable and robust laser systems. Beside a stable laser source the integration of a compact optical isolator is necessary to reduce size and power consumption for the whole laser system. The integration of a suitable optical isolator suppresses back reflections from the following optical system efficiently. However, the miniaturization of the optics inside the package leads to high optical power density levels that make a more detailed analysis of the components and their laser damage threshold necessary. We present test results on compact stable DFB laser sources (butterfly style packages) with newly integrated optical isolators operating around 935 nm. The presented data includes performance and lifetime tests for the laser diodes as well as package components. Overall performance data of the packaged laser diodes will be shown as well.

From Feynman rules to conserved quantum numbers, I

NASA Astrophysics Data System (ADS)

Nogueira, P.

2017-05-01

In the context of Quantum Field Theory (QFT) there is often the need to find sets of graph-like diagrams (the so-called Feynman diagrams) for a given physical model. If negative, the answer to the related problem 'Are there any diagrams with this set of external fields?' may settle certain physical questions at once. Here the latter problem is formulated in terms of a system of linear diophantine equations derived from the Lagrangian density, from which necessary conditions for the existence of the required diagrams may be obtained. Those conditions are equalities that look like either linear diophantine equations or linear modular (i.e. congruence) equations, and may be found by means of fairly simple algorithms that involve integer computations. The diophantine equations so obtained represent (particle) number conservation rules, and are related to the conserved (additive) quantum numbers that may be assigned to the fields of the model.

Simple way to calculate a UV-finite one-loop quantum energy in the Randall-Sundrum model

NASA Astrophysics Data System (ADS)

Altshuler, Boris L.

2017-04-01

The surprising simplicity of Barvinsky-Nesterov or equivalently Gelfand-Yaglom methods of calculation of quantum determinants permits us to obtain compact expressions for a UV-finite difference of one-loop quantum energies for two arbitrary values of the parameter of the double-trace asymptotic boundary conditions. This result generalizes the Gubser and Mitra calculation for the particular case of difference of "regular" and "irregular" one-loop energies in the one-brane Randall-Sundrum model. The approach developed in the paper also allows us to get "in one line" the one-loop quantum energies in the two-brane Randall-Sundrum model. The relationship between "one-loop" expressions corresponding to the mixed Robin and to double-trace asymptotic boundary conditions is traced.

A high-temperature single-photon source from nanowire quantum dots.

PubMed

Tribu, Adrien; Sallen, Gregory; Aichele, Thomas; André, Régis; Poizat, Jean-Philippe; Bougerol, Catherine; Tatarenko, Serge; Kheng, Kuntheak

2008-12-01

We present a high-temperature single-photon source based on a quantum dot inside a nanowire. The nanowires were grown by molecular beam epitaxy in the vapor-liquid-solid growth mode. We utilize a two-step process that allows a thin, defect-free ZnSe nanowire to grow on top of a broader, cone-shaped nanowire. Quantum dots are formed by incorporating a narrow zone of CdSe into the nanowire. We observe intense and highly polarized photoluminescence even from a single emitter. Efficient photon antibunching is observed up to 220 K, while conserving a normalized antibunching dip of at most 36%. This is the highest reported temperature for single-photon emission from a nonblinking quantum-dot source and principally allows compact and cheap operation by using Peltier cooling.

The generalized Lyapunov theorem and its application to quantum channels

NASA Astrophysics Data System (ADS)

Burgarth, Daniel; Giovannetti, Vittorio

2007-05-01

We give a simple and physically intuitive necessary and sufficient condition for a map acting on a compact metric space to be mixing (i.e. infinitely many applications of the map transfer any input into a fixed convergency point). This is a generalization of the 'Lyapunov direct method'. First we prove this theorem in topological spaces and for arbitrary continuous maps. Finally we apply our theorem to maps which are relevant in open quantum systems and quantum information, namely quantum channels. In this context, we also discuss the relations between mixing and ergodicity (i.e. the property that there exists only a single input state which is left invariant by a single application of the map) showing that the two are equivalent when the invariant point of the ergodic map is pure.

Optical gain for the interband optical transition in InAsP/InP quantum well wire in the influence of laser field intensity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Saravanan, S.; Peter, A. John, E-mail: a.john.peter@gmail.com

Intense high frequency laser field induced electronic and optical properties of heavy hole exciton in the InAs{sub 0.8}P{sub 0.2}/InP quantum wire is studied taking into account the geometrical confinement effect. Laser field related exciton binding energies and the optical band gap in the InAs{sub 0.8}P{sub 0.2}/InP quantum well wire are investigated. The optical gain, for the interband optical transition, as a function of photon energy, in the InAs{sub 0.8}P{sub 0.2}/InP quantum wire, is obtained in the presence of intense laser field. The compact density matrix method is employed to obtain the optical gain. The obtained optical gain in group III-Vmore » narrow quantum wire can be applied for achieving the preferred telecommunication wavelength.« less

Multimode optomechanical system in the quantum regime

PubMed Central

Nielsen, William Hvidtfelt Padkær; Tsaturyan, Yeghishe; Møller, Christoffer Bo; Polzik, Eugene S.; Schliesser, Albert

2017-01-01

We realize a simple and robust optomechanical system with a multitude of long-lived (Q > 107) mechanical modes in a phononic-bandgap shielded membrane resonator. An optical mode of a compact Fabry–Perot resonator detects these modes’ motion with a measurement rate (96 kHz) that exceeds the mechanical decoherence rates already at moderate cryogenic temperatures (10 K). Reaching this quantum regime entails, inter alia, quantum measurement backaction exceeding thermal forces and thus strong optomechanical quantum correlations. In particular, we observe ponderomotive squeezing of the output light mediated by a multitude of mechanical resonator modes, with quantum noise suppression up to −2.4 dB (−3.6 dB if corrected for detection losses) and bandwidths ≲90 kHz. The multimode nature of the membrane and Fabry–Perot resonators will allow multimode entanglement involving electromagnetic, mechanical, and spin degrees of freedom. PMID:27999182

A homodyne detector integrated onto a photonic chip for measuring quantum states and generating random numbers

NASA Astrophysics Data System (ADS)

Raffaelli, Francesco; Ferranti, Giacomo; Mahler, Dylan H.; Sibson, Philip; Kennard, Jake E.; Santamato, Alberto; Sinclair, Gary; Bonneau, Damien; Thompson, Mark G.; Matthews, Jonathan C. F.

2018-04-01

Optical homodyne detection has found use as a characterisation tool in a range of quantum technologies. So far implementations have been limited to bulk optics. Here we present the optical integration of a homodyne detector onto a silicon photonics chip. The resulting device operates at high speed, up 150 MHz, it is compact and it operates with low noise, quantified with 11 dB clearance between shot noise and electronic noise. We perform on-chip quantum tomography of coherent states with the detector and show that it meets the requirements for characterising more general quantum states of light. We also show that the detector is able to produce quantum random numbers at a rate of 1.2 Gbps, by measuring the vacuum state of the electromagnetic field and applying off-line post processing. The produced random numbers pass all the statistical tests provided by the NIST test suite.

A compact design for the Josephson mixer: The lumped element circuit

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pillet, J.-D.; Collège de France, 11 place Marcelin Berthelot, 75005 Paris; Flurin, E.

2015-06-01

We present a compact and efficient design in terms of gain, bandwidth, and dynamical range for the Josephson mixer, the superconducting circuit performing three-wave mixing at microwave frequencies. In an all lumped-element based circuit with galvanically coupled ports, we demonstrate nondegenerate amplification for microwave signals over a bandwidth up to 50 MHz for a power gain of 20 dB. The quantum efficiency of the mixer is shown to be about 70%, and its saturation power reaches −112 dBm.

Gravitational Waves and Multi-Messenger Astronomy

NASA Technical Reports Server (NTRS)

Centrella, Joan M.

2010-01-01

Gravitational waves are produced by a wide variety of sources throughout the cosmos, including the mergers of black hole and neutron star binaries/compact objects spiraling into central black holes in galactic nuclei, close compact binaries/and phase transitions and quantum fluctuations in the early universe. Observing these signals can bring new, and often very precise, information about their sources across vast stretches of cosmic time. In this talk we will focus on thee opening of this gravitational-wave window on the universe, highlighting new opportunities for discovery and multi-messenger astronomy.

Design of a universal logic block for fault-tolerant realization of any logic operation in trapped-ion quantum circuits

NASA Astrophysics Data System (ADS)

Goudarzi, H.; Dousti, M. J.; Shafaei, A.; Pedram, M.

2014-05-01

This paper presents a physical mapping tool for quantum circuits, which generates the optimal universal logic block (ULB) that can, on average, perform any logical fault-tolerant (FT) quantum operations with the minimum latency. The operation scheduling, placement, and qubit routing problems tackled by the quantum physical mapper are highly dependent on one another. More precisely, the scheduling solution affects the quality of the achievable placement solution due to resource pressures that may be created as a result of operation scheduling, whereas the operation placement and qubit routing solutions influence the scheduling solution due to resulting distances between predecessor and current operations, which in turn determines routing latencies. The proposed flow for the quantum physical mapper captures these dependencies by applying (1) a loose scheduling step, which transforms an initial quantum data flow graph into one that explicitly captures the no-cloning theorem of the quantum computing and then performs instruction scheduling based on a modified force-directed scheduling approach to minimize the resource contention and quantum circuit latency, (2) a placement step, which uses timing-driven instruction placement to minimize the approximate routing latencies while making iterative calls to the aforesaid force-directed scheduler to correct scheduling levels of quantum operations as needed, and (3) a routing step that finds dynamic values of routing latencies for the qubits. In addition to the quantum physical mapper, an approach is presented to determine the single best ULB size for a target quantum circuit by examining the latency of different FT quantum operations mapped onto different ULB sizes and using information about the occurrence frequency of operations on critical paths of the target quantum algorithm to weigh these latencies. Experimental results show an average latency reduction of about 40 % compared to previous work.

Polarized linewidth-controllable double-trapping electromagnetically induced transparency spectra in a resonant plasmon nanocavity

PubMed Central

Wang, Luojia; Gu, Ying; Chen, Hongyi; Zhang, Jia-Yu; Cui, Yiping; Gerardot, Brian D.; Gong, Qihuang

2013-01-01

Surface plasmons with ultrasmall optical mode volume and strong near field enhancement can be used to realize nanoscale light-matter interaction. Combining surface plasmons with the quantum system provides the possibility of nanoscale realization of important quantum optical phenomena, including the electromagnetically induced transparency (EIT), which has many applications in nonlinear quantum optics and quantum information processing. Here, using a custom-designed resonant plasmon nanocavity, we demonstrate polarized position-dependent linewidth-controllable EIT spectra at the nanoscale. We analytically obtain the double coherent population trapping conditions in a double-Λ quantum system with crossing damping, which give two transparent points in the EIT spectra. The linewidths of the three peaks are extremely sensitive to the level spacing of the excited states, the Rabi frequencies and detunings of pump fields, and the Purcell factors. In particular the linewidth of the central peak is exceptionally narrow. The hybrid system may have potential applications in ultra-compact plasmon-quantum devices. PMID:24096943

A self-contained quantum harmonic engine

NASA Astrophysics Data System (ADS)

Reid, B.; Pigeon, S.; Antezza, M.; De Chiara, G.

2017-12-01

We propose a system made of three quantum harmonic oscillators as a compact quantum engine for producing mechanical work. The three oscillators play respectively the role of the hot bath, the working medium and the cold bath. The working medium performs an Otto cycle during which its frequency is changed and it is sequentially coupled to each of the two other oscillators. As the two environments are finite, the lifetime of the machine is finite and after a number of cycles it stops working and needs to be reset. Remarkably, we show that this machine can extract more than 90% of the available energy during 70 cycles. Differently from usually investigated infinite-reservoir configurations, this machine allows the protection of induced quantum correlations and we analyse the entanglement and quantum discord generated during the strokes. Interestingly, we show that high work generation is always accompanied by large quantum correlations. Our predictions can be useful for energy management at the nanoscale, and can be relevant for experiments with trapped ions and experiments with light in integrated optical circuits.

Quantum dust magnetosonic waves with spin and exchange correlation effects

NASA Astrophysics Data System (ADS)

Maroof, R.; Mushtaq, A.; Qamar, A.

2016-01-01

Dust magnetosonic waves are studied in degenerate dusty plasmas with spin and exchange correlation effects. Using the fluid equations of magnetoplasma with quantum corrections due to the Bohm potential, temperature degeneracy, spin magnetization energy, and exchange correlation, a generalized dispersion relation is derived. Spin effects are incorporated via spin force and macroscopic spin magnetization current. The exchange-correlation potentials are used, based on the adiabatic local-density approximation, and can be described as a function of the electron density. For three different values of angle, the dispersion relation is reduced to three different modes under the low frequency magnetohydrodynamic assumptions. It is found that the effects of quantum corrections in the presence of dust concentration significantly modify the dispersive properties of these modes. The results are useful for understanding numerous collective phenomena in quantum plasmas, such as those in compact astrophysical objects (e.g., the cores of white dwarf stars and giant planets) and in plasma-assisted nanotechnology (e.g., quantum diodes, quantum free-electron lasers, etc.).

Photon-Number-Resolving Transition-Edge Sensors for the Metrology of Quantum Light Sources

NASA Astrophysics Data System (ADS)

Schmidt, M.; von Helversen, M.; López, M.; Gericke, F.; Schlottmann, E.; Heindel, T.; Kück, S.; Reitzenstein, S.; Beyer, J.

2018-05-01

Low-temperature photon-number-resolving detectors allow for direct access to the photon number distribution of quantum light sources and can thus be exploited to explore the photon statistics, e.g., solid-state-based non-classical light sources. In this work, we report on the setup and calibration of a detection system based on fiber-coupled tungsten transition-edge sensors (W-TESs). Our stand-alone system comprises two W-TESs, read out by two 2-stage-SQUID current sensors, operated in a compact detector unit that is integrated in an adiabatic demagnetization refrigerator. Fast low-noise analog amplifiers and digitizers are used for signal acquisition. The detection efficiency of the single-mode fiber-coupled detector system in the spectral region of interest (850-950 nm) is determined to be larger than 87 %. The presented detector system opens up new routes in the characterization of quantum light sources for quantum information, quantum-enhanced sensing and quantum metrology.

Chiral limit of N = 4 SYM and ABJM and integrable Feynman graphs

NASA Astrophysics Data System (ADS)

Caetano, João; Gürdoğan, Ömer; Kazakov, Vladimir

2018-03-01

We consider a special double scaling limit, recently introduced by two of the authors, combining weak coupling and large imaginary twist, for the γ-twisted N = 4 SYM theory. We also establish the analogous limit for ABJM theory. The resulting non-gauge chiral 4D and 3D theories of interacting scalars and fermions are integrable in the planar limit. In spite of the breakdown of conformality by double-trace interactions, most of the correlators for local operators of these theories are conformal, with non-trivial anomalous dimensions defined by specific, integrable Feynman diagrams. We discuss the details of this diagrammatics. We construct the doubly-scaled asymptotic Bethe ansatz (ABA) equations for multi-magnon states in these theories. Each entry of the mixing matrix of local conformal operators in the simplest of these theories — the bi-scalar model in 4D and tri-scalar model in 3D — is given by a single Feynman diagram at any given loop order. The related diagrams are in principle computable, up to a few scheme dependent constants, by integrability methods (quantum spectral curve or ABA). These constants should be fixed from direct computations of a few simplest graphs. This integrability-based method is advocated to be able to provide information about some high loop order graphs which are hardly computable by other known methods. We exemplify our approach with specific five-loop graphs.

Compact quantum dot-antibody conjugates for FRET immunoassays with subnanomolar detection limits.

PubMed

Mattera, Lucia; Bhuckory, Shashi; Wegner, K David; Qiu, Xue; Agnese, Fabio; Lincheneau, Christophe; Senden, Tim; Djurado, David; Charbonnière, Loïc J; Hildebrandt, Niko; Reiss, Peter

2016-06-07

A novel two-step approach for quantum dot (QD) functionalization and bioconjugation is presented, which yields ultra-compact, stable, and highly luminescent antibody-QD conjugates suitable for use in FRET immunoassays. Hydrophobic InPZnS/ZnSe/ZnS (emission wavelength: 530 nm), CdSe/ZnS (605 nm), and CdSeTe/ZnS (705 nm) QDs were surface functionalized with zwitterionic penicillamine, enabling aqueous phase transfer under conservation of the photoluminescence properties. Post-functionalization with a heterobifunctional crosslinker, containing a lipoic acid group and a maleimide function, enabled the subsequent coupling to sulfhydryl groups of proteins. This was demonstrated by QD conjugation with fragmented antibodies (F(ab)). The obtained F(ab)-QD conjugates range among the smallest antibody-functionalized nanoprobes ever reported, with a hydrodynamic diameter <13 nm, PL quantum yield up to 66% at 705 nm, and colloidal stability of several months in various buffers. They were applied as FRET acceptors in homogeneous, time-gated immunoassays using Tb-antibodies as FRET donors, both coupled by an immunological sandwich complex between the two antibodies and a PSA (prostate specific antigen) biomarker. The advantages of the compact surface coating for FRET could be demonstrated by an 6.2 and 2.5 fold improvement of the limit of detection (LOD) for PSA compared to commercially available hydrophilic QDs emitting at 605 and 705 nm, respectively. While the commercial QDs contain identical inorganic cores responsible for their fluorescence, they are coated with a comparably thick amphiphilic polymer layer leading to much larger hydrodynamic diameters (>26 nm without biomolecules). The LODs of 0.8 and 3.7 ng mL(-1) obtained in 50 μL serum samples are below the clinical cut-off level of PSA (4 ng mL(-1)) and demonstrate their direct applicability in clinical diagnostics.

Compact continuous-variable entanglement distillation.

PubMed

Datta, Animesh; Zhang, Lijian; Nunn, Joshua; Langford, Nathan K; Feito, Alvaro; Plenio, Martin B; Walmsley, Ian A

2012-02-10

We introduce a new scheme for continuous-variable entanglement distillation that requires only linear temporal and constant physical or spatial resources. Distillation is the process by which high-quality entanglement may be distributed between distant nodes of a network in the unavoidable presence of decoherence. The known versions of this protocol scale exponentially in space and doubly exponentially in time. Our optimal scheme therefore provides exponential improvements over existing protocols. It uses a fixed-resource module-an entanglement distillery-comprising only four quantum memories of at most 50% storage efficiency and allowing a feasible experimental implementation. Tangible quantum advantages are obtainable by using existing off-resonant Raman quantum memories outside their conventional role of storage.

Note: Commercial SQUID magnetometer-compatible NMR probe and its application for studying a quantum magnet.

PubMed

Vennemann, T; Jeong, M; Yoon, D; Magrez, A; Berger, H; Yang, L; Živković, I; Babkevich, P; Rønnow, H M

2018-04-01

We present a compact nuclear magnetic resonance (NMR) probe which is compatible with a magnet of a commercial superconducting quantum interference device magnetometer and demonstrate its application to the study of a quantum magnet. We employ trimmer chip capacitors to construct an NMR tank circuit for low temperature measurements. Using a magnetic insulator MoOPO 4 with S = 1/2 (Mo 5+ ) as an example, we show that the T-dependence of the circuit is weak enough to allow the ligand-ion NMR study of magnetic systems. Our 31 P NMR results are compatible with previous bulk susceptibility and neutron scattering experiments and furthermore reveal unconventional spin dynamics.

Electro-mechanical control of an on-chip optical beam splitter containing an embedded quantum emitter

NASA Astrophysics Data System (ADS)

Bishop, Z. K.; Foster, A. P.; Royall, B.; Bentham, C.; Clarke, E.; Skolnick, M. S.; Wilson, L. R.

2018-05-01

We demonstrate electro-mechanical control of an on-chip GaAs optical beam splitter containing a quantum dot single-photon source. The beam splitter consists of two nanobeam waveguides, which form a directional coupler (DC). The splitting ratio of the DC is controlled by varying the out-of-plane separation of the two waveguides using electro-mechanical actuation. We reversibly tune the beam splitter between an initial state, with emission into both output arms, and a final state with photons emitted into a single output arm. The device represents a compact and scalable tuning approach for use in III-V semiconductor integrated quantum optical circuits.

Multimode analysis of highly tunable, quantum cascade powered, circular graphene spaser

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jayasekara, Charith, E-mail: charith.jayasekara@monash.edu; Premaratne, Malin; Stockman, Mark I.

2015-11-07

We carried out a detailed analysis of a circular graphene spaser made of a circular graphene flake and a quantum cascade well structure. Owing to unique properties of graphene and quantum cascade well structure, the proposed design shows high mechanical and thermal stability and low optical losses. Additionally, operation characteristics of the model are analysed and tunability of the device is demonstrated. Some advantages of the proposed design include compact size, lower power operation, and the ability to set the operating wavelength over a wide range from Mid-IR to Near-IR. Thus, it can have wide spread applications including designing ofmore » ultracompact and ultrafast devices, nanoscopy and biomedical applications.« less

Note: Commercial SQUID magnetometer-compatible NMR probe and its application for studying a quantum magnet

NASA Astrophysics Data System (ADS)

Vennemann, T.; Jeong, M.; Yoon, D.; Magrez, A.; Berger, H.; Yang, L.; Živković, I.; Babkevich, P.; Rønnow, H. M.

2018-04-01

We present a compact nuclear magnetic resonance (NMR) probe which is compatible with a magnet of a commercial superconducting quantum interference device magnetometer and demonstrate its application to the study of a quantum magnet. We employ trimmer chip capacitors to construct an NMR tank circuit for low temperature measurements. Using a magnetic insulator MoOPO4 with S = 1/2 (Mo5+) as an example, we show that the T-dependence of the circuit is weak enough to allow the ligand-ion NMR study of magnetic systems. Our 31P NMR results are compatible with previous bulk susceptibility and neutron scattering experiments and furthermore reveal unconventional spin dynamics.

Novel latch for adiabatic quantum-flux-parametron logic

DOE Office of Scientific and Technical Information (OSTI.GOV)

Takeuchi, Naoki, E-mail: takeuchi-naoki-kx@ynu.jp; Yamanashi, Yuki; Yoshikawa, Nobuyuki

2014-03-14

We herein propose the quantum-flux-latch (QFL) as a novel latch for adiabatic quantum-flux-parametron (AQFP) logic. A QFL is very compact and compatible with AQFP logic gates and can be read out in one clock cycle. Simulation results revealed that the QFL operates at 5 GHz with wide parameter margins of more than ±22%. The calculated energy dissipation was only ∼0.1 aJ/bit, which yields a small energy delay product of 20 aJ·ps. We also designed shift registers using QFLs to demonstrate more complex circuits with QFLs. Finally, we experimentally demonstrated correct operations of the QFL and a 1-bit shift register (a D flip-flop)

Effective spin physics in two-dimensional cavity QED arrays

NASA Astrophysics Data System (ADS)

Minář, Jiří; Güneş Söyler, Şebnem; Rotondo, Pietro; Lesanovsky, Igor

2017-06-01

We investigate a strongly correlated system of light and matter in two-dimensional cavity arrays. We formulate a multimode Tavis-Cummings (TC) Hamiltonian for two-level atoms coupled to cavity modes and driven by an external laser field which reduces to an effective spin Hamiltonian in the dispersive regime. In one-dimension we provide an exact analytical solution. In two-dimensions, we perform mean-field study and large scale quantum Monte Carlo simulations of both the TC and the effective spin models. We discuss the phase diagram and the parameter regime which gives rise to frustrated interactions between the spins. We provide a quantitative description of the phase transitions and correlation properties featured by the system and we discuss graph-theoretical properties of the ground states in terms of graph colourings using Pólya’s enumeration theorem.

``Models'' CAVEAT EMPTOR!!!: ``Toy Models Too-Often Yield Toy-Results''!!!: Statistics, Polls, Politics, Economics, Elections!!!: GRAPH/Network-Physics: ``Equal-Distribution for All'' TRUMP-ED BEC ``Winner-Take-All'' ``Doctor Livingston I Presume?''

NASA Astrophysics Data System (ADS)

Preibus-Norquist, R. N. C.-Grover; Bush-Romney, G. W.-Willard-Mitt; Dimon, J. P.; Adelson-Koch, Sheldon-Charles-David-Sheldon; Krugman-Axelrod, Paul-David; Siegel, Edward Carl-Ludwig; D. N. C./O. F. P./''47''%/50% Collaboration; R. N. C./G. O. P./''53''%/49% Collaboration; Nyt/Wp/Cnn/Msnbc/Pbs/Npr/Ft Collaboration; Ftn/Fnc/Fox/Wsj/Fbn Collaboration; Lb/Jpmc/Bs/Boa/Ml/Wamu/S&P/Fitch/Moodys/Nmis Collaboration

2013-03-01

``Models''? CAVEAT EMPTOR!!!: ``Toy Models Too-Often Yield Toy-Results''!!!: Goldenfeld[``The Role of Models in Physics'', in Lects.on Phase-Transitions & R.-G.(92)-p.32-33!!!]: statistics(Silver{[NYTimes; Bensinger, ``Math-Geerks Clearly-Defeated Pundits'', LATimes, (11/9/12)])}, polls, politics, economics, elections!!!: GRAPH/network/net/...-PHYSICS Barabasi-Albert[RMP (02)] (r,t)-space VERSUS(???) [Where's the Inverse/ Dual/Integral-Transform???] (Benjamin)Franklin(1795)-Fourier(1795; 1897;1822)-Laplace(1850)-Mellin (1902) Brillouin(1922)-...(k,)-space, {Hubbard [The World According to Wavelets,Peters (96)-p.14!!!/p.246: refs.-F2!!!]},and then (2) Albert-Barabasi[]Bose-Einstein quantum-statistics(BEQS) Bose-Einstein CONDENSATION (BEC) versus Bianconi[pvt.-comm.; arXiv:cond-mat/0204506; ...] -Barabasi [???] Fermi-Dirac

Low temperature scanning tunneling microscopy of metallic and organic nanostructures

NASA Astrophysics Data System (ADS)

Fölsch, Stefan

2006-03-01

Low temperature scanning tunneling microscopy (LT-STM) is capable of both characterizing and manipulating atomic-scale structures at surfaces. It thus provides a powerful experimental tool to gain fundamental insight into how electronic properties evolve when controlling size, geometry, and composition of nanometric model systems at the level of single atoms and molecules. The experiments discussed in this talk employ a Cu(111) surface onto which perfect nanostructures are assembled from native adatoms and organic molecules. Using single Cu adatoms as building blocks, we obtain zero-, one-, and two-dimensional quantum objects (corresponding to the discrete adatom, monatomic adatom chains, and compact adatom assemblies) with intriguing electronic properties. Depending on the structure shape and the number of incorporated atoms we observe the formation of characteristic quantum levels which merge into the sp-derived Shockley surface state in the limit of extended 2D islands; this state exists on many surfaces, such as Cu(111). Our results reveal the natural linkage between this traditional surface property, the quantum confinement in compact adatom structures, and the quasi-atomic state associated with the single adatom. In a second step, we study the interaction of pentacene (C22H14) with Cu adatom chains serving as model quantum wires. We find that STM-based manipulation is capable of connecting single molecules to the chain ends in a defined way, and that the molecule-chain interaction shifts the chain-localized quantum states to higher binding energies. The present system provides an instructive model case to study single organic molecules interacting with metallic nanostructures. The microscopic nature of such composite structures is of importance for any future molecular-based device realization since it determines the contact conductance between the molecular unit and its metal ''contact pad''.

Novel Plasmonic Materials and Nanodevices for Integrated Quantum Photonics

NASA Astrophysics Data System (ADS)

Shalaginov, Mikhail Y.

Light-matter interaction is the foundation for numerous important quantum optical phenomena, which may be harnessed to build practical devices with higher efficiency and unprecedented functionality. Nanoscale engineering is seen as a fruitful avenue to significantly strengthen light-matter interaction and also make quantum optical systems ultra-compact, scalable, and energy efficient. This research focuses on color centers in diamond that share quantum properties with single atoms. These systems promise a path for the realization of practical quantum devices such as nanoscale sensors, single-photon sources, and quantum memories. In particular, we explored an intriguing methodology of utilizing nanophotonic structures, such as hyperbolic metamaterials, nanoantennae, and plasmonic waveguides, to improve the color centers performance. We observed enhancement in the color center's spontaneous emission rate, emission directionality, and cooperativity over a broad optical frequency range. Additionally, we studied the effect of plasmonic environments on the spin-readout sensitivity of color centers. The use of CMOS-compatible epitaxially grown plasmonic materials in the design of these nanophotonic structures promises a new level of performance for a variety of integrated room-temperature quantum devices based on diamond color centers.

Multilinear Graph Embedding: Representation and Regularization for Images.

PubMed

Chen, Yi-Lei; Hsu, Chiou-Ting

2014-02-01

Given a set of images, finding a compact and discriminative representation is still a big challenge especially when multiple latent factors are hidden in the way of data generation. To represent multifactor images, although multilinear models are widely used to parameterize the data, most methods are based on high-order singular value decomposition (HOSVD), which preserves global statistics but interprets local variations inadequately. To this end, we propose a novel method, called multilinear graph embedding (MGE), as well as its kernelization MKGE to leverage the manifold learning techniques into multilinear models. Our method theoretically links the linear, nonlinear, and multilinear dimensionality reduction. We also show that the supervised MGE encodes informative image priors for image regularization, provided that an image is represented as a high-order tensor. From our experiments on face and gait recognition, the superior performance demonstrates that MGE better represents multifactor images than classic methods, including HOSVD and its variants. In addition, the significant improvement in image (or tensor) completion validates the potential of MGE for image regularization.

A wavelet-based approach for a continuous analysis of phonovibrograms.

PubMed

Unger, Jakob; Meyer, Tobias; Doellinger, Michael; Hecker, Dietmar J; Schick, Bernhard; Lohscheller, Joerg

2012-01-01

Recently, endoscopic high-speed laryngoscopy has been established for commercial use and constitutes a state-of-the-art technique to examine vocal fold dynamics. Despite overcoming many limitations of commonly applied stroboscopy it has not gained widespread clinical application, yet. A major drawback is a missing methodology of extracting valuable features to support visual assessment or computer-aided diagnosis. In this paper a compact and descriptive feature set is presented. The feature extraction routines are based on two-dimensional color graphs called phonovibrograms (PVG). These graphs contain the full spatio-temporal pattern of vocal fold dynamics and are therefore suited to derive features that comprehensively describe the vibration pattern of vocal folds. Within our approach, clinically relevant features such as glottal closure type, symmetry and periodicity are quantified in a set of 10 descriptive features. The suitability for classification tasks is shown using a clinical data set comprising 50 healthy and 50 paralytic subjects. A classification accuracy of 93.2% has been achieved.

Time evolution of Rényi entropy under the Lindblad equation.

PubMed

Abe, Sumiyoshi

2016-08-01

In recent years, the Rényi entropy has repeatedly been discussed for characterization of quantum critical states and entanglement. Here, time evolution of the Rényi entropy is studied. A compact general formula is presented for the lower bound on the entropy rate.

Ultrahigh Responsivity-Bandwidth Product in a Compact InP Nanopillar Phototransistor Directly Grown on Silicon

NASA Astrophysics Data System (ADS)

Ko, Wai Son; Bhattacharya, Indrasen; Tran, Thai-Truong D.; Ng, Kar Wei; Adair Gerke, Stephen; Chang-Hasnain, Connie

2016-09-01

Highly sensitive and fast photodetectors can enable low power, high bandwidth on-chip optical interconnects for silicon integrated electronics. III-V compound semiconductor direct-bandgap materials with high absorption coefficients are particularly promising for photodetection in energy-efficient optical links because of the potential to scale down the absorber size, and the resulting capacitance and dark current, while maintaining high quantum efficiency. We demonstrate a compact bipolar junction phototransistor with a high current gain (53.6), bandwidth (7 GHz) and responsivity (9.5 A/W) using a single crystalline indium phosphide nanopillar directly grown on a silicon substrate. Transistor gain is obtained at sub-picowatt optical power and collector bias close to the CMOS line voltage. The quantum efficiency-bandwidth product of 105 GHz is the highest for photodetectors on silicon. The bipolar junction phototransistor combines the receiver front end circuit and absorber into a monolithic integrated device, eliminating the wire capacitance between the detector and first amplifier stage.

Terahertz generation by difference frequency generation from a compact optical parametric oscillator

NASA Astrophysics Data System (ADS)

Li, Zhongyang; Wang, Silei; Wang, Mengtao; Wang, Weishu

2017-11-01

Terahertz (THz) generation by difference frequency generation (DFG) processes with dual idler waves is theoretically analyzed. The dual idler waves are generated by a compact optical parametric oscillator (OPO) with periodically poled lithium niobate (PPLN). The phase-matching conditions in a same PPLN for the optical parametric oscillation generating signal and idler waves and for the DFG generating THz waves can be simultaneously satisfied by selecting the poling period of PPLN. Moreover, 3-order cascaded DFG processes generating THz waves can be realized in the same PPLN. To take an example of 8.341 THz which locates in the vicinity of polariton resonances, THz intensities and quantum conversion efficiencies are calculated. Compared with non-cascaded DFG processes, THz intensities of 8.341 THz in 3-order cascaded DFG processes increase to 2.57 times. When the pump intensity equals to 20 MW/mm2, the quantum conversion efficiency of 106% in 3-order cascaded DFG processes can be realized, which exceeds the Manley-Rowe limit.

Waveguide based compact silicon Schottky photodetector with enhanced responsivity in the telecom spectral band.

PubMed

Goykhman, Ilya; Desiatov, Boris; Khurgin, Jacob; Shappir, Joseph; Levy, Uriel

2012-12-17

We experimentally demonstrate an on-chip compact and simple to fabricate silicon Schottky photodetector for telecom wavelengths operating on the basis of internal photoemission process. The device is realized using CMOS compatible approach of local-oxidation of silicon, which enables the realization of the photodetector and low-loss bus photonic waveguide at the same fabrication step. The photodetector demonstrates enhanced internal responsivity of 12.5mA/W for operation wavelength of 1.55µm corresponding to an internal quantum efficiency of 1%, about two orders of magnitude higher than our previously demonstrated results [22]. We attribute this improved detection efficiency to the presence of surface roughness at the boundary between the materials forming the Schottky contact. The combination of enhanced quantum efficiency together with a simple fabrication process provides a promising platform for the realization of all silicon photodetectors and their integration with other nanophotonic and nanoplasmonic structures towards the construction of monolithic silicon opto-electronic circuitry on-chip.

Ultrahigh Responsivity-Bandwidth Product in a Compact InP Nanopillar Phototransistor Directly Grown on Silicon

PubMed Central

Ko, Wai Son; Bhattacharya, Indrasen; Tran, Thai-Truong D.; Ng, Kar Wei; Adair Gerke, Stephen; Chang-Hasnain, Connie

2016-01-01

Highly sensitive and fast photodetectors can enable low power, high bandwidth on-chip optical interconnects for silicon integrated electronics. III-V compound semiconductor direct-bandgap materials with high absorption coefficients are particularly promising for photodetection in energy-efficient optical links because of the potential to scale down the absorber size, and the resulting capacitance and dark current, while maintaining high quantum efficiency. We demonstrate a compact bipolar junction phototransistor with a high current gain (53.6), bandwidth (7 GHz) and responsivity (9.5 A/W) using a single crystalline indium phosphide nanopillar directly grown on a silicon substrate. Transistor gain is obtained at sub-picowatt optical power and collector bias close to the CMOS line voltage. The quantum efficiency-bandwidth product of 105 GHz is the highest for photodetectors on silicon. The bipolar junction phototransistor combines the receiver front end circuit and absorber into a monolithic integrated device, eliminating the wire capacitance between the detector and first amplifier stage. PMID:27659796

First Detected Arrival of a Quantum Walker on an Infinite Line

NASA Astrophysics Data System (ADS)

Thiel, Felix; Barkai, Eli; Kessler, David A.

2018-01-01

The first detection of a quantum particle on a graph is shown to depend sensitively on the distance ξ between the detector and initial location of the particle, and on the sampling time τ . Here, we use the recently introduced quantum renewal equation to investigate the statistics of first detection on an infinite line, using a tight-binding lattice Hamiltonian with nearest-neighbor hops. Universal features of the first detection probability are uncovered and simple limiting cases are analyzed. These include the large ξ limit, the small τ limit, and the power law decay with the attempt number of the detection probability over which quantum oscillations are superimposed. For large ξ the first detection probability assumes a scaling form and when the sampling time is equal to the inverse of the energy band width nonanalytical behaviors arise, accompanied by a transition in the statistics. The maximum total detection probability is found to occur for τ close to this transition point. When the initial location of the particle is far from the detection node we find that the total detection probability attains a finite value that is distance independent.

Water-soluble multidentate polymers compactly coating Ag2S quantum dots with minimized hydrodynamic size and bright emission tunable from red to second near-infrared region.

PubMed

Gui, Rijun; Wan, Ajun; Liu, Xifeng; Yuan, Wen; Jin, Hui

2014-05-21

Hydrodynamic size-minimized quantum dots (QDs) have outstanding physicochemical properties for applications in multicolor molecular and cellular imaging at the level of single molecules and nanoparticles. In this study, we have reported the aqueous synthesis of Ag2S QDs by using thiol-based multidentate polymers as capping reagents. By regulating the composition of the precursors (AgNO3 and sulfur-N2H4·H2O complex) and multidentate polymers (poly(acrylic acid)-graft-cysteamine-graft-ethylenediamine), as well as the reaction time, Ag2S QDs (2.6-3.7 nm) are prepared, displaying tunable photoluminescence (PL) emission from red to the second near-infrared region (687-1096 nm). The small hydrodynamic thickness (1.6-1.9 nm) of the multidentate polymers yields a highly compact coating for the QDs, which results in the bright fluorescent QDs with high PL quantum yields (QYs: 14.2-16.4%). Experimental results confirm that the QDs have high PL stability and ultralow cytotoxicity, as well as high PLQYs and small hydrodynamic sizes (4.5-5.6 nm) similar to fluorescent proteins (27-30 kDa), indicating the feasibility of highly effective PL imaging in cells and living animals.

An investigation of student understanding of classical ideas related to quantum mechanics: Potential energy diagrams and spatial probability density

NASA Astrophysics Data System (ADS)

Stephanik, Brian Michael

This dissertation describes the results of two related investigations into introductory student understanding of ideas from classical physics that are key elements of quantum mechanics. One investigation probes the extent to which students are able to interpret and apply potential energy diagrams (i.e., graphs of potential energy versus position). The other probes the extent to which students are able to reason classically about probability and spatial probability density. The results of these investigations revealed significant conceptual and reasoning difficulties that students encounter with these topics. The findings guided the design of instructional materials to address the major problems. Results from post-instructional assessments are presented that illustrate the impact of the curricula on student learning.

Differential geometric treewidth estimation in adiabatic quantum computation

NASA Astrophysics Data System (ADS)

Wang, Chi; Jonckheere, Edmond; Brun, Todd

2016-10-01

The D-Wave adiabatic quantum computing platform is designed to solve a particular class of problems—the Quadratic Unconstrained Binary Optimization (QUBO) problems. Due to the particular "Chimera" physical architecture of the D-Wave chip, the logical problem graph at hand needs an extra process called minor embedding in order to be solvable on the D-Wave architecture. The latter problem is itself NP-hard. In this paper, we propose a novel polynomial-time approximation to the closely related treewidth based on the differential geometric concept of Ollivier-Ricci curvature. The latter runs in polynomial time and thus could significantly reduce the overall complexity of determining whether a QUBO problem is minor embeddable, and thus solvable on the D-Wave architecture.

EPR investigation of Ti2+ in SrCl2 single crystals.

NASA Technical Reports Server (NTRS)

Herrington, J. R.; Estle, T. L.; Boatner, L. A.

1972-01-01

The observation of 'double quantum' transitions which made it possible to determine the charge state of Ti as 2+ is reported. The EPR spectrum observed at 1.2 K is presented in a graph. The first derivative of the absorption is shown vs the magnetic field. The hyperfine patterns for the Ti-47 and Ti-49 isotopes are identified. Spin-Hamiltonian parameters for Ti(2+) in various cubic hosts are listed.

Single-doped white organic light-emitting device with an external quantum efficiency over 20%.

PubMed

Fleetham, Tyler; Ecton, Jeremy; Wang, Zixing; Bakken, Nathan; Li, Jian

2013-05-14

A white OLED with a maximum EQE of 20.1%, CIE coordinates of (0.33, 0.33) and CRI of 80 is fabricated based on platinum(II) bis(N-methyl-imidazolyl)benzene chloride (Pt-16). The device emission spectrum and the chemical structure of Pt-16 are shown in the inset of the efficiency versus luminance graph. Copyright © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Reducible boundary conditions in coupled channels

NASA Astrophysics Data System (ADS)

Pankrashkin, Konstantin

2005-10-01

We study Hamiltonians with point interactions in spaces of vector-valued functions. Using some information from the theory of quantum graphs, we describe a class of the operators which can be reduced to the direct sum of several one-dimensional problems. It shown that such a reduction is closely connected with the invariance under channel permutations. Examples are provided by some 'model' interactions, in particular, the so-called δ, δ' and the Kirchhoff couplings.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stottmeister, Alexander, E-mail: alexander.stottmeister@gravity.fau.de; Thiemann, Thomas, E-mail: thomas.thiemann@gravity.fau.de

In this article, the third of three, we analyse how the Weyl quantisation for compact Lie groups presented in the second article of this series fits with the projective-phase space structure of loop quantum gravity-type models. Thus, the proposed Weyl quantisation may serve as the main mathematical tool to implement the program of space adiabatic perturbation theory in such models. As we already argued in our first article, space adiabatic perturbation theory offers an ideal framework to overcome the obstacles that hinder the direct implementation of the conventional Born-Oppenheimer approach in the canonical formulation of loop quantum gravity.

Quenching of the Quantum Hall Effect in Graphene with Scrolled Edges

NASA Astrophysics Data System (ADS)

Cresti, Alessandro; Fogler, Michael M.; Guinea, Francisco; Castro Neto, A. H.; Roche, Stephan

2012-04-01

Edge nanoscrolls are shown to strongly influence transport properties of suspended graphene in the quantum Hall regime. The relatively long arclength of the scrolls in combination with their compact transverse size results in formation of many nonchiral transport channels in the scrolls. They short circuit the bulk current paths and inhibit the observation of the quantized two-terminal resistance. Unlike competing theoretical proposals, this mechanism of disrupting the Hall quantization in suspended graphene is not caused by ill-chosen placement of the contacts, singular elastic strains, or a small sample size.

Effects of electromagnetic fields on the nonlinear optical properties of asymmetric double quantum well under intense laser field

NASA Astrophysics Data System (ADS)

Yesilgul, U.; Sari, H.; Ungan, F.; Martínez-Orozco, J. C.; Restrepo, R. L.; Mora-Ramos, M. E.; Duque, C. A.; Sökmen, I.

2017-03-01

In this study, the effects of electric and magnetic fields on the optical rectification and second and third harmonic generation in asymmetric double quantum well under the intense non-resonant laser field is theoretically investigated. We calculate the optical rectification and second and third harmonic generation within the compact density-matrix approach. The theoretical findings show that the influence of electric, magnetic, and intense laser fields leads to significant changes in the coefficients of nonlinear optical rectification, second and third harmonic generation.

Terahertz imaging through self-mixing in a quantum cascade laser.

PubMed

Dean, Paul; Lim, Yah Leng; Valavanis, Alex; Kliese, Russell; Nikolić, Milan; Khanna, Suraj P; Lachab, Mohammad; Indjin, Dragan; Ikonić, Zoran; Harrison, Paul; Rakić, Aleksandar D; Linfield, Edmund H; Davies, A Giles

2011-07-01

We demonstrate terahertz (THz) frequency imaging using a single quantum cascade laser (QCL) device for both generation and sensing of THz radiation. Detection is achieved by utilizing the effect of self-mixing in the THz QCL, and, specifically, by monitoring perturbations to the voltage across the QCL, induced by light reflected from an external object back into the laser cavity. Self-mixing imaging offers high sensitivity, a potentially fast response, and a simple, compact optical design, and we show that it can be used to obtain high-resolution reflection images of exemplar structures.

Data Assimilation on a Quantum Annealing Computer: Feasibility and Scalability

NASA Astrophysics Data System (ADS)

Nearing, G. S.; Halem, M.; Chapman, D. R.; Pelissier, C. S.

2014-12-01

Data assimilation is one of the ubiquitous and computationally hard problems in the Earth Sciences. In particular, ensemble-based methods require a large number of model evaluations to estimate the prior probability density over system states, and variational methods require adjoint calculations and iteration to locate the maximum a posteriori solution in the presence of nonlinear models and observation operators. Quantum annealing computers (QAC) like the new D-Wave housed at the NASA Ames Research Center can be used for optimization and sampling, and therefore offers a new possibility for efficiently solving hard data assimilation problems. Coding on the QAC is not straightforward: a problem must be posed as a Quadratic Unconstrained Binary Optimization (QUBO) and mapped to a spherical Chimera graph. We have developed a method for compiling nonlinear 4D-Var problems on the D-Wave that consists of five steps: Emulating the nonlinear model and/or observation function using radial basis functions (RBF) or Chebyshev polynomials. Truncating a Taylor series around each RBF kernel. Reducing the Taylor polynomial to a quadratic using ancilla gadgets. Mapping the real-valued quadratic to a fixed-precision binary quadratic. Mapping the fully coupled binary quadratic to a partially coupled spherical Chimera graph using ancilla gadgets. At present the D-Wave contains 512 qbits (with 1024 and 2048 qbit machines due in the next two years); this machine size allows us to estimate only 3 state variables at each satellite overpass. However, QAC's solve optimization problems using a physical (quantum) system, and therefore do not require iterations or calculation of model adjoints. This has the potential to revolutionize our ability to efficiently perform variational data assimilation, as the size of these computers grows in the coming years.

Exciton scattering approach for optical spectra calculations in branched conjugated macromolecules

NASA Astrophysics Data System (ADS)

Li, Hao; Wu, Chao; Malinin, Sergey V.; Tretiak, Sergei; Chernyak, Vladimir Y.

2016-12-01

The exciton scattering (ES) technique is a multiscale approach based on the concept of a particle in a box and developed for efficient calculations of excited-state electronic structure and optical spectra in low-dimensional conjugated macromolecules. Within the ES method, electronic excitations in molecular structure are attributed to standing waves representing quantum quasi-particles (excitons), which reside on the graph whose edges and nodes stand for the molecular linear segments and vertices, respectively. Exciton propagation on the linear segments is characterized by the exciton dispersion, whereas exciton scattering at the branching centers is determined by the energy-dependent scattering matrices. Using these ES energetic parameters, the excitation energies are then found by solving a set of generalized "particle in a box" problems on the graph that represents the molecule. Similarly, unique energy-dependent ES dipolar parameters permit calculations of the corresponding oscillator strengths, thus, completing optical spectra modeling. Both the energetic and dipolar parameters can be extracted from quantum-chemical computations in small molecular fragments and tabulated in the ES library for further applications. Subsequently, spectroscopic modeling for any macrostructure within a considered molecular family could be performed with negligible numerical effort. We demonstrate the ES method application to molecular families of branched conjugated phenylacetylenes and ladder poly-para-phenylenes, as well as structures with electron donor and acceptor chemical substituents. Time-dependent density functional theory (TD-DFT) is used as a reference model for electronic structure. The ES calculations accurately reproduce the optical spectra compared to the reference quantum chemistry results, and make possible to predict spectra of complex macromolecules, where conventional electronic structure calculations are unfeasible.

Compact integrated dc SQUID gradiometer

NASA Astrophysics Data System (ADS)

de Waal, V. J.; Klapwijk, T. M.

1982-10-01

An all-niobium integrated system of first-order gradiometer and dc suprconducting quantum interference device (SQUID) has been developed. It is relatively simple to fabricate, has an overall size of 17×12 mm and a sensitivity of 3.5×10-12 T m-1 Hz-1/2.

Compact high reliability fiber coupled laser diodes for avionics and related applications

NASA Astrophysics Data System (ADS)

Daniel, David R.; Richards, Gordon S.; Janssen, Adrian P.; Turley, Stephen E. H.; Stockton, Thomas E.

1993-04-01

This paper describes a newly developed compact high reliability fiber coupled laser diode which is capable of providing enhanced performance under extreme environmental conditions including a very wide operating temperature range. Careful choice of package materials to minimize thermal and mechanical stress, used with proven manufacturing methods, has resulted in highly stable coupling of the optical fiber pigtail to a high performance MOCVD-grown Multi-Quantum Well laser chip. Electro-optical characteristics over temperature are described together with a demonstration of device stability over a range of environmental conditions. Real time device lifetime data is also presented.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Oda, H., E-mail: h-oda@photon.chitose.ac.jp; Yamanaka, A.; Ozaki, N.

The development of small sized laser operating above room temperature is important in the realization of optical integrated circuits. Recently, micro-lasers consisting of photonic crystals (PhCs) and whispering gallery mode cavities have been demonstrated. Optically pumped laser devices could be easily designed using photonic crystal-slab waveguides (PhC-WGs) with an air-bridge type structure. In this study, we observe lasing at 1.3μm from two-photon pumped InAs-quantum-dots embedded GaAs PhC-WGs above room temperature. This type of compact laser shows promise as a new light source in ultra-compact photonics integrated circuits.

TopoMS: Comprehensive topological exploration for molecular and condensed-matter systems.

PubMed

Bhatia, Harsh; Gyulassy, Attila G; Lordi, Vincenzo; Pask, John E; Pascucci, Valerio; Bremer, Peer-Timo

2018-06-15

We introduce TopoMS, a computational tool enabling detailed topological analysis of molecular and condensed-matter systems, including the computation of atomic volumes and charges through the quantum theory of atoms in molecules, as well as the complete molecular graph. With roots in techniques from computational topology, and using a shared-memory parallel approach, TopoMS provides scalable, numerically robust, and topologically consistent analysis. TopoMS can be used as a command-line tool or with a GUI (graphical user interface), where the latter also enables an interactive exploration of the molecular graph. This paper presents algorithmic details of TopoMS and compares it with state-of-the-art tools: Bader charge analysis v1.0 (Arnaldsson et al., 01/11/17) and molecular graph extraction using Critic2 (Otero-de-la-Roza et al., Comput. Phys. Commun. 2014, 185, 1007). TopoMS not only combines the functionality of these individual codes but also demonstrates up to 4× performance gain on a standard laptop, faster convergence to fine-grid solution, robustness against lattice bias, and topological consistency. TopoMS is released publicly under BSD License. © 2018 Wiley Periodicals, Inc. © 2018 Wiley Periodicals, Inc.

SAR-based change detection using hypothesis testing and Markov random field modelling

NASA Astrophysics Data System (ADS)

Cao, W.; Martinis, S.

2015-04-01

The objective of this study is to automatically detect changed areas caused by natural disasters from bi-temporal co-registered and calibrated TerraSAR-X data. The technique in this paper consists of two steps: Firstly, an automatic coarse detection step is applied based on a statistical hypothesis test for initializing the classification. The original analytical formula as proposed in the constant false alarm rate (CFAR) edge detector is reviewed and rewritten in a compact form of the incomplete beta function, which is a builtin routine in commercial scientific software such as MATLAB and IDL. Secondly, a post-classification step is introduced to optimize the noisy classification result in the previous step. Generally, an optimization problem can be formulated as a Markov random field (MRF) on which the quality of a classification is measured by an energy function. The optimal classification based on the MRF is related to the lowest energy value. Previous studies provide methods for the optimization problem using MRFs, such as the iterated conditional modes (ICM) algorithm. Recently, a novel algorithm was presented based on graph-cut theory. This method transforms a MRF to an equivalent graph and solves the optimization problem by a max-flow/min-cut algorithm on the graph. In this study this graph-cut algorithm is applied iteratively to improve the coarse classification. At each iteration the parameters of the energy function for the current classification are set by the logarithmic probability density function (PDF). The relevant parameters are estimated by the method of logarithmic cumulants (MoLC). Experiments are performed using two flood events in Germany and Australia in 2011 and a forest fire on La Palma in 2009 using pre- and post-event TerraSAR-X data. The results show convincing coarse classifications and considerable improvement by the graph-cut post-classification step.

Fault-tolerance in Two-dimensional Topological Systems

NASA Astrophysics Data System (ADS)

Anderson, Jonas T.

This thesis is a collection of ideas with the general goal of building, at least in the abstract, a local fault-tolerant quantum computer. The connection between quantum information and topology has proven to be an active area of research in several fields. The introduction of the toric code by Alexei Kitaev demonstrated the usefulness of topology for quantum memory and quantum computation. Many quantum codes used for quantum memory are modeled by spin systems on a lattice, with operators that extract syndrome information placed on vertices or faces of the lattice. It is natural to wonder whether the useful codes in such systems can be classified. This thesis presents work that leverages ideas from topology and graph theory to explore the space of such codes. Homological stabilizer codes are introduced and it is shown that, under a set of reasonable assumptions, any qubit homological stabilizer code is equivalent to either a toric code or a color code. Additionally, the toric code and the color code correspond to distinct classes of graphs. Many systems have been proposed as candidate quantum computers. It is very desirable to design quantum computing architectures with two-dimensional layouts and low complexity in parity-checking circuitry. Kitaev's surface codes provided the first example of codes satisfying this property. They provided a new route to fault tolerance with more modest overheads and thresholds approaching 1%. The recently discovered color codes share many properties with the surface codes, such as the ability to perform syndrome extraction locally in two dimensions. Some families of color codes admit a transversal implementation of the entire Clifford group. This work investigates color codes on the 4.8.8 lattice known as triangular codes. I develop a fault-tolerant error-correction strategy for these codes in which repeated syndrome measurements on this lattice generate a three-dimensional space-time combinatorial structure. I then develop an integer program that analyzes this structure and determines the most likely set of errors consistent with the observed syndrome values. I implement this integer program to find the threshold for depolarizing noise on small versions of these triangular codes. Because the threshold for magic-state distillation is likely to be higher than this value and because logical CNOT gates can be performed by code deformation in a single block instead of between pairs of blocks, the threshold for fault-tolerant quantum memory for these codes is also the threshold for fault-tolerant quantum computation with them. Since the advent of a threshold theorem for quantum computers much has been improved upon. Thresholds have increased, architectures have become more local, and gate sets have been simplified. The overhead for magic-state distillation has been studied, but not nearly to the extent of the aforementioned topics. A method for greatly reducing this overhead, known as reusable magic states, is studied here. While examples of reusable magic states exist for Clifford gates, I give strong reasons to believe they do not exist for non-Clifford gates.

Matrix product states for su(2) invariant quantum spin chains

NASA Astrophysics Data System (ADS)

Zadourian, Rubina; Fledderjohann, Andreas; Klümper, Andreas

2016-08-01

A systematic and compact treatment of arbitrary su(2) invariant spin-s quantum chains with nearest-neighbour interactions is presented. The ground-state is derived in terms of matrix product states (MPS). The fundamental MPS calculations consist of taking products of basic tensors of rank 3 and contractions thereof. The algebraic su(2) calculations are carried out completely by making use of Wigner calculus. As an example of application, the spin-1 bilinear-biquadratic quantum chain is investigated. Various physical quantities are calculated with high numerical accuracy of up to 8 digits. We obtain explicit results for the ground-state energy, entanglement entropy, singlet operator correlations and the string order parameter. We find an interesting crossover phenomenon in the correlation lengths.

High-speed polarization-encoded quantum key distribution based on silicon photonic integrated devices

NASA Astrophysics Data System (ADS)

Bunandar, Darius; Urayama, Junji; Boynton, Nicholas; Martinez, Nicholas; Derose, Christopher; Lentine, Anthony; Davids, Paul; Camacho, Ryan; Wong, Franco; Englund, Dirk

We present a compact polarization-encoded quantum key distribution (QKD) transmitter near a 1550-nm wavelength implemented on a CMOS-compatible silicon-on-insulator photonics platform. The transmitter generates arbitrary polarization qubits at gigahertz bandwidth with an extinction ratio better than 30 dB using high-speed carrier-depletion phase modulators. We demonstrate the performance of this device by generating secret keys at a rate of 1 Mbps in a complete QKD field test. Our work shows the potential of using advanced photonic integrated circuits to enable high-speed quantum-secure communications. This work was supported by the SECANT QKD Grand Challenge, the Samsung Global Research Outreach Program, and the Air Force Office of Scientific Research.

Coherent coupling between a quantum dot and a donor in silicon

DOE PAGES

Harvey-Collard, Patrick; Jacobson, N. Tobias; Rudolph, Martin; ...

2017-10-18

Individual donors in silicon chips are used as quantum bits with extremely low error rates. However, physical realizations have been limited to one donor because their atomic size causes fabrication challenges. Quantum dot qubits, in contrast, are highly adjustable using electrical gate voltages. This adjustability could be leveraged to deterministically couple donors to quantum dots in arrays of qubits. In this work, we demonstrate the coherent interaction of a 31P donor electron with the electron of a metal-oxide-semiconductor quantum dot. We form a logical qubit encoded in the spin singlet and triplet states of the two-electron system. We show thatmore » the donor nuclear spin drives coherent rotations between the electronic qubit states through the contact hyperfine interaction. This provides every key element for compact two-electron spin qubits requiring only a single dot and no additional magnetic field gradients, as well as a means to interact with the nuclear spin qubit.« less

Vibrations used to talk to quantum circuits

NASA Astrophysics Data System (ADS)

Cho, Adrian

2018-03-01

The budding discipline of quantum acoustics could shake up embryonic quantum computers. Such machines run by flipping quantum bits, or qubits, that can be set not only to zero or one, but, bizarrely, to zero and one at the same time. The most advanced qubits are circuits made of superconducting metal, and to control or read out a qubit, researchers make it interact with a microwave resonator—typically a strip of metal on the qubit chip or a finger-size cavity surrounding it—which rings with microwave photons like an organ pipe rings with sound. But some physicists see advantages to replacing the microwave resonator with a mechanical one that rings with quantized vibrations, or phonons. A well-designed acoustic resonator could ring longer than a microwave one does and could be far smaller, enabling researchers to produce more compact technologies. But first scientists must gain quantum control over vibrations. And several groups are on the cusp of doing that, as they reported at a recent meeting.

Ultraefficient Cap-Exchange Protocol To Compact Biofunctional Quantum Dots for Sensitive Ratiometric Biosensing and Cell Imaging

PubMed Central

2017-01-01

An ultraefficient cap-exchange protocol (UCEP) that can convert hydrophobic quantum dots (QDs) into stable, biocompatible, and aggregation-free water-dispersed ones at a ligand:QD molar ratio (LQMR) as low as 500, some 20–200-fold less than most literature methods, has been developed. The UCEP works conveniently with air-stable lipoic acid (LA)-based ligands by exploiting tris(2-carboxylethyl phosphine)-based rapid in situ reduction. The resulting QDs are compact (hydrodynamic radius, Rh, < 4.5 nm) and bright (retaining > 90% of original fluorescence), resist nonspecific adsorption of proteins, and display good stability in biological buffers even with high salt content (e.g., 2 M NaCl). These advantageous properties make them well suited for cellular imaging and ratiometric biosensing applications. The QDs prepared by UCEP using dihydrolipoic acid (DHLA)-zwitterion ligand can be readily conjugated with octa-histidine (His8)-tagged antibody mimetic proteins (known as Affimers). These QDs allow rapid, ratiometric detection of the Affimer target protein down to 10 pM via a QD-sensitized Förster resonance energy transfer (FRET) readout signal. Moreover, compact biotinylated QDs can be readily prepared by UCEP in a facile, one-step process. The resulting QDs have been further employed for ratiometric detection of protein, exemplified by neutravidin, down to 5 pM, as well as for fluorescence imaging of target cancer cells. PMID:28421739

Multifractal analysis of charged particle distributions using horizontal visibility graph and sandbox algorithm

NASA Astrophysics Data System (ADS)

Mali, P.; Mukhopadhyay, A.; Manna, S. K.; Haldar, P. K.; Singh, G.

2017-03-01

Horizontal visibility graphs (HVGs) and the sandbox (SB) algorithm usually applied for multifractal characterization of complex network systems that are converted from time series measurements, are used to characterize the fluctuations in pseudorapidity densities of singly charged particles produced in high-energy nucleus-nucleus collisions. Besides obtaining the degree distribution associated with event-wise pseudorapidity distributions, the common set of observables, typical of any multifractality measurement, are studied in 16O-Ag/Br and 32S-Ag/Br interactions, each at an incident laboratory energy of 200 GeV/nucleon. For a better understanding, we systematically compare the experiment with a Monte Carlo model simulation based on the Ultra-relativistic Quantum Molecular Dynamics (UrQMD). Our results suggest that the HVG-SB technique is an efficient tool that can characterize multifractality in multiparticle emission data, and in some cases, it is even superior to other methods more commonly used in this regard.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rivasseau, Vincent, E-mail: vincent.rivasseau@th.u-psud.fr, E-mail: adrian.tanasa@ens-lyon.org; Tanasa, Adrian, E-mail: vincent.rivasseau@th.u-psud.fr, E-mail: adrian.tanasa@ens-lyon.org

The Loop Vertex Expansion (LVE) is a quantum field theory (QFT) method which explicitly computes the Borel sum of Feynman perturbation series. This LVE relies in a crucial way on symmetric tree weights which define a measure on the set of spanning trees of any connected graph. In this paper we generalize this method by defining new tree weights. They depend on the choice of a partition of a set of vertices of the graph, and when the partition is non-trivial, they are no longer symmetric under permutation of vertices. Nevertheless we prove they have the required positivity property tomore » lead to a convergent LVE; in fact we formulate this positivity property precisely for the first time. Our generalized tree weights are inspired by the Brydges-Battle-Federbush work on cluster expansions and could be particularly suited to the computation of connected functions in QFT. Several concrete examples are explicitly given.« less

Fitting of Hadron Mass Spectra and Contributions to Perturbation Theory of Conformal Quantum Field Theory

NASA Astrophysics Data System (ADS)

Luna Acosta, German Aurelio

The masses of observed hadrons are fitted according to the kinematic predictions of Conformal Relativity. The hypothesis gives a remarkably good fit. The isospin SU(2) gauge invariant Lagrangian L(,(pi)NN)(x,(lamda)) is used in the calculation of d(sigma)/d(OMEGA) to 2nd-order Feynman graphs for simplified models of (pi)N(--->)(pi)N. The resulting infinite mass sums over the nucleon (Conformal) families are done via the Generalized-Sommerfeld-Watson Transform Theorem. Even though the models are too simple to be realistic, they indicate that if (DELTA)-internal lines were to be included, 2nd-order Feynman graphs may reproduce the experimental data qualitatively. The energy -dependence of the propagator and couplings in Conformal QFT is different from that of ordinary QFT. Suggestions for further work are made in the areas of ultra-violet divergences and OPEC calculations.

Dynamics of streaming instability with quantum correction

NASA Astrophysics Data System (ADS)

Goutam, H. P.; Karmakar, P. K.

2017-05-01

A modified quantum hydrodynamic model (m-QHD) is herein proposed on the basis of the Thomas-Fermi (TF) theory of many fermionic quantum systems to investigate the dynamics of electrostatic streaming instability modes in a complex (dusty) quantum plasma system. The newly formulated m-QHD, as an amelioration over the existing usual QHD, employs a dimensionality-dependent Bohmian quantum correction prefactor, γ = [(D-2)/3D], in the electron quantum dynamics, where D symbolizing the problem dimensionality under consideration. The normal mode analysis of the coupled structure equations reveals the excitation of two distinct streaming modes associated with the flowing ions (against electrons and dust) and the flowing dust particulates (against the electrons and ions). It is mainly shown that the γ-factor introduces a new source of stability and dispersive effects to the ion-streaming instability solely; but not to the dust counterparts. A non-trivial application of our investigation in electrostatic beam-plasma (flow-driven) coupled dynamics leading to the development of self-sustained intense electric current, and hence, of strong magnetic field in compact astrophysical objects (in dwarf-family stars) is summarily indicated.

A rederivation of the conformal anomaly for spin-{\\frac{1}{2}}

NASA Astrophysics Data System (ADS)

Godazgar, Hadi; Nicolai, Hermann

2018-05-01

We rederive the conformal anomaly for spin- fermions by a genuine Feynman graph calculation, which has not been available so far. Although our calculation merely confirms a result that has been known for a long time, the derivation is new, and thus furnishes a method to investigate more complicated cases (in particular concerning the significance of the quantum trace of the stress tensor in non-conformal theories) where there remain several outstanding and unresolved issues.

3D-printed components for quantum devices.

PubMed

Saint, R; Evans, W; Zhou, Y; Barrett, T; Fromhold, T M; Saleh, E; Maskery, I; Tuck, C; Wildman, R; Oručević, F; Krüger, P

2018-05-30

Recent advances in the preparation, control and measurement of atomic gases have led to new insights into the quantum world and unprecedented metrological sensitivities, e.g. in measuring gravitational forces and magnetic fields. The full potential of applying such capabilities to areas as diverse as biomedical imaging, non-invasive underground mapping, and GPS-free navigation can only be realised with the scalable production of efficient, robust and portable devices. We introduce additive manufacturing as a production technique of quantum device components with unrivalled design freedom and rapid prototyping. This provides a step change in efficiency, compactness and facilitates systems integration. As a demonstrator we present an ultrahigh vacuum compatible ultracold atom source dissipating less than ten milliwatts of electrical power during field generation to produce large samples of cold rubidium gases. This disruptive technology opens the door to drastically improved integrated structures, which will further reduce size and assembly complexity in scalable series manufacture of bespoke portable quantum devices.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Harvey-Collard, Patrick; Jacobson, N. Tobias; Rudolph, Martin

Individual donors in silicon chips are used as quantum bits with extremely low error rates. However, physical realizations have been limited to one donor because their atomic size causes fabrication challenges. Quantum dot qubits, in contrast, are highly adjustable using electrical gate voltages. This adjustability could be leveraged to deterministically couple donors to quantum dots in arrays of qubits. In this work, we demonstrate the coherent interaction of a 31P donor electron with the electron of a metal-oxide-semiconductor quantum dot. We form a logical qubit encoded in the spin singlet and triplet states of the two-electron system. We show thatmore » the donor nuclear spin drives coherent rotations between the electronic qubit states through the contact hyperfine interaction. This provides every key element for compact two-electron spin qubits requiring only a single dot and no additional magnetic field gradients, as well as a means to interact with the nuclear spin qubit.« less

Complex dynamics of memristive circuits: Analytical results and universal slow relaxation

NASA Astrophysics Data System (ADS)

Caravelli, F.; Traversa, F. L.; Di Ventra, M.

2017-02-01

Networks with memristive elements (resistors with memory) are being explored for a variety of applications ranging from unconventional computing to models of the brain. However, analytical results that highlight the role of the graph connectivity on the memory dynamics are still few, thus limiting our understanding of these important dynamical systems. In this paper, we derive an exact matrix equation of motion that takes into account all the network constraints of a purely memristive circuit, and we employ it to derive analytical results regarding its relaxation properties. We are able to describe the memory evolution in terms of orthogonal projection operators onto the subspace of fundamental loop space of the underlying circuit. This orthogonal projection explicitly reveals the coupling between the spatial and temporal sectors of the memristive circuits and compactly describes the circuit topology. For the case of disordered graphs, we are able to explain the emergence of a power-law relaxation as a superposition of exponential relaxation times with a broad range of scales using random matrices. This power law is also universal, namely independent of the topology of the underlying graph but dependent only on the density of loops. In the case of circuits subject to alternating voltage instead, we are able to obtain an approximate solution of the dynamics, which is tested against a specific network topology. These results suggest a much richer dynamics of memristive networks than previously considered.

Properties of the numerical algorithms for problems of quantum information technologies: Benefits of deep analysis

NASA Astrophysics Data System (ADS)

Chernyavskiy, Andrey; Khamitov, Kamil; Teplov, Alexey; Voevodin, Vadim; Voevodin, Vladimir

2016-10-01

In recent years, quantum information technologies (QIT) showed great development, although, the way of the implementation of QIT faces the serious difficulties, some of which are challenging computational tasks. This work is devoted to the deep and broad analysis of the parallel algorithmic properties of such tasks. As an example we take one- and two-qubit transformations of a many-qubit quantum state, which are the most critical kernels of many important QIT applications. The analysis of the algorithms uses the methodology of the AlgoWiki project (algowiki-project.org) and consists of two parts: theoretical and experimental. Theoretical part includes features like sequential and parallel complexity, macro structure, and visual information graph. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia) and includes the analysis of locality and memory access, scalability and the set of more specific dynamic characteristics of realization. This approach allowed us to obtain bottlenecks and generate ideas of efficiency improvement.

Quantum Enhanced Inference in Markov Logic Networks

NASA Astrophysics Data System (ADS)

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 Enhanced Inference in Markov Logic Networks.

PubMed

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

PubMed Central

Wittek, Peter; Gogolin, Christian

2017-01-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. PMID:28422093

On-chip generation of high-dimensional entangled quantum states and their coherent control

NASA Astrophysics Data System (ADS)

Kues, Michael; Reimer, Christian; Roztocki, Piotr; Cortés, Luis Romero; Sciara, Stefania; Wetzel, Benjamin; Zhang, Yanbing; Cino, Alfonso; Chu, Sai T.; Little, Brent E.; Moss, David J.; Caspani, Lucia; Azaña, José; Morandotti, Roberto

2017-06-01

Optical quantum states based on entangled photons are essential for solving questions in fundamental physics and are at the heart of quantum information science. Specifically, the realization of high-dimensional states (D-level quantum systems, that is, qudits, with D > 2) and their control are necessary for fundamental investigations of quantum mechanics, for increasing the sensitivity of quantum imaging schemes, for improving the robustness and key rate of quantum communication protocols, for enabling a richer variety of quantum simulations, and for achieving more efficient and error-tolerant quantum computation. Integrated photonics has recently become a leading platform for the compact, cost-efficient, and stable generation and processing of non-classical optical states. However, so far, integrated entangled quantum sources have been limited to qubits (D = 2). Here we demonstrate on-chip generation of entangled qudit states, where the photons are created in a coherent superposition of multiple high-purity frequency modes. In particular, we confirm the realization of a quantum system with at least one hundred dimensions, formed by two entangled qudits with D = 10. Furthermore, using state-of-the-art, yet off-the-shelf telecommunications components, we introduce a coherent manipulation platform with which to control frequency-entangled states, capable of performing deterministic high-dimensional gate operations. We validate this platform by measuring Bell inequality violations and performing quantum state tomography. Our work enables the generation and processing of high-dimensional quantum states in a single spatial mode.

On-chip generation of high-dimensional entangled quantum states and their coherent control.

PubMed

Kues, Michael; Reimer, Christian; Roztocki, Piotr; Cortés, Luis Romero; Sciara, Stefania; Wetzel, Benjamin; Zhang, Yanbing; Cino, Alfonso; Chu, Sai T; Little, Brent E; Moss, David J; Caspani, Lucia; Azaña, José; Morandotti, Roberto

2017-06-28

Optical quantum states based on entangled photons are essential for solving questions in fundamental physics and are at the heart of quantum information science. Specifically, the realization of high-dimensional states (D-level quantum systems, that is, qudits, with D > 2) and their control are necessary for fundamental investigations of quantum mechanics, for increasing the sensitivity of quantum imaging schemes, for improving the robustness and key rate of quantum communication protocols, for enabling a richer variety of quantum simulations, and for achieving more efficient and error-tolerant quantum computation. Integrated photonics has recently become a leading platform for the compact, cost-efficient, and stable generation and processing of non-classical optical states. However, so far, integrated entangled quantum sources have been limited to qubits (D = 2). Here we demonstrate on-chip generation of entangled qudit states, where the photons are created in a coherent superposition of multiple high-purity frequency modes. In particular, we confirm the realization of a quantum system with at least one hundred dimensions, formed by two entangled qudits with D = 10. Furthermore, using state-of-the-art, yet off-the-shelf telecommunications components, we introduce a coherent manipulation platform with which to control frequency-entangled states, capable of performing deterministic high-dimensional gate operations. We validate this platform by measuring Bell inequality violations and performing quantum state tomography. Our work enables the generation and processing of high-dimensional quantum states in a single spatial mode.

Temperature Control of Avalanche Photodiode Using Thermoelectric Cooler

NASA Technical Reports Server (NTRS)

Refaat, Tamer F.; Luck, William S., Jr.; DeYoung, Russell J.

1999-01-01

Avalanche photodiodes (APDS) are quantum optical detectors that are used for visible and near infrared optical detection applications. Although APDs are compact, rugged, and have an internal gain mechanism that is suitable for low light intensity; their responsivity, and therefore their output, is strongly dependent on the device temperature. Thermoelectric coolers (TEC) offers a suitable solution to this problem. A TEC is a solid state cooling device, which can be controlled by changing its current. TECs are compact and rugged, and they can precisely control the temperature to within 0.1 C with more than a 150 C temperature gradient between its surfaces. In this Memorandum, a proportional integral (PI) temperature controller for APDs using a TEC is discussed. The controller is compact and can successfully cool the APD to almost 0 C in an ambient temperature environment of up to 27 C.

Open strings and electric fields in compact spaces

NASA Astrophysics Data System (ADS)

Condeescu, Cezar; Dudas, Emilian; Pradisi, Gianfranco

2018-05-01

We analyse open strings with background electric fields in the internal space, T-dual to branes moving with constant velocities in the internal space. We find that the direction of the electric fields inside a two torus, dual to the D-brane velocities, has to be quantised such that the corresponding direction is compact. This implies that D-brane motion in the internal torus is periodic, with a periodicity that can be parametrically large in terms of the internal radii. By S-duality, this is mapped into an internal magnetic field in a three torus, a quantum mechanical analysis of which yields a similar result, i.e. the parallel direction to the magnetic field has to be compact. Furthermore, for the magnetic case, we find the Landau level degeneracy as being given by the greatest common divisor of the flux numbers. We carry on the string quantisation and derive the relevant partition functions for these models. Our analysis includes also the case of oblique electric fields which can arise when several stacks of branes are present. Compact dimensions and/or oblique sectors influence the energy loss of the system through pair-creation and thus can be relevant for inflationary scenarios with branes. Finally, we show that the compact energy loss is always larger than the non-compact one.

State-conditional coherent charge qubit oscillations in a Si/SiGe quadruple quantum dot

NASA Astrophysics Data System (ADS)

Ward, Daniel R.; Kim, Dohun; Savage, Donald E.; Lagally, Max G.; Foote, Ryan H.; Friesen, Mark; Coppersmith, Susan N.; Eriksson, Mark A.

2016-10-01

Universal quantum computation requires high-fidelity single-qubit rotations and controlled two-qubit gates. Along with high-fidelity single-qubit gates, strong efforts have been made in developing robust two-qubit logic gates in electrically gated quantum dot systems to realise a compact and nanofabrication-compatible architecture. Here we perform measurements of state-conditional coherent oscillations of a charge qubit. Using a quadruple quantum dot formed in a Si/SiGe heterostructure, we show the first demonstration of coherent two-axis control of a double quantum dot charge qubit in undoped Si/SiGe, performing Larmor and Ramsey oscillation measurements. We extract the strength of the capacitive coupling between a pair of double quantum dots by measuring the detuning energy shift (≈75 μeV) of one double dot depending on the excess charge configuration of the other double dot. We further demonstrate that the strong capacitive coupling allows fast, state-conditional Landau-Zener-Stückelberg oscillations with a conditional π phase flip time of about 80 ps, showing a promising pathway towards multi-qubit entanglement and control in semiconductor quantum dots.

State-conditional coherent charge qubit oscillations in a Si/SiGe quadruple quantum dot

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ward, Daniel R.; Kim, Dohun; Savage, Donald E.

Universal quantum computation requires high-fidelity single-qubit rotations and controlled two-qubit gates. Along with high-fidelity single-qubit gates, strong efforts have been made in developing robust two-qubit logic gates in electrically gated quantum dot systems to realise a compact and nanofabrication-compatible architecture. Here we perform measurements of state-conditional coherent oscillations of a charge qubit. Using a quadruple quantum dot formed in a Si/SiGe heterostructure, we show the first demonstration of coherent two-axis control of a double quantum dot charge qubit in undoped Si/SiGe, performing Larmor and Ramsey oscillation measurements. We extract the strength of the capacitive coupling between a pair of doublemore » quantum dots by measuring the detuning energy shift (≈75 μeV) of one double dot depending on the excess charge configuration of the other double dot. Finally, we further demonstrate that the strong capacitive coupling allows fast, state-conditional Landau–Zener–Stückelberg oscillations with a conditional π phase flip time of about 80 ps, showing a promising pathway towards multi-qubit entanglement and control in semiconductor quantum dots.« less

Adiabatic evolution of decoherence-free subspaces and its shortcuts

NASA Astrophysics Data System (ADS)

Wu, S. L.; Huang, X. L.; Li, H.; Yi, X. X.

2017-10-01

The adiabatic theorem and shortcuts to adiabaticity for time-dependent open quantum systems are explored in this paper. Starting from the definition of dynamical stable decoherence-free subspace, we show that, under a compact adiabatic condition, the quantum state remains in the time-dependent decoherence-free subspace with an extremely high purity, even though the dynamics of the open quantum system may not be adiabatic. The adiabatic condition mentioned here in the adiabatic theorem for open systems is very similar to that for closed quantum systems, except that the operators required to change slowly are the Lindblad operators. We also show that the adiabatic evolution of decoherence-free subspaces depends on the existence of instantaneous decoherence-free subspaces, which requires that the Hamiltonian of open quantum systems be engineered according to the incoherent control protocol. In addition, shortcuts to adiabaticity for adiabatic decoherence-free subspaces are also presented based on the transitionless quantum driving method. Finally, we provide an example that consists of a two-level system coupled to a broadband squeezed vacuum field to show our theory. Our approach employs Markovian master equations and the theory can apply to finite-dimensional quantum open systems.

State-conditional coherent charge qubit oscillations in a Si/SiGe quadruple quantum dot

DOE PAGES

Ward, Daniel R.; Kim, Dohun; Savage, Donald E.; ...

2016-10-18

Universal quantum computation requires high-fidelity single-qubit rotations and controlled two-qubit gates. Along with high-fidelity single-qubit gates, strong efforts have been made in developing robust two-qubit logic gates in electrically gated quantum dot systems to realise a compact and nanofabrication-compatible architecture. Here we perform measurements of state-conditional coherent oscillations of a charge qubit. Using a quadruple quantum dot formed in a Si/SiGe heterostructure, we show the first demonstration of coherent two-axis control of a double quantum dot charge qubit in undoped Si/SiGe, performing Larmor and Ramsey oscillation measurements. We extract the strength of the capacitive coupling between a pair of doublemore » quantum dots by measuring the detuning energy shift (≈75 μeV) of one double dot depending on the excess charge configuration of the other double dot. Finally, we further demonstrate that the strong capacitive coupling allows fast, state-conditional Landau–Zener–Stückelberg oscillations with a conditional π phase flip time of about 80 ps, showing a promising pathway towards multi-qubit entanglement and control in semiconductor quantum dots.« less

Holography as deep learning

NASA Astrophysics Data System (ADS)

Gan, Wen-Cong; Shu, Fu-Wen

Quantum many-body problem with exponentially large degrees of freedom can be reduced to a tractable computational form by neural network method [G. Carleo and M. Troyer, Science 355 (2017) 602, arXiv:1606.02318.] The power of deep neural network (DNN) based on deep learning is clarified by mapping it to renormalization group (RG), which may shed lights on holographic principle by identifying a sequence of RG transformations to the AdS geometry. In this paper, we show that any network which reflects RG process has intrinsic hyperbolic geometry, and discuss the structure of entanglement encoded in the graph of DNN. We find the entanglement structure of DNN is of Ryu-Takayanagi form. Based on these facts, we argue that the emergence of holographic gravitational theory is related to deep learning process of the quantum-field theory.

Benchmarking the D-Wave Two

NASA Astrophysics Data System (ADS)

Job, Joshua; Wang, Zhihui; Rønnow, Troels; Troyer, Matthias; Lidar, Daniel

2014-03-01

We report on experimental work benchmarking the performance of the D-Wave Two programmable annealer on its native Ising problem, and a comparison to available classical algorithms. In this talk we will focus on the comparison with an algorithm originally proposed and implemented by Alex Selby. This algorithm uses dynamic programming to repeatedly optimize over randomly selected maximal induced trees of the problem graph starting from a random initial state. If one is looking for a quantum advantage over classical algorithms, one should compare to classical algorithms which are designed and optimized to maximally take advantage of the structure of the type of problem one is using for the comparison. In that light, this classical algorithm should serve as a good gauge for any potential quantum speedup for the D-Wave Two.

Relations de Dispersion et Diffusion des Glueballs et des Mesons dans la Theorie de Jauge U(1)(2+1) Compacte

NASA Astrophysics Data System (ADS)

Ahmed, Chaara El Mouez

Nous avons etudie les relations de dispersion et la diffusion des glueballs et des mesons dans le modele U(1)_{2+1} compact. Ce modele a ete souvent utilise comme un simple modele de la chromodynamique quantique (QCD), parce qu'il possede le confinement ainsi que les etats de glueballs. Par contre, sa structure mathematique est beaucoup plus simple que la QCD. Notre methode consiste a diagonaliser l'Hamiltonien de ce modele dans une base appropriee de graphes et sur reseau impulsion, afin de generer les relations de dispersion des glueballs et des mesons. Pour la diffusion, nous avons utilise la methode dependante du temps pour calculer la matrice S et la section efficace de diffusion des glueballs et des mesons. Les divers resultats obtenus semblent etre en accord avec les travaux anterieurs de Hakim, Alessandrini et al., Irving et al., qui eux, utilisent plutot la theorie des perturbations en couplage fort, et travaillent sur un reseau espace-temps.

Representation and design of wavelets using unitary circuits

NASA Astrophysics Data System (ADS)

Evenbly, Glen; White, Steven R.

2018-05-01

The representation of discrete, compact wavelet transformations (WTs) as circuits of local unitary gates is discussed. We employ a similar formalism as used in the multiscale representation of quantum many-body wave functions using unitary circuits, further cementing the relation established in the literature between classical and quantum multiscale methods. An algorithm for constructing the circuit representation of known orthogonal, dyadic, discrete WTs is presented, and the explicit representation for Daubechies wavelets, coiflets, and symlets is provided. Furthermore, we demonstrate the usefulness of the circuit formalism in designing WTs, including various classes of symmetric wavelets and multiwavelets, boundary wavelets, and biorthogonal wavelets.

Widely tunable quantum cascade laser-based terahertz source.

PubMed

Danylov, Andriy A; Light, Alexander R; Waldman, Jerry; Erickson, Neal; Qian, Xifeng

2014-07-10

A compact, tunable, ultranarrowband terahertz source, Δν∼1  MHz, is demonstrated by upconversion of a 2.324 THz, free-running quantum cascade laser with a THz Schottky-diode-balanced mixer using a swept, synthesized microwave source to drive the nonlinearity. Continuously tunable radiation of 1 μW power is demonstrated in two frequency regions: ν(Laser) ± 0 to 50 GHz and ν(Laser) ± 70 to 115 GHz. The sideband spectra were characterized with a Fourier-transform spectrometer, and the radiation was tuned through CO, HDO, and D2O rotational transitions.

Quantum calculus of classical vortex images, integrable models and quantum states

NASA Astrophysics Data System (ADS)

Pashaev, Oktay K.

2016-10-01

From two circle theorem described in terms of q-periodic functions, in the limit q→1 we have derived the strip theorem and the stream function for N vortex problem. For regular N-vortex polygon we find compact expression for the velocity of uniform rotation and show that it represents a nonlinear oscillator. We describe q-dispersive extensions of the linear and nonlinear Schrodinger equations, as well as the q-semiclassical expansions in terms of Bernoulli and Euler polynomials. Different kind of q-analytic functions are introduced, including the pq-analytic and the golden analytic functions.

Fast gas spectroscopy using pulsed quantum cascade lasers

NASA Astrophysics Data System (ADS)

Beyer, T.; Braun, M.; Lambrecht, A.

2003-03-01

Laser spectroscopy has found many industrial applications, e.g., control of automotive exhaust and process monitoring. The midinfrared region is of special interest because it has stronger absorption lines compared to the near infrared (NIR). However, in the NIR high quality reliable laser sources, detectors, and passive optical components are available. A quantum cascade laser could change this situation if fundamental advantages can be exploited with compact and reliable systems. It will be shown that, using pulsed lasers and available fast detectors, lower residual sensitivity levels than in corresponding NIR systems can be achieved. The stability is sufficient for industrial applications.

Robust and compact entanglement generation from diode-laser-pumped four-wave mixing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lawrie, B. J.; Yang, Y.; Eaton, M.

Four-wave-mixing processes are now routinely used to demonstrate multi-spatial-mode Einstein- Podolsky-Rosen entanglement and intensity difference squeezing. Recently, diode-laser-pumped four-wave mixing processes have been shown to provide an affordable, compact, and stable source for intensity difference squeezing, but it was unknown if excess phase noise present in power amplifier pump configurations would be an impediment to achieving quadrature entanglement. Here, we demonstrate the operating regimes under which these systems are capable of producing entanglement and under which excess phase noise produced by the amplifier contaminates the output state. We show that Einstein-Podolsky-Rosen entanglement in two mode squeezed states can be generatedmore » by a four-wave-mixing source deriving both the pump field and the local oscillators from a tapered-amplifier diode-laser. In conclusion, this robust continuous variable entanglement source is highly scalable and amenable to miniaturization, making it a critical step toward the development of integrated quantum sensors and scalable quantum information processors, such as spatial comb cluster states.« less

Robust and compact entanglement generation from diode-laser-pumped four-wave mixing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lawrie, B. J., E-mail: lawriebj@ornl.gov; Pooser, R. C.; Yang, Y.

Four-wave-mixing processes are now routinely used to demonstrate multi-spatial-mode Einstein-Podolsky-Rosen entanglement and intensity difference squeezing. Diode-laser-pumped four-wave mixing processes have recently been shown to provide an affordable, compact, and stable source for intensity difference squeezing, but it was unknown if excess phase noise present in power amplifier pump configurations would be an impediment to achieving quadrature entanglement. Here, we demonstrate the operating regimes under which these systems are capable of producing entanglement and under which excess phase noise produced by the amplifier contaminates the output state. We show that Einstein-Podolsky-Rosen entanglement in two mode squeezed states can be generated bymore » a four-wave-mixing source deriving both the pump field and the local oscillators from a tapered-amplifier diode-laser. This robust continuous variable entanglement source is highly scalable and amenable to miniaturization, making it a critical step toward the development of integrated quantum sensors and scalable quantum information processors, such as spatial comb cluster states.« less

Robust and compact entanglement generation from diode-laser-pumped four-wave mixing

DOE PAGES

Lawrie, B. J.; Yang, Y.; Eaton, M.; ...

2016-04-11

Four-wave-mixing processes are now routinely used to demonstrate multi-spatial-mode Einstein- Podolsky-Rosen entanglement and intensity difference squeezing. Recently, diode-laser-pumped four-wave mixing processes have been shown to provide an affordable, compact, and stable source for intensity difference squeezing, but it was unknown if excess phase noise present in power amplifier pump configurations would be an impediment to achieving quadrature entanglement. Here, we demonstrate the operating regimes under which these systems are capable of producing entanglement and under which excess phase noise produced by the amplifier contaminates the output state. We show that Einstein-Podolsky-Rosen entanglement in two mode squeezed states can be generatedmore » by a four-wave-mixing source deriving both the pump field and the local oscillators from a tapered-amplifier diode-laser. In conclusion, this robust continuous variable entanglement source is highly scalable and amenable to miniaturization, making it a critical step toward the development of integrated quantum sensors and scalable quantum information processors, such as spatial comb cluster states.« less

Study on the blocking effect of a quantum-dot TiO2 compact layer in dye-sensitized solar cells with ionic liquid electrolyte under low-intensity illumination

NASA Astrophysics Data System (ADS)

Zhai, Peng; Lee, Hyeonseok; Huang, Yu-Ting; Wei, Tzu-Chien; Feng, Shien-Ping

2016-10-01

In this study, ultrasmall and ultrafine TiO2 quantum dots (QDs) were prepared and used as a high-performance compact layer (CL) in dye-sensitized solar cells (DSCs). We systematically investigated the performance of TiO2 CL under both low-intensity light and indoor fluorescent light illumination and found that the efficiency of DSCs with the insertion of optimal TiO2 QDs-CL was increased up to 18.3% under indoor T5 fluorescent light illumination (7000 lux). We clarified the controversy over the blocking effect of TiO2 CL for the efficiency increment and confirmed that the TiO2 QDs-CL performed significantly better under low-intensity illumination due to the efficient suppression of electron recombination at the FTO/electrolyte interface. We, for the first time, demonstrate this potential for the application of the DSCs with TiO2 QDs-CL in the low-intensity light and indoor fluorescent light illumination.

Towards an Imaging Mid-Infrared Heterodyne Spectrometer

NASA Technical Reports Server (NTRS)

Hewagama, T.; Aslam, S.; Jones, H.; Kostiuk, T.; Villanueva, G.; Roman, P.; Shaw, G. B.; Livengood, T.; Allen, J. E.

2012-01-01

We are developing a concept for a compact, low-mass, low-power, mid-infrared (MIR; 5- 12 microns) imaging heterodyne spectrometer that incorporates fiber optic coupling, Quantum Cascade Laser (QCL) local oscillator, photomixer array, and Radio Frequency Software Defined Readout (RFSDR) for spectral analysis. Planetary Decadal Surveys have highlighted the need for miniaturized, robust, low-mass, and minimal power remote sensing technologies for flight missions. The drive for miniaturization of remote sensing spectroscopy and radiometry techniques has been a continuing process. The advent of MIR fibers, and MEMS techniques for producing waveguides has proven to be an important recent advancement for miniaturization of infrared spectrometers. In conjunction with well-established photonics techniques, the miniaturization of spectrometers is transitioning from classic free space optical systems to waveguide/fiber-based structures for light transport and producing interference effects. By their very nature, these new devices are compact and lightweight. Mercury-Cadmium-Telluride (MCT) and Quantum Well Infrared Photodiodes (QWIP) arrays for heterodyne applications are also being developed. Bulky electronics is another barrier that precluded the extension of heterodyne systems into imaging applications, and our RFSDR will address this aspect.

Ultrastable, Zerodur-based optical benches for quantum gas experiments.

PubMed

Duncker, Hannes; Hellmig, Ortwin; Wenzlawski, André; Grote, Alexander; Rafipoor, Amir Jones; Rafipoor, Mona; Sengstock, Klaus; Windpassinger, Patrick

2014-07-10

Operating ultracold quantum gas experiments outside of a laboratory environment has so far been a challenging goal, largely due to the lack of sufficiently stable optical systems. In order to increase the thermal stability of free-space laser systems, the application of nonstandard materials such as glass ceramics is required. Here, we report on Zerodur-based optical systems which include single-mode fiber couplers consisting of multiple components jointed by light-curing adhesives. The thermal stability is thoroughly investigated, revealing excellent fiber-coupling efficiencies between 0.85 and 0.92 in the temperature range from 17°C to 36°C. In conjunction with successfully performed vibration tests, these findings qualify our highly compact systems for atom interferometry experiments aboard a sounding rocket as well as various other quantum information and sensing applications.

All-optical phase modulation in a cavity-polariton Mach–Zehnder interferometer

PubMed Central

Sturm, C.; Tanese, D.; Nguyen, H.S.; Flayac, H.; Galopin, E.; Lemaître, A.; Sagnes, I.; Solnyshkov, D.; Amo, A.; Malpuech, G.; Bloch, J.

2014-01-01

Quantum fluids based on light is a highly developing research field, since they provide a nonlinear platform for developing optical functionalities and quantum simulators. An important issue in this context is the ability to coherently control the properties of the fluid. Here we propose an all-optical approach for controlling the phase of a flow of cavity-polaritons, making use of their strong interactions with localized excitons. Here we illustrate the potential of this method by implementing a compact exciton–polariton interferometer, which output intensity and polarization can be optically controlled. This interferometer is cascadable with already reported polariton devices and is promising for future polaritonic quantum optic experiments. Complex phase patterns could be also engineered using this optical method, providing a key tool to build photonic artificial gauge fields. PMID:24513781

Markov chain aggregation and its applications to combinatorial reaction networks.

PubMed

Ganguly, Arnab; Petrov, Tatjana; Koeppl, Heinz

2014-09-01

We consider a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure. A sufficient condition for defining a CTMC over the aggregates is presented as a variant of weak lumpability, which also characterizes that the measure over the original process can be recovered from that of the aggregated one. We show how the applicability of de-aggregation depends on the initial distribution. The application section is devoted to illustrate how the developed theory aids in reducing CTMC models of biochemical systems particularly in connection to protein-protein interactions. We assume that the model is written by a biologist in form of site-graph-rewrite rules. Site-graph-rewrite rules compactly express that, often, only a local context of a protein (instead of a full molecular species) needs to be in a certain configuration in order to trigger a reaction event. This observation leads to suitable aggregate Markov chains with smaller state spaces, thereby providing sufficient reduction in computational complexity. This is further exemplified in two case studies: simple unbounded polymerization and early EGFR/insulin crosstalk.

Quark Phase Transition in Compact Objects and Multimessenger Astronomy: Neutrino Signals, Supernovae and Gamma-Ray Bursts

NASA Astrophysics Data System (ADS)

Sokolov, V. V.; Vlasyuk, V. V.; Petkov, V. B.

2016-06-01

The International Workshop on Quark Phase Transition in Compact Objects and Multimessenger Astronomy: Neutrino Signals, Supernovae and Gamma-Ray Bursts (October, 7-14, 2015) was dedicated to Quantum ChromoDynamics (QCD) Phase Transitions and observational signals of these transitions related to formation of compact astrophysical objects. The aim of this workshop was to bring together researchers working on the problems of behavior of matter under critical conditions achievable in such astrophysical objects as "strange" or "hybrid" stars and in laboratories at heavy-ion collisions to discuss fundamental issues and recent developments. Topics included both observations (radio, optical and X-ray astronomy, gamma ray bursts, gravitational waves, neutrino detection, heavy-ion collisions, etc.) and theory (supernova simulations, proto-neutron and neutron stars, equation of state of dense matter, neutron star cooling, unstable modes, nucleosynthesis, explosive transitions, quark-gluon plasma).

Advanced Code-Division Multiplexers for Superconducting Detector Arrays

NASA Astrophysics Data System (ADS)

Irwin, K. D.; Cho, H. M.; Doriese, W. B.; Fowler, J. W.; Hilton, G. C.; Niemack, M. D.; Reintsema, C. D.; Schmidt, D. R.; Ullom, J. N.; Vale, L. R.

2012-06-01

Multiplexers based on the modulation of superconducting quantum interference devices are now regularly used in multi-kilopixel arrays of superconducting detectors for astrophysics, cosmology, and materials analysis. Over the next decade, much larger arrays will be needed. These larger arrays require new modulation techniques and compact multiplexer elements that fit within each pixel. We present a new in-focal-plane code-division multiplexer that provides multiplexing elements with the required scalability. This code-division multiplexer uses compact lithographic modulation elements that simultaneously multiplex both signal outputs and superconducting transition-edge sensor (TES) detector bias voltages. It eliminates the shunt resistor used to voltage bias TES detectors, greatly reduces power dissipation, allows different dc bias voltages for each TES, and makes all elements sufficiently compact to fit inside the detector pixel area. These in-focal plane code-division multiplexers can be combined with multi-GHz readout based on superconducting microresonators to scale to even larger arrays.

A case study in programming a quantum annealer for hard operational planning problems

NASA Astrophysics Data System (ADS)

Rieffel, Eleanor G.; Venturelli, Davide; O'Gorman, Bryan; Do, Minh B.; Prystay, Elicia M.; Smelyanskiy, Vadim N.

2015-01-01

We report on a case study in programming an early quantum annealer to attack optimization problems related to operational planning. While a number of studies have looked at the performance of quantum annealers on problems native to their architecture, and others have examined performance of select problems stemming from an application area, ours is one of the first studies of a quantum annealer's performance on parametrized families of hard problems from a practical domain. We explore two different general mappings of planning problems to quadratic unconstrained binary optimization (QUBO) problems, and apply them to two parametrized families of planning problems, navigation-type and scheduling-type. We also examine two more compact, but problem-type specific, mappings to QUBO, one for the navigation-type planning problems and one for the scheduling-type planning problems. We study embedding properties and parameter setting and examine their effect on the efficiency with which the quantum annealer solves these problems. From these results, we derive insights useful for the programming and design of future quantum annealers: problem choice, the mapping used, the properties of the embedding, and the annealing profile all matter, each significantly affecting the performance.

Electrostatic streaming instability modes in complex viscoelastic quantum plasmas

NASA Astrophysics Data System (ADS)

Karmakar, P. K.; Goutam, H. P.

2016-11-01

A generalized quantum hydrodynamic model is procedurally developed to investigate the electrostatic streaming instability modes in viscoelastic quantum electron-ion-dust plasma. Compositionally, inertialess electrons are anticipated to be degenerate quantum particles owing to their large de Broglie wavelengths. In contrast, inertial ions and dust particulates are treated in the same classical framework of linear viscoelastic fluids (non-Newtonian). It considers a dimensionality-dependent Bohmian quantum correction prefactor, γ = [(D - 2)/3D], in electron quantum dynamics, with D symbolizing the problem dimensionality. Applying a regular Fourier-formulaic plane-wave analysis around the quasi-neutral hydrodynamic equilibrium, two distinct instabilities are explored to exist. They stem in ion-streaming (relative to electrons and dust) and dust-streaming (relative to electrons and ions). Their stability is numerically illustrated in judicious parametric windows in both the hydrodynamic and kinetic regimes. The non-trivial influential roles by the relative streams, viscoelasticities, and correction prefactor are analyzed. It is seen that γ acts as a stabilizer for the ion-stream case only. The findings alongside new entailments, as special cases of realistic interest, corroborate well with the earlier predictions in plasma situations. Applicability of the analysis relevant in cosmic and astronomical environments of compact dwarf stars is concisely indicated.

Quantum Walks on the Line with Phase Parameters

NASA Astrophysics Data System (ADS)

Villagra, Marcos; Nakanishi, Masaki; Yamashita, Shigeru; Nakashima, Yasuhiko

In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step toward this objective, the following question is being addressed: Given a graph, what is the probability that a quantum walk arrives at a given vertex after some number of steps? This is a very natural question, and for random walks it can be answered by several different combinatorial arguments. For quantum walks this is a highly non-trivial task. Furthermore, this was only achieved before for one specific coin operator (Hadamard operator) for walks on the line. Even considering only walks on lines, generalizing these computations to a general SU(2) coin operator is a complex task. The main contribution is a closed-form formula for the amplitudes of the state of the walk (which includes the question above) for a general symmetric SU(2) operator for walks on the line. To this end, a coin operator with parameters that alters the phase of the state of the walk is defined. Then, closed-form solutions are computed by means of Fourier analysis and asymptotic approximation methods. We also present some basic properties of the walk which can be deducted using weak convergence theorems for quantum walks. In particular, the support of the induced probability distribution of the walk is calculated. Then, it is shown how changing the parameters in the coin operator affects the resulting probability distribution.

Magnetic monopole condensation transition out of quantum spin ice: application to Pr2 Ir2 O7 and Yb2 Ti2 O7

NASA Astrophysics Data System (ADS)

Chen, Gang

We study the proximate magnetic orders and the related quantum phase transition out of quantum spin ice (QSI). We apply the electromagnetic duality of the compact quantum electrodynamics to analyze the condensation of the magnetic monopoles for QSI. The monopole condensation transition represents a unconventional quantum criticality with unusual scaling laws. The magnetic monopole condensation leads to the magnetic states that belong to the ``2-in 2-out'' spin ice manifold and generically have an enlarged magnetic unit cell. We demonstrate that the antiferromagnetic state with the ordering wavevector Q = 2p(001) is proximate to QSI while the ferromagnetic state with the ordering wavevector Q = (000) is not proximate to QSI. This implies that if there exists a direct transition from QSI to the ferromagnetic state, the transition must be strongly first order. We apply the theory to the puzzling experiments on two pyrochlore systems Pr2Ir2O7 and Yb2Ti2O7. chggst@gmail.com.

Stationary Random Metrics on Hierarchical Graphs Via {(min,+)}-type Recursive Distributional Equations

NASA Astrophysics Data System (ADS)

Khristoforov, Mikhail; Kleptsyn, Victor; Triestino, Michele

2016-07-01

This paper is inspired by the problem of understanding in a mathematical sense the Liouville quantum gravity on surfaces. Here we show how to define a stationary random metric on self-similar spaces which are the limit of nice finite graphs: these are the so-called hierarchical graphs. They possess a well-defined level structure and any level is built using a simple recursion. Stopping the construction at any finite level, we have a discrete random metric space when we set the edges to have random length (using a multiplicative cascade with fixed law {m}). We introduce a tool, the cut-off process, by means of which one finds that renormalizing the sequence of metrics by an exponential factor, they converge in law to a non-trivial metric on the limit space. Such limit law is stationary, in the sense that glueing together a certain number of copies of the random limit space, according to the combinatorics of the brick graph, the obtained random metric has the same law when rescaled by a random factor of law {m} . In other words, the stationary random metric is the solution of a distributional equation. When the measure m has continuous positive density on {mathbf{R}+}, the stationary law is unique up to rescaling and any other distribution tends to a rescaled stationary law under the iterations of the hierarchical transformation. We also investigate topological and geometric properties of the random space when m is log-normal, detecting a phase transition influenced by the branching random walk associated to the multiplicative cascade.

Area law from loop quantum gravity

NASA Astrophysics Data System (ADS)

Hamma, Alioscia; Hung, Ling-Yan; Marcianò, Antonino; Zhang, Mingyi

2018-03-01

We explore the constraints following from requiring the area law in the entanglement entropy in the context of loop quantum gravity. We find a unique solution to the single-link wave function in the large j limit, believed to be appropriate in the semiclassical limit. We then generalize our considerations to multilink coherent states, and find that the area law is preserved very generically using our single-link wave function as a building block. Finally, we develop the framework that generates families of multilink states that preserve the area law while avoiding macroscopic entanglement, the space-time analogue of "Schrödinger's cat." We note that these states, defined on a given set of graphs, are the ground states of some local Hamiltonian that can be constructed explicitly. This can potentially shed light on the construction of the appropriate Hamiltonian constraints in the LQG framework.

A comparison of approaches for finding minimum identifying codes on graphs

NASA Astrophysics Data System (ADS)

Horan, Victoria; Adachi, Steve; Bak, Stanley

2016-05-01

In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a typical computer. One sample problem explored is that of finding a minimum identifying code. To work around the computational issues, a variety of methods are explored and consist of a parallel computing approach using MATLAB, an adiabatic quantum optimization approach using a D-Wave quantum annealing processor, and lastly using satisfiability modulo theory (SMT) and corresponding SMT solvers. Each of these methods requires the problem to be formulated in a unique manner. In this paper, we address the challenges of computing solutions to this NP-hard problem with respect to each of these methods.

Quantum Adiabatic Optimization and Combinatorial Landscapes

NASA Technical Reports Server (NTRS)

Smelyanskiy, V. N.; Knysh, S.; Morris, R. D.

2003-01-01

In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.

Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods

NASA Astrophysics Data System (ADS)

Karimi, Hamed; Rosenberg, Gili; Katzgraber, Helmut G.

2017-10-01

We present and apply a general-purpose, multistart algorithm for improving the performance of low-energy samplers used for solving optimization problems. The algorithm iteratively fixes the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are smaller and less connected, and samplers tend to give better low-energy samples for these problems. The algorithm is trivially parallelizable since each start in the multistart algorithm is independent, and could be applied to any heuristic solver that can be run multiple times to give a sample. We present results for several classes of hard problems solved using simulated annealing, path-integral quantum Monte Carlo, parallel tempering with isoenergetic cluster moves, and a quantum annealer, and show that the success metrics and the scaling are improved substantially. When combined with this algorithm, the quantum annealer's scaling was substantially improved for native Chimera graph problems. In addition, with this algorithm the scaling of the time to solution of the quantum annealer is comparable to the Hamze-de Freitas-Selby algorithm on the weak-strong cluster problems introduced by Boixo et al. Parallel tempering with isoenergetic cluster moves was able to consistently solve three-dimensional spin glass problems with 8000 variables when combined with our method, whereas without our method it could not solve any.

Construction of optimal resources for concatenated quantum protocols

NASA Astrophysics Data System (ADS)

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

2017-06-01

We consider the explicit construction of resource states for measurement-based quantum information processing. We concentrate on special-purpose resource states that are capable to perform a certain operation or task, where we consider unitary Clifford circuits as well as non-trace-preserving completely positive maps, more specifically probabilistic operations including Clifford operations and Pauli measurements. We concentrate on 1 →m and m →1 operations, i.e., operations that map one input qubit to m output qubits or vice versa. Examples of such operations include encoding and decoding in quantum error correction, entanglement purification, or entanglement swapping. We provide a general framework to construct optimal resource states for complex tasks that are combinations of these elementary building blocks. All resource states only contain input and output qubits, and are hence of minimal size. We obtain a stabilizer description of the resulting resource states, which we also translate into a circuit pattern to experimentally generate these states. In particular, we derive recurrence relations at the level of stabilizers as key analytical tool to generate explicit (graph) descriptions of families of resource states. This allows us to explicitly construct resource states for encoding, decoding, and syndrome readout for concatenated quantum error correction codes, code switchers, multiple rounds of entanglement purification, quantum repeaters, and combinations thereof (such as resource states for entanglement purification of encoded states).

High-Dimensional Quantum Information Processing with Linear Optics

NASA Astrophysics Data System (ADS)

Fitzpatrick, Casey A.

Quantum information processing (QIP) is an interdisciplinary field concerned with the development of computers and information processing systems that utilize quantum mechanical properties of nature to carry out their function. QIP systems have become vastly more practical since the turn of the century. Today, QIP applications span imaging, cryptographic security, computation, and simulation (quantum systems that mimic other quantum systems). Many important strategies improve quantum versions of classical information system hardware, such as single photon detectors and quantum repeaters. Another more abstract strategy engineers high-dimensional quantum state spaces, so that each successful event carries more information than traditional two-level systems allow. Photonic states in particular bring the added advantages of weak environmental coupling and data transmission near the speed of light, allowing for simpler control and lower system design complexity. In this dissertation, numerous novel, scalable designs for practical high-dimensional linear-optical QIP systems are presented. First, a correlated photon imaging scheme using orbital angular momentum (OAM) states to detect rotational symmetries in objects using measurements, as well as building images out of those interactions is reported. Then, a statistical detection method using chains of OAM superpositions distributed according to the Fibonacci sequence is established and expanded upon. It is shown that the approach gives rise to schemes for sorting, detecting, and generating the recursively defined high-dimensional states on which some quantum cryptographic protocols depend. Finally, an ongoing study based on a generalization of the standard optical multiport for applications in quantum computation and simulation is reported upon. The architecture allows photons to reverse momentum inside the device. This in turn enables realistic implementation of controllable linear-optical scattering vertices for carrying out quantum walks on arbitrary graph structures, a powerful tool for any quantum computer. It is shown that the novel architecture provides new, efficient capabilities for the optical quantum simulation of Hamiltonians and topologically protected states. Further, these simulations use exponentially fewer resources than feedforward techniques, scale linearly to higher-dimensional systems, and use only linear optics, thus offering a concrete experimentally achievable implementation of graphical models of discrete-time quantum systems.

Cellerator: extending a computer algebra system to include biochemical arrows for signal transduction simulations

NASA Technical Reports Server (NTRS)

Shapiro, Bruce E.; Levchenko, Andre; Meyerowitz, Elliot M.; Wold, Barbara J.; Mjolsness, Eric D.

2003-01-01

Cellerator describes single and multi-cellular signal transduction networks (STN) with a compact, optionally palette-driven, arrow-based notation to represent biochemical reactions and transcriptional activation. Multi-compartment systems are represented as graphs with STNs embedded in each node. Interactions include mass-action, enzymatic, allosteric and connectionist models. Reactions are translated into differential equations and can be solved numerically to generate predictive time courses or output as systems of equations that can be read by other programs. Cellerator simulations are fully extensible and portable to any operating system that supports Mathematica, and can be indefinitely nested within larger data structures to produce highly scaleable models.

Magnetic-Field-Assisted Terahertz Quantum Cascade Laser Operating up to 225 K

NASA Technical Reports Server (NTRS)

Wade, A.; Fedorov, G.; Smirnov, D.; Kumar, S.; Williams, B. S.; Hu, Q.; Reno, J. L.

2008-01-01

Advances in semiconductor bandgap engineering have resulted in the recent development of the terahertz quantum cascade laser1. These compact optoelectronic devices now operate in the frequency range 1.2-5 THz, although cryogenic cooling is still required2.3. Further progress towards the realization of devices operating at higher temperatures and emitting at longer wavelengths (sub-terahertz quantum cascade lasers) is difficult because it requires maintaining a population inversion between closely spaced electronic sub-bands (1 THz approx. equals 4 meV). Here, we demonstrate a magnetic-field-assisted quantum cascade laser based on the resonant-phonon design. By applying appropriate electrical bias and strong magnetic fields above 16 T, it is possible to achieve laser emission from a single device over a wide range of frequencies (0.68-3.33 THz). Owing to the suppression of inter-landau-level non-radiative scattering, the device shows magnetic field assisted laser action at 1 THz at temperatures up to 215 K, and 3 THz lasing up to 225 K.

Terahertz multiheterodyne spectroscopy using laser frequency combs

DOE PAGES

Yang, Yang; Burghoff, David; Hayton, Darren J.; ...

2014-07-01

The terahertz region is of great importance for spectroscopy since many molecules have absorption fingerprints there. Frequency combs based on terahertz quantum cascade lasers feature broadband coverage and high output powers in a compact package, making them an attractive option for broadband spectroscopy. Here, we demonstrate the first multiheterodyne spectroscopy using two terahertz quantum cascade laser combs. Over a spectral range of 250 GHz, we achieve average signal-to-noise ratios of 34 dB using cryogenic detectors and 24 dB using room-temperature detectors, all in just 100 μs. As a proof of principle, we use these combs to measure the broadband transmissionmore » spectrum of etalon samples and show that, with proper signal processing, it is possible to extend the multiheterodyne spectroscopy to quantum cascade laser combs operating in pulsed mode. Here, this greatly expands the range of quantum cascade lasers that could be suitable for these techniques and allows for the creation of completely solid-state terahertz laser spectrometers.« less

Distillation of photon entanglement using a plasmonic metamaterial

PubMed Central

Asano, Motoki; Bechu, Muriel; Tame, Mark; Kaya Özdemir, Şahin; Ikuta, Rikizo; Güney, Durdu Ö.; Yamamoto, Takashi; Yang, Lan; Wegener, Martin; Imoto, Nobuyuki

2015-01-01

Plasmonics is a rapidly emerging platform for quantum state engineering with the potential for building ultra-compact and hybrid optoelectronic devices. Recent experiments have shown that despite the presence of decoherence and loss, photon statistics and entanglement can be preserved in single plasmonic systems. This preserving ability should carry over to plasmonic metamaterials, whose properties are the result of many individual plasmonic systems acting collectively, and can be used to engineer optical states of light. Here, we report an experimental demonstration of quantum state filtering, also known as entanglement distillation, using a metamaterial. We show that the metamaterial can be used to distill highly entangled states from less entangled states. As the metamaterial can be integrated with other optical components this work opens up the intriguing possibility of incorporating plasmonic metamaterials in on-chip quantum state engineering tasks. PMID:26670790

Distillation of photon entanglement using a plasmonic metamaterial.

PubMed

Asano, Motoki; Bechu, Muriel; Tame, Mark; Kaya Özdemir, Şahin; Ikuta, Rikizo; Güney, Durdu Ö; Yamamoto, Takashi; Yang, Lan; Wegener, Martin; Imoto, Nobuyuki

2015-12-16

Plasmonics is a rapidly emerging platform for quantum state engineering with the potential for building ultra-compact and hybrid optoelectronic devices. Recent experiments have shown that despite the presence of decoherence and loss, photon statistics and entanglement can be preserved in single plasmonic systems. This preserving ability should carry over to plasmonic metamaterials, whose properties are the result of many individual plasmonic systems acting collectively, and can be used to engineer optical states of light. Here, we report an experimental demonstration of quantum state filtering, also known as entanglement distillation, using a metamaterial. We show that the metamaterial can be used to distill highly entangled states from less entangled states. As the metamaterial can be integrated with other optical components this work opens up the intriguing possibility of incorporating plasmonic metamaterials in on-chip quantum state engineering tasks.

Rotated waveplates in integrated waveguide optics.

PubMed

Corrielli, Giacomo; Crespi, Andrea; Geremia, Riccardo; Ramponi, Roberta; Sansoni, Linda; Santinelli, Andrea; Mataloni, Paolo; Sciarrino, Fabio; Osellame, Roberto

2014-06-25

Controlling and manipulating the polarization state of a light beam is crucial in applications ranging from optical sensing to optical communications, both in the classical and quantum regime, and ultimately whenever interference phenomena are to be exploited. In addition, many of these applications present severe requirements of phase stability and greatly benefit from a monolithic integrated-optics approach. However, integrated devices that allow arbitrary transformations of the polarization state are very difficult to produce with conventional lithographic technologies. Here we demonstrate waveguide-based optical waveplates, with arbitrarily rotated birefringence axis, fabricated by femtosecond laser pulses. To validate our approach, we exploit this component to realize a compact device for the quantum state tomography of two polarization-entangled photons. This work opens perspectives for integrated manipulation of polarization-encoded information with relevant applications ranging from integrated polarimetric sensing to quantum key distribution.

Tunable External Cavity Quantum Cascade Lasers (EC-QCL): an application field for MOEMS based scanning gratings

NASA Astrophysics Data System (ADS)

Grahmann, Jan; Merten, André; Ostendorf, Ralf; Fontenot, Michael; Bleh, Daniela; Schenk, Harald; Wagner, Hans-Joachim

2014-03-01

In situ process information in the chemical, pharmaceutical or food industry as well as emission monitoring, sensitive trace detection and biological sensing applications would increasingly rely on MIR-spectroscopic anal­ysis in the 3 μm - 12 μm wavelength range. However, cost effective, portable, low power consuming and fast spectrometers with a wide tuning range are not available so far. To provide these MIR-spectrometer properties, the combination of quantum cascade lasers with a MOEMS scanning grating as wavelength selective element in the external cavity is addressed to provide a very compact and fast tunable laser source for spectroscopic analysis.

Three-color Sagnac source of polarization-entangled photon pairs.

PubMed

Hentschel, Michael; Hübel, Hannes; Poppe, Andreas; Zeilinger, Anton

2009-12-07

We demonstrate a compact and stable source of polarization-entangled pairs of photons, one at 810 nm wavelength for high detection efficiency and the other at 1550 nm for long-distance fiber communication networks. Due to a novel Sagnac-based design of the interferometer no active stabilization is needed. Using only one 30 mm ppKTP bulk crystal the source produces photons with a spectral brightness of 1.13 x 10(6) pairs/s/mW/THz with an entanglement fidelity of 98.2%. Both photons are single-mode fiber coupled and ready to be used in quantum key distribution (QKD) or transmission of photonic quantum states over large distances.