@article{7727, abstract = {Genes of the major histocompatibility complex (MHC) have been shown to influence social signalling and mate preferences in many species, including humans. First observations suggest that MHC signalling may also affect female fertility. To test this hypothesis, we exposed 191 female horses (Equus caballus) to either an MHC-similar or an MHC-dissimilar stimulus male around the time of ovulation and conception. A within-subject experimental design controlled for non-MHC-linked male characteristics, and instrumental insemination with semen of other males (n = 106) controlled for potential confounding effects of semen or embryo characteristics. We found that females were more likely to become pregnant if exposed to an MHC-dissimilar than to an MHC-similar male, while overall genetic distance to the stimulus males (based on microsatellite markers on 20 chromosomes) had no effect. Our results demonstrate that early pregnancy failures can be due to maternal life-history decisions (cryptic female choice) influenced by MHC-linked social signalling.}, author = {Burger, D. and Thomas, S. and Aepli, H. and Dreyer, M. and Fabre, G. and Marti, E. and Sieme, H. and Robinson, Matthew Richard and Wedekind, C.}, issn = {0962-8452}, journal = {Proceedings of the Royal Society B: Biological Sciences}, number = {1868}, publisher = {The Royal Society}, title = {{Major histocompatibility complex-linked social signalling affects female fertility}}, doi = {10.1098/rspb.2017.1824}, volume = {284}, year = {2017}, } @article{7728, abstract = {Meta-analyses of genome-wide association studies, which dominate genetic discovery, are based on data from diverse historical time periods and populations. Genetic scores derived from genome-wide association studies explain only a fraction of the heritability estimates obtained from whole-genome studies on single populations, known as the ‘hidden heritability’ puzzle. Using seven sampling populations (n = 35,062), we test whether hidden heritability is attributed to heterogeneity across sampling populations and time, showing that estimates are substantially smaller across populations compared with within populations. We show that the hidden heritability varies substantially: from zero for height to 20% for body mass index, 37% for education, 40% for age at first birth and up to 75% for number of children. Simulations demonstrate that our results are more likely to reflect heterogeneity in phenotypic measurement or gene–environment interactions than genetic heterogeneity. These findings have substantial implications for genetic discovery, suggesting that large homogenous datasets are required for behavioural phenotypes and that gene–environment interaction may be a central challenge for genetic discovery.}, author = {Tropf, Felix C. and Lee, S. Hong and Verweij, Renske M. and Stulp, Gert and van der Most, Peter J. and de Vlaming, Ronald and Bakshi, Andrew and Briley, Daniel A. and Rahal, Charles and Hellpap, Robert and Iliadou, Anastasia N. and Esko, Tõnu and Metspalu, Andres and Medland, Sarah E. and Martin, Nicholas G. and Barban, Nicola and Snieder, Harold and Robinson, Matthew Richard and Mills, Melinda C.}, issn = {2397-3374}, journal = {Nature Human Behaviour}, number = {10}, pages = {757--765}, publisher = {Springer Nature}, title = {{Hidden heritability due to heterogeneity across seven populations}}, doi = {10.1038/s41562-017-0195-1}, volume = {1}, year = {2017}, } @article{7729, abstract = {Quantifying the effects of inbreeding is critical to characterizing the genetic architecture of complex traits. This study highlights through theory and simulations the strengths and shortcomings of three SNP-based inbreeding measures commonly used to estimate inbreeding depression (ID). We demonstrate that heterogeneity in linkage disequilibrium (LD) between causal variants and SNPs biases ID estimates, and we develop an approach to correct this bias using LD and minor allele frequency stratified inference (LDMS). We quantified ID in 25 traits measured in ∼140,000 participants of the UK Biobank, using LDMS, and confirmed previously published ID for 4 traits. We find unique evidence of ID for handgrip strength, waist/hip ratio, and visual and auditory acuity (ID between −2.3 and −5.2 phenotypic SDs for complete inbreeding; P<0.001). Our results illustrate that a careful choice of the measure of inbreeding combined with LDMS stratification improves both detection and quantification of ID using SNP data.}, author = {Yengo, Loic and Zhu, Zhihong and Wray, Naomi R. and Weir, Bruce S. and Yang, Jian and Robinson, Matthew Richard and Visscher, Peter M.}, issn = {0027-8424}, journal = {Proceedings of the National Academy of Sciences}, number = {32}, pages = {8602--8607}, publisher = {Proceedings of the National Academy of Sciences}, title = {{Detection and quantification of inbreeding depression for complex traits from SNP data}}, doi = {10.1073/pnas.1621096114}, volume = {114}, year = {2017}, } @article{7731, abstract = {Genetic association studies in admixed populations are underrepresented in the genomics literature, with a key concern for researchers being the adequate control of spurious associations due to population structure. Linear mixed models (LMMs) are well suited for genome-wide association studies (GWAS) because they account for both population stratification and cryptic relatedness and achieve increased statistical power by jointly modeling all genotyped markers. Additionally, Bayesian LMMs allow for more flexible assumptions about the underlying distribution of genetic effects, and can concurrently estimate the proportion of phenotypic variance explained by genetic markers. Using three recently published Bayesian LMMs, Bayes R, BSLMM, and BOLT-LMM, we investigate an existing data set on eye (n = 625) and skin (n = 684) color from Cape Verde, an island nation off West Africa that is home to individuals with a broad range of phenotypic values for eye and skin color due to the mix of West African and European ancestry. We use simulations to demonstrate the utility of Bayesian LMMs for mapping loci and studying the genetic architecture of quantitative traits in admixed populations. The Bayesian LMMs provide evidence for two new pigmentation loci: one for eye color (AHRR) and one for skin color (DDB1).}, author = {Lloyd-Jones, Luke R. and Robinson, Matthew Richard and Moser, Gerhard and Zeng, Jian and Beleza, Sandra and Barsh, Gregory S. and Tang, Hua and Visscher, Peter M.}, issn = {0016-6731}, journal = {Genetics}, number = {2}, pages = {1113--1126}, publisher = {Genetics Society of America}, title = {{Inference on the genetic basis of eye and skin color in an admixed population via Bayesian linear mixed models}}, doi = {10.1534/genetics.116.193383}, volume = {206}, year = {2017}, } @article{7733, abstract = {Sections PDFPDF Tools Share Abstract Background: Gene discovery has provided remarkable biological insights into amyotrophic lateral sclerosis (ALS). One challenge for clinical application of genetic testing is critical evaluation of the significance of reported variants. Methods: We use whole exome sequencing (WES) to develop a clinically relevant approach to identify a subset of ALS patients harboring likely pathogenic mutations. In parallel, we assess if DNA methylation can be used to screen for pathogenicity of novel variants since a methylation signature has been shown to associate with the pathogenic C9orf72 expansion, but has not been explored for other ALS mutations. Australian patients identified with ALS‐relevant variants were cross‐checked with population databases and case reports to critically assess whether they were “likely causal,” “uncertain significance,” or “unlikely causal.” Results: Published ALS variants were identified in >10% of patients; however, in only 3% of patients (4/120) could these be confidently considered pathogenic (in SOD1 and TARDBP). We found no evidence for a differential DNA methylation signature in these mutation carriers. Conclusions: The use of WES in a typical ALS clinic demonstrates a critical approach to variant assessment with the capability to combine cohorts to enhance the largely unknown genetic basis of ALS.}, author = {Garton, Fleur C. and Benyamin, Beben and Zhao, Qiongyi and Liu, Zhijun and Gratten, Jacob and Henders, Anjali K. and Zhang, Zong-Hong and Edson, Janette and Furlong, Sarah and Morgan, Sarah and Heggie, Susan and Thorpe, Kathryn and Pfluger, Casey and Mather, Karen A. and Sachdev, Perminder S. and McRae, Allan F. and Robinson, Matthew Richard and Shah, Sonia and Visscher, Peter M. and Mangelsdorf, Marie and Henderson, Robert D. and Wray, Naomi R. and McCombe, Pamela A.}, issn = {2324-9269}, journal = {Molecular Genetics & Genomic Medicine}, number = {4}, pages = {418--428}, publisher = {Wiley}, title = {{Whole exome sequencing and DNA methylation analysis in a clinical amyotrophic lateral sclerosis cohort}}, doi = {10.1002/mgg3.302}, volume = {5}, year = {2017}, } @article{7755, abstract = {We give a bird's-eye view of the plastic deformation of crystals aimed at the statistical physics community, as well as a broad introduction to the statistical theories of forced rigid systems aimed at the plasticity community. Memory effects in magnets, spin glasses, charge density waves, and dilute colloidal suspensions are discussed in relation to the onset of plastic yielding in crystals. Dislocation avalanches and complex dislocation tangles are discussed via a brief introduction to the renormalization group and scaling. Analogies to emergent scale invariance in fracture, jamming, coarsening, and a variety of depinning transitions are explored. Dislocation dynamics in crystals challenge nonequilibrium statistical physics. Statistical physics provides both cautionary tales of subtle memory effects in nonequilibrium systems and systematic tools designed to address complex scale-invariant behavior on multiple length scales and timescales.}, author = {Sethna, James P. and Bierbaum, Matthew K. and Dahmen, Karin A. and Goodrich, Carl Peter and Greer, Julia R. and Hayden, Lorien X. and Kent-Dobias, Jaron P. and Lee, Edward D. and Liarte, Danilo B. and Ni, Xiaoyue and Quinn, Katherine N. and Raju, Archishman and Rocklin, D. Zeb and Shekhawat, Ashivni and Zapperi, Stefano}, issn = {1531-7331}, journal = {Annual Review of Materials Research}, pages = {217--246}, publisher = {Annual Reviews}, title = {{Deformation of crystals: Connections with statistical physics}}, doi = {10.1146/annurev-matsci-070115-032036}, volume = {47}, year = {2017}, } @article{7756, abstract = {We study the shear jamming of athermal frictionless soft spheres, and find that in the thermodynamic limit, a shear-jammed state exists with different elastic properties from the isotropically-jammed state. For example, shear-jammed states can have a non-zero residual shear stress in the thermodynamic limit that arises from long-range stress-stress correlations. As a result, the ratio of the shear and bulk moduli, which in isotropically-jammed systems vanishes as the jamming transition is approached from above, instead approaches a constant. Despite these striking differences, we argue that in a deeper sense, the shear jamming and isotropic jamming transitions actually have the same symmetry, and that the differences can be fully understood by rotating the six-dimensional basis of the elastic modulus tensor.}, author = {Baity-Jesi, Marco and Goodrich, Carl Peter and Liu, Andrea J. and Nagel, Sidney R. and Sethna, James P.}, issn = {0022-4715}, journal = {Journal of Statistical Physics}, number = {3-4}, pages = {735--748}, publisher = {Springer Nature}, title = {{Emergent SO(3) symmetry of the frictionless shear jamming transition}}, doi = {10.1007/s10955-016-1703-9}, volume = {167}, year = {2017}, } @article{7757, abstract = {Recent advances in designing metamaterials have demonstrated that global mechanical properties of disordered spring networks can be tuned by selectively modifying only a small subset of bonds. Here, using a computationally efficient approach, we extend this idea to tune more general properties of networks. With nearly complete success, we are able to produce a strain between any two target nodes in a network in response to an applied source strain on any other pair of nodes by removing only ∼1% of the bonds. We are also able to control multiple pairs of target nodes, each with a different individual response, from a single source, and to tune multiple independent source/target responses simultaneously into a network. We have fabricated physical networks in macroscopic 2D and 3D systems that exhibit these responses. This work is inspired by the long-range coupled conformational changes that constitute allosteric function in proteins. The fact that allostery is a common means for regulation in biological molecules suggests that it is a relatively easy property to develop through evolution. In analogy, our results show that long-range coupled mechanical responses are similarly easy to achieve in disordered networks.}, author = {Rocks, Jason W. and Pashine, Nidhi and Bischofberger, Irmgard and Goodrich, Carl Peter and Liu, Andrea J. and Nagel, Sidney R.}, issn = {0027-8424}, journal = {Proceedings of the National Academy of Sciences}, number = {10}, pages = {2520--2525}, publisher = {Proceedings of the National Academy of Sciences}, title = {{Designing allostery-inspired response in mechanical networks}}, doi = {10.1073/pnas.1612139114}, volume = {114}, year = {2017}, } @article{7758, abstract = {Controlling motion at the microscopic scale is a fundamental goal in the development of biologically inspired systems. We show that the motion of active, self-propelled colloids can be sufficiently controlled for use as a tool to assemble complex structures such as braids and weaves out of microscopic filaments. Unlike typical self-assembly paradigms, these structures are held together by geometric constraints rather than adhesive bonds. The out-of-equilibrium assembly that we propose involves precisely controlling the 2D motion of active colloids so that their path has a nontrivial topology. We demonstrate with proof-of-principle Brownian dynamics simulations that, when the colloids are attached to long semiflexible filaments, this motion causes the filaments to braid. The ability of the active particles to provide sufficient force necessary to bend the filaments into a braid depends on a number of factors, including the self-propulsion mechanism, the properties of the filament, and the maximum curvature in the braid. Our work demonstrates that nonequilibrium assembly pathways can be designed using active particles.}, author = {Goodrich, Carl Peter and Brenner, Michael P.}, issn = {0027-8424}, journal = {Proceedings of the National Academy of Sciences}, number = {2}, pages = {257--262}, publisher = {Proceedings of the National Academy of Sciences}, title = {{Using active colloids as machines to weave and braid on the micrometer scale}}, doi = {10.1073/pnas.1608838114}, volume = {114}, year = {2017}, } @inproceedings{787, abstract = {Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as leader election (which requires convergence to a single agent in a special "leader" state), and majority (in which agents must converge to a decision as to which of two possible initial states had higher initial count). Known results point towards an inherent trade-off between the time complexity of such algorithms, and the space complexity, i.e. size of the memory available to each agent. In this paper, we explore this trade-off and provide new upper and lower bounds for majority and leader election. First, we prove a unified lower bound, which relates the space available per node with the time complexity achievable by a protocol: for instance, our result implies that any protocol solving either of these tasks for n agents using O(log log n) states must take (n=polylogn) expected time. This is the first result to characterize time complexity for protocols which employ super-constant number of states per node, and proves that fast, poly-logarithmic running times require protocols to have relatively large space costs. On the positive side, we give algorithms showing that fast, poly-logarithmic convergence time can be achieved using O(log2 n) space per node, in the case of both tasks. Overall, our results highlight a time complexity separation between O(log log n) and (log2 n) state space size for both majority and leader election in population protocols, and introduce new techniques, which should be applicable more broadly.}, author = {Alistarh, Dan-Adrian and Aspnes, James and Eisenstat, David and Rivest, Ronald and Gelashvili, Rati}, booktitle = {Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms}, location = {Barcelona, Spain}, pages = {2560 -- 2579}, publisher = {SIAM}, title = {{Time-space trade-offs in population protocols}}, doi = {10.1137/1.9781611974782.169}, year = {2017}, } @inproceedings{788, abstract = {In contrast to electronic computation, chemical computation is noisy and susceptible to a variety of sources of error, which has prevented the construction of robust complex systems. To be effective, chemical algorithms must be designed with an appropriate error model in mind. Here we consider the model of chemical reaction networks that preserve molecular count (population protocols), and ask whether computation can be made robust to a natural model of unintended “leak” reactions. Our definition of leak is motivated by both the particular spurious behavior seen when implementing chemical reaction networks with DNA strand displacement cascades, as well as the unavoidable side reactions in any implementation due to the basic laws of chemistry. We develop a new “Robust Detection” algorithm for the problem of fast (logarithmic time) single molecule detection, and prove that it is robust to this general model of leaks. Besides potential applications in single molecule detection, the error-correction ideas developed here might enable a new class of robust-by-design chemical algorithms. Our analysis is based on a non-standard hybrid argument, combining ideas from discrete analysis of population protocols with classic Markov chain techniques.}, author = {Alistarh, Dan-Adrian and Dudek, Bartłomiej and Kosowski, Adrian and Soloveichik, David and Uznański, Przemysław}, pages = {155 -- 171}, publisher = {Springer}, title = {{Robust detection in leak-prone population protocols}}, doi = {10.1007/978-3-319-66799-7_11}, volume = {10467 LNCS}, year = {2017}, } @inproceedings{789, abstract = {The problem of efficient concurrent memory reclamation in unmanaged languages such as C or C++ is one of the major challenges facing the parallelization of billions of lines of legacy code. Garbage collectors for C/C++ can be inefficient; thus, programmers are often forced to use finely-crafted concurrent memory reclamation techniques. These techniques can provide good performance, but require considerable programming effort to deploy, and have strict requirements, allowing the programmer very little room for error. In this work, we present Forkscan, a new conservative concurrent memory reclamation scheme which is fully automatic and surprisingly scalable. Forkscan's semantics place it between automatic garbage collectors (it requires the programmer to explicitly retire nodes before they can be reclaimed), and concurrent memory reclamation techniques (as it does not assume that nodes are completely unlinked from the data structure for correctness). Forkscan's implementation exploits these new semantics for efficiency: we leverage parallelism and optimized implementations of signaling and copy-on-write in modern operating systems to efficiently obtain and process consistent snapshots of memory that can be scanned concurrently with the normal program operation. Empirical evaluation on a range of classical concurrent data structure microbenchmarks shows that Forkscan can preserve the scalability of the original code, while maintaining an order of magnitude lower latency than automatic garbage collection, and demonstrating competitive performance with finely crafted memory reclamation techniques.}, author = {Alistarh, Dan-Adrian and Leiserson, William and Matveev, Alexander and Shavit, Nir}, pages = {483 -- 498}, publisher = {ACM}, title = {{Forkscan: Conservative memory reclamation for modern operating systems}}, doi = {10.1145/3064176.3064214}, year = {2017}, } @inproceedings{790, abstract = {Stochastic gradient descent (SGD) is a commonly used algorithm for training linear machine learning models. Based on vector algebra, it benefits from the inherent parallelism available in an FPGA. In this paper, we first present a single-precision floating-point SGD implementation on an FPGA that provides similar performance as a 10-core CPU. We then adapt the design to make it capable of processing low-precision data. The low-precision data is obtained from a novel compression scheme - called stochastic quantization, specifically designed for machine learning applications. We test both full-precision and low-precision designs on various regression and classification data sets. We achieve up to an order of magnitude training speedup when using low-precision data compared to a full-precision SGD on the same FPGA and a state-of-the-art multi-core solution, while maintaining the quality of training. We open source the designs presented in this paper.}, author = {Kara, Kaan and Alistarh, Dan-Adrian and Alonso, Gustavo and Mutlu, Onur and Zhang, Ce}, pages = {160 -- 167}, publisher = {IEEE}, title = {{FPGA-accelerated dense linear machine learning: A precision-convergence trade-off}}, doi = {10.1109/FCCM.2017.39}, year = {2017}, } @inproceedings{791, abstract = {Consider the following random process: we are given n queues, into which elements of increasing labels are inserted uniformly at random. To remove an element, we pick two queues at random, and remove the element of lower label (higher priority) among the two. The cost of a removal is the rank of the label removed, among labels still present in any of the queues, that is, the distance from the optimal choice at each step. Variants of this strategy are prevalent in state-of-the-art concurrent priority queue implementations. Nonetheless, it is not known whether such implementations provide any rank guarantees, even in a sequential model. We answer this question, showing that this strategy provides surprisingly strong guarantees: Although the single-choice process, where we always insert and remove from a single randomly chosen queue, has degrading cost, going to infinity as we increase the number of steps, in the two choice process, the expected rank of a removed element is O(n) while the expected worst-case cost is O(n log n). These bounds are tight, and hold irrespective of the number of steps for which we run the process. The argument is based on a new technical connection between "heavily loaded" balls-into-bins processes and priority scheduling. Our analytic results inspire a new concurrent priority queue implementation, which improves upon the state of the art in terms of practical performance.}, author = {Alistarh, Dan-Adrian and Kopinsky, Justin and Li, Jerry and Nadiradze, Giorgi}, booktitle = {Proceedings of the ACM Symposium on Principles of Distributed Computing}, isbn = {978-145034992-5}, location = {Washington, WA, USA}, pages = {283 -- 292}, publisher = {ACM}, title = {{The power of choice in priority scheduling}}, doi = {10.1145/3087801.3087810}, volume = {Part F129314}, year = {2017}, } @article{792, abstract = {The chaotic dynamics of low-dimensional systems, such as Lorenz or Rössler flows, is guided by the infinity of periodic orbits embedded in their strange attractors. Whether this is also the case for the infinite-dimensional dynamics of Navier–Stokes equations has long been speculated, and is a topic of ongoing study. Periodic and relative periodic solutions have been shown to be involved in transitions to turbulence. Their relevance to turbulent dynamics – specifically, whether periodic orbits play the same role in high-dimensional nonlinear systems like the Navier–Stokes equations as they do in lower-dimensional systems – is the focus of the present investigation. We perform here a detailed study of pipe flow relative periodic orbits with energies and mean dissipations close to turbulent values. We outline several approaches to reduction of the translational symmetry of the system. We study pipe flow in a minimal computational cell at Re=2500, and report a library of invariant solutions found with the aid of the method of slices. Detailed study of the unstable manifolds of a sample of these solutions is consistent with the picture that relative periodic orbits are embedded in the chaotic saddle and that they guide the turbulent dynamics.}, author = {Budanur, Nazmi B and Short, Kimberly and Farazmand, Mohammad and Willis, Ashley and Cvitanović, Predrag}, issn = {0022-1120}, journal = {Journal of Fluid Mechanics}, pages = {274 -- 301}, publisher = {Cambridge University Press}, title = {{Relative periodic orbits form the backbone of turbulent pipe flow}}, doi = {10.1017/jfm.2017.699}, volume = {833}, year = {2017}, } @article{793, abstract = {Let P be a finite point set in the plane. A cordinary triangle in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P . Motivated by a question of Erdös, and answering a question of de Zeeuw, we prove that there exists a constant c > 0such that P contains a c-ordinary triangle, provided that P is not contained in the union of two lines. Furthermore, the number of c-ordinary triangles in P is Ω(| P |). }, author = {Fulek, Radoslav and Mojarrad, Hossein and Naszódi, Márton and Solymosi, József and Stich, Sebastian and Szedlák, May}, issn = {09257721}, journal = {Computational Geometry: Theory and Applications}, pages = {28 -- 31}, publisher = {Elsevier}, title = {{On the existence of ordinary triangles}}, doi = {10.1016/j.comgeo.2017.07.002}, volume = {66}, year = {2017}, } @article{794, abstract = {We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph G with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment G by adding edges without creating an edge-crossing so that in the resulting spherical graph the vertices of each part induce a connected sub-graph. We proceed by a reduction to the problem of testing the existence of a perfect matching in planar bipartite graphs. We formulate our result in a slightly more general setting of cyclic clustered graphs, i.e., the simple graph obtained by contracting each cluster, where we disregard loops and multi-edges, is a cycle.}, author = {Fulek, Radoslav}, journal = {Computational Geometry: Theory and Applications}, pages = {1 -- 13}, publisher = {Elsevier}, title = {{C-planarity of embedded cyclic c-graphs}}, doi = {10.1016/j.comgeo.2017.06.016}, volume = {66}, year = {2017}, } @article{795, abstract = {We introduce a common generalization of the strong Hanani–Tutte theorem and the weak Hanani–Tutte theorem: if a graph G has a drawing D in the plane where every pair of independent edges crosses an even number of times, then G has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in D. The theorem is implicit in the proof of the strong Hanani–Tutte theorem by Pelsmajer, Schaefer and Štefankovič. We give a new, somewhat simpler proof.}, author = {Fulek, Radoslav and Kynčl, Jan and Pálvölgyi, Dömötör}, issn = {1077-8926}, journal = {Electronic Journal of Combinatorics}, number = {3}, publisher = {International Press}, title = {{Unified Hanani Tutte theorem}}, doi = {10.37236/6663}, volume = {24}, year = {2017}, } @article{796, abstract = {We present the fabrication and characterization of an aluminum transmon qubit on a silicon-on-insulator substrate. Key to the qubit fabrication is the use of an anhydrous hydrofluoric vapor process which selectively removes the lossy silicon oxide buried underneath the silicon device layer. For a 5.6 GHz qubit measured dispersively by a 7.1 GHz resonator, we find T1 = 3.5 μs and T∗2 = 2.2 μs. This process in principle permits the co-fabrication of silicon photonic and mechanical elements, providing a route towards chip-scale integration of electro-opto-mechanical transducers for quantum networking of superconducting microwave quantum circuits. The additional processing steps are compatible with established fabrication techniques for aluminum transmon qubits on silicon.}, author = {Keller, Andrew J and Dieterle, Paul and Fang, Michael and Berger, Brett and Fink, Johannes M and Painter, Oskar}, issn = {0003-6951}, journal = {Applied Physics Letters}, number = {4}, publisher = {American Institute of Physics}, title = {{Al transmon qubits on silicon on insulator for quantum device integration}}, doi = {10.1063/1.4994661}, volume = {111}, year = {2017}, } @article{797, abstract = {Phasenübergänge helfen beim Verständnis von Vielteilchensystemen in der Festkörperphysik und Fluiddynamik bis hin zur Teilchenphysik. Unserer internationalen Kollaboration ist es gelungen, einen neuartigen Phasenübergang in einem Quantensystem zu beobachten [1]. In einem Mikrowellenresonator konnte erstmals die spontane Zustandsänderung von undurchsichtig zu transparent nachgewiesen werden.}, author = {Fink, Johannes M}, journal = {Physik in unserer Zeit}, number = {3}, pages = {111 -- 113}, publisher = {Wiley}, title = {{Photonenblockade aufgelöst}}, doi = {10.1002/piuz.201770305}, volume = {48}, year = {2017}, }