Preparation and Measurement of Three-Qubit Entanglement in a Superconducting Circuit

Traditionally, quantum entanglement has played a central role in foundational discussions of quantum mechanics. The measurement of correlations between entangled particles can exhibit results at odds with classical behavior. These discrepancies increase exponentially with the number of entangled particles. When entanglement is extended from just two quantum bits (qubits) to three, the incompatibilities between classical and quantum correlation properties can change from a violation of inequalities involving statistical averages to sign differences in deterministic observations. With the ample confirmation of quantum mechanical predictions by experiments, entanglement has evolved from a philosophical conundrum to a key resource for quantum-based technologies, like quantum cryptography and computation. In particular, maximal entanglement of more than two qubits is crucial to the implementation of quantum error correction protocols. While entanglement of up to 3, 5, and 8 qubits has been demonstrated among spins, photons, and ions, respectively, entanglement in engineered solid-state systems has been limited to two qubits. Here, we demonstrate three-qubit entanglement in a superconducting circuit, creating Greenberger-Horne-Zeilinger (GHZ) states with fidelity of 88%, measured with quantum state tomography. Several entanglement witnesses show violation of bi-separable bounds by 830\pm80%. Our entangling sequence realizes the first step of basic quantum error correction, namely the encoding of a logical qubit into a manifold of GHZ-like states using a repetition code. The integration of encoding, decoding and error-correcting steps in a feedback loop will be the next milestone for quantum computing with integrated circuits.Comment: 7 pages, 4 figures, and Supplementary Information (4 figures)

Exhaustive identification of steady state cycles in large stoichiometric networks

BACKGROUND: Identifying cyclic pathways in chemical reaction networks is important, because such cycles may indicate in silico violation of energy conservation, or the existence of feedback in vivo. Unfortunately, our ability to identify cycles in stoichiometric networks, such as signal transduction and genome-scale metabolic networks, has been hampered by the computational complexity of the methods currently used. RESULTS: We describe a new algorithm for the identification of cycles in stoichiometric networks, and we compare its performance to two others by exhaustively identifying the cycles contained in the genome-scale metabolic networks of H. pylori, M. barkeri, E. coli, and S. cerevisiae. Our algorithm can substantially decrease both the execution time and maximum memory usage in comparison to the two previous algorithms. CONCLUSION: The algorithm we describe improves our ability to study large, real-world, biochemical reaction networks, although additional methodological improvements are desirable

METANNOGEN: compiling features of biochemical reactions needed for the reconstruction of metabolic networks

BACKGROUND: One central goal of computational systems biology is the mathematical modelling of complex metabolic reaction networks. The first and most time-consuming step in the development of such models consists in the stoichiometric reconstruction of the network, i. e. compilation of all metabolites, reactions and transport processes relevant to the considered network and their assignment to the various cellular compartments. Therefore an information system is required to collect and manage data from different databases and scientific literature in order to generate a metabolic network of biochemical reactions that can be subjected to further computational analyses. RESULTS: The computer program METANNOGEN facilitates the reconstruction of metabolic networks. It uses the well-known database of biochemical reactions KEGG of biochemical reactions as primary information source from which biochemical reactions relevant to the considered network can be selected, edited and stored in a separate, user-defined database. Reactions not contained in KEGG can be entered manually into the system. To aid the decision whether or not a reaction selected from KEGG belongs to the considered network METANNOGEN contains information of SWISSPROT and ENSEMBL and provides Web links to a number of important information sources like METACYC, BRENDA, NIST, and REACTOME. If a reaction is reported to occur in more than one cellular compartment, a corresponding number of reactions is generated each referring to one specific compartment. Transport processes of metabolites are entered like chemical reactions where reactants and products have different compartment attributes. The list of compartmentalized biochemical reactions and membrane transport processes compiled by means of METANNOGEN can be exported as an SBML file for further computational analysis. METANNOGEN is highly customizable with respect to the content of the SBML output file, additional data-fields, the graphical input form, highlighting of project specific search terms and dynamically generated Web-links. CONCLUSION: METANNOGEN is a flexible tool to manage information for the design of metabolic networks. The program requires Java Runtime Environment 1.4 or higher and about 100 MB of free RAM and about 200 MB of free HD space. It does not require installation and can be directly Java-webstarted from

Optimal flux spaces of genome-scale stoichiometric models are determined by a few subnetworks

The metabolism of organisms can be studied with comprehensive stoichiometric models of their metabolic networks. Flux balance analysis (FBA) calculates optimal metabolic performance of stoichiometric models. However, detailed biological interpretation of FBA is limited because, in general, a huge number of flux patterns give rise to the same optimal performance. The complete description of the resulting optimal solution spaces was thus far a computationally intractable problem. Here we present CoPE-FBA: Comprehensive Polyhedra Enumeration Flux Balance Analysis, a computational method that solves this problem. CoPE-FBA indicates that the thousands to millions of optimal flux patterns result from a combinatorial explosion of flux patterns in just a few metabolic sub-networks. The entire optimal solution space can now be compactly described in terms of the topology of these sub-networks. CoPE-FBA simplifies the biological interpretation of stoichiometric models of metabolism, and provides a profound understanding of metabolic flexibility in optimal states

Spontaneous Reaction Silencing in Metabolic Optimization

Metabolic reactions of single-cell organisms are routinely observed to become dispensable or even incapable of carrying activity under certain circumstances. Yet, the mechanisms as well as the range of conditions and phenotypes associated with this behavior remain very poorly understood. Here we predict computationally and analytically that any organism evolving to maximize growth rate, ATP production, or any other linear function of metabolic fluxes tends to significantly reduce the number of active metabolic reactions compared to typical non-optimal states. The reduced number appears to be constant across the microbial species studied and just slightly larger than the minimum number required for the organism to grow at all. We show that this massive spontaneous reaction silencing is triggered by the irreversibility of a large fraction of the metabolic reactions and propagates through the network as a cascade of inactivity. Our results help explain existing experimental data on intracellular flux measurements and the usage of latent pathways, shedding new light on microbial evolution, robustness, and versatility for the execution of specific biochemical tasks. In particular, the identification of optimal reaction activity provides rigorous ground for an intriguing knockout-based method recently proposed for the synthetic recovery of metabolic function.Comment: 34 pages, 6 figure

Exploiting the pathway structure of metabolism to reveal high-order epistasis

<p>Abstract</p> <p>Background</p> <p>Biological robustness results from redundant pathways that achieve an essential objective, e.g. the production of biomass. As a consequence, the biological roles of many genes can only be revealed through multiple knockouts that identify a <it>set </it>of genes as essential for a given function. The identification of such "epistatic" essential relationships between network components is critical for the understanding and eventual manipulation of robust systems-level phenotypes.</p> <p>Results</p> <p>We introduce and apply a network-based approach for genome-scale metabolic knockout design. We apply this method to uncover over 11,000 minimal knockouts for biomass production in an <it>in silico </it>genome-scale model of <it>E. coli</it>. A large majority of these "essential sets" contain 5 or more reactions, and thus represent complex epistatic relationships between components of the <it>E. coli </it>metabolic network.</p> <p>Conclusion</p> <p>The complex minimal biomass knockouts discovered with our approach illuminate robust essential systems-level roles for reactions in the <it>E. coli </it>metabolic network. Unlike previous approaches, our method yields results regarding high-order epistatic relationships and is applicable at the genome-scale.</p

Understanding the Adaptive Growth Strategy of Lactobacillus plantarum by In Silico Optimisation

In the study of metabolic networks, optimization techniques are often used to predict flux distributions, and hence, metabolic phenotype. Flux balance analysis in particular has been successful in predicting metabolic phenotypes. However, an inherent limitation of a stoichiometric approach such as flux balance analysis is that it can predict only flux distributions that result in maximal yields. Hence, previous attempts to use FBA to predict metabolic fluxes in Lactobacillus plantarum failed, as this lactic acid bacterium produces lactate, even under glucose-limited chemostat conditions, where FBA predicted mixed acid fermentation as an alternative pathway leading to a higher yield. In this study we tested, however, whether long-term adaptation on an unusual and poor carbon source (for this bacterium) would select for mutants with optimal biomass yields. We have therefore adapted Lactobacillus plantarum to grow well on glycerol as its main growth substrate. After prolonged serial dilutions, the growth yield and corresponding fluxes were compared to in silico predictions. Surprisingly, the organism still produced mainly lactate, which was corroborated by FBA to indeed be optimal. To understand these results, constraint-based elementary flux mode analysis was developed that predicted 3 out of 2669 possible flux modes to be optimal under the experimental conditions. These optimal pathways corresponded very closely to the experimentally observed fluxes and explained lactate formation as the result of competition for oxygen by the other flux modes. Hence, these results provide thorough understanding of adaptive evolution, allowing in silico predictions of the resulting flux states, provided that the selective growth conditions favor yield optimization as the winning strategy

Topological Structure of the Space of Phenotypes: The Case of RNA Neutral Networks

The evolution and adaptation of molecular populations is constrained by the diversity accessible through mutational processes. RNA is a paradigmatic example of biopolymer where genotype (sequence) and phenotype (approximated by the secondary structure fold) are identified in a single molecule. The extreme redundancy of the genotype-phenotype map leads to large ensembles of RNA sequences that fold into the same secondary structure and can be connected through single-point mutations. These ensembles define neutral networks of phenotypes in sequence space. Here we analyze the topological properties of neutral networks formed by 12-nucleotides RNA sequences, obtained through the exhaustive folding of sequence space. A total of 412 sequences fragments into 645 subnetworks that correspond to 57 different secondary structures. The topological analysis reveals that each subnetwork is far from being random: it has a degree distribution with a well-defined average and a small dispersion, a high clustering coefficient, and an average shortest path between nodes close to its minimum possible value, i.e. the Hamming distance between sequences. RNA neutral networks are assortative due to the correlation in the composition of neighboring sequences, a feature that together with the symmetries inherent to the folding process explains the existence of communities. Several topological relationships can be analytically derived attending to structural restrictions and generic properties of the folding process. The average degree of these phenotypic networks grows logarithmically with their size, such that abundant phenotypes have the additional advantage of being more robust to mutations. This property prevents fragmentation of neutral networks and thus enhances the navigability of sequence space. In summary, RNA neutral networks show unique topological properties, unknown to other networks previously described

Genome-Scale Metabolic Modeling Elucidates the Role of Proliferative Adaptation in Causing the Warburg Effect

The Warburg effect - a classical hallmark of cancer metabolism - is a counter-intuitive phenomenon in which rapidly proliferating cancer cells resort to inefficient ATP production via glycolysis leading to lactate secretion, instead of relying primarily on more efficient energy production through mitochondrial oxidative phosphorylation, as most normal cells do. The causes for the Warburg effect have remained a subject of considerable controversy since its discovery over 80 years ago, with several competing hypotheses. Here, utilizing a genome-scale human metabolic network model accounting for stoichiometric and enzyme solvent capacity considerations, we show that the Warburg effect is a direct consequence of the metabolic adaptation of cancer cells to increase biomass production rate. The analysis is shown to accurately capture a three phase metabolic behavior that is observed experimentally during oncogenic progression, as well as a prominent characteristic of cancer cells involving their preference for glutamine uptake over other amino acids

Structural and functional analysis of cellular networks with CellNetAnalyzer

BACKGROUND: Mathematical modelling of cellular networks is an integral part of Systems Biology and requires appropriate software tools. An important class of methods in Systems Biology deals with structural or topological (parameter-free) analysis of cellular networks. So far, software tools providing such methods for both mass-flow (metabolic) as well as signal-flow (signalling and regulatory) networks are lacking. RESULTS: Herein we introduce CellNetAnalyzer, a toolbox for MATLAB facilitating, in an interactive and visual manner, a comprehensive structural analysis of metabolic, signalling and regulatory networks. The particular strengths of CellNetAnalyzer are methods for functional network analysis, i.e. for characterising functional states, for detecting functional dependencies, for identifying intervention strategies, or for giving qualitative predictions on the effects of perturbations. CellNetAnalyzer extends its predecessor FluxAnalyzer (originally developed for metabolic network and pathway analysis) by a new modelling framework for examining signal-flow networks. Two of the novel methods implemented in CellNetAnalyzer are discussed in more detail regarding algorithmic issues and applications: the computation and analysis (i) of shortest positive and shortest negative paths and circuits in interaction graphs and (ii) of minimal intervention sets in logical networks. CONCLUSION: CellNetAnalyzer provides a single suite to perform structural and qualitative analysis of both mass-flow- and signal-flow-based cellular networks in a user-friendly environment. It provides a large toolbox with various, partially unique, functions and algorithms for functional network analysis.CellNetAnalyzer is freely available for academic use