2697 Publications

Quantum process tomography with unsupervised learning and tensor networks

G. Torlai, Christopher J. Wood, Atithi Acharya, G. Carleo, Juan Carrasquilla, Leandro Aolita

The impressive pace of advance of quantum technology calls for robust and scalable techniques for the characterization and validation of quantum hardware. Quantum process tomography, the reconstruction of an unknown quantum channel from measurement data, remains the quintessential primitive to completely characterize quantum devices. However, due to the exponential scaling of the required data and classical post-processing, its range of applicability is typically restricted to one- and two-qubit gates. Here, we present a new technique for performing quantum process tomography that addresses these issues by combining a tensor network representation of the channel with a data-driven optimization inspired by unsupervised machine learning. We demonstrate our technique through synthetically generated data for ideal one- and two-dimensional random quantum circuits of up to 10 qubits, and a noisy 5-qubit circuit, reaching process fidelities above 0.99 using only a limited set of single-qubit measurement samples and input states. Our results go far beyond state-of-the-art, providing a practical and timely tool for benchmarking quantum circuits in current and near-term quantum computers.

Show Abstract
June 3, 2020

Inference of Bacterial Small RNA Regulatory Networks and Integration with Transcription Factor-Driven Regulatory Networks

M Arrieta Ortiz, C Hafemeister, B Shuster, N Baliga, R. Bonneau

Small noncoding RNAs (sRNAs) are key regulators of bacterial gene expression. Through complementary base pairing, sRNAs affect mRNA stability and translation efficiency. Here, we describe a network inference approach designed to identify sRNA-mediated regulation of transcript levels. We use existing transcriptional data sets and prior knowledge to infer sRNA regulons using our network inference tool, the Inferelator. This approach produces genome-wide gene regulatory networks that include contributions by both transcription factors and sRNAs. We show the benefits of estimating and incorporating sRNA activities into network inference pipelines using available experimental data. We also demonstrate how these estimated sRNA regulatory activities can be mined to identify the experimental conditions where sRNAs are most active. We uncover 45 novel experimentally supported sRNAmRNA interactions in Escherichia coli, outperforming previous network-based efforts. Additionally, our pipeline complements sequence-based sRNA-mRNA interaction prediction methods by adding a data-driven filtering step. Finally, we show the general
applicability of our approach by identifying 24 novel, experimentally supported, sRNA-mRNA interactions in Pseudomonas aeruginosa, Staphylococcus aureus, and Bacillus subtilis. Overall, our strategy generates novel insights into the functional context of sRNA regulation in multiple bacterial species.

Show Abstract

A Larger Extent for the Ophiuchus Stream

N. Caldwell, A. Bonaca, A. Price-Whelan, B. Sesar, M. Walker

stream membership probabilities, resulting in the detection of more than 200 likely members. These data show the stream extends to more than three times the length shown in the discovery data. A spur to the main stream is also detected. The high resolution spectra allow us to resolve the stellar velocity dispersion, found to be 1.6±0.3 km/sec.

Show Abstract

Solution of Stokes flow in complex nonsmooth 2D geometries via a linear-scaling high-order adaptive integral equation scheme

B. Wu, H. Zhu, A. Barnett, S. Veerapaneni

We present a fast, high-order accurate and adaptive boundary integral scheme for solving the Stokes equations in complex---possibly nonsmooth---geometries in two dimensions. The key ingredient is a set of panel quadrature rules capable of evaluating weakly-singular, nearly-singular and hyper-singular integrals to high accuracy. Near-singular integral evaluation, in particular, is done using an extension of the scheme developed in J.~Helsing and R.~Ojala, {\it J. Comput. Phys.} {\bf 227} (2008) 2899--2921. The boundary of the given geometry is ``panelized'' automatically to achieve user-prescribed precision. We show that this adaptive panel refinement procedure works well in practice even in the case of complex geometries with large number of corners. In one example, for instance, a model 2D vascular network with 378 corners required less than 200K discretization points to obtain a 9-digit solution accuracy.

Show Abstract

Trapping, gliding, vaulting: transport of semiflexible polymers in periodic post arrays

B. Chakrabarti, C. Gaillard, D. Saintillan

The transport of deformable particles through porous media underlies a wealth of applications ranging from filtration to oil recovery to the transport and spreading of biological agents. Using direct numerical simulations, we analyze the dynamics of semiflexible polymers under the influence of an imposed flow in a structured two-dimensional lattice serving as an idealization of a porous medium. This problem has received much attention in the limit of reptation and for long-chain polymer molecules such as DNA that are transported through micropost arrays for electrophoretic chromatographic separation. In contrast to long entropic molecules, the dynamics of elastic polymers results from a combination of scattering with the obstacles and flow-induced buckling instabilities. We identify three dominant modes of transport that involve trapping, gliding and vaulting of the polymers around the obstacles, and we reveal their essential features using tools from dynamical systems theory. The interplay of these scattering dynamics with transport and deformations in the imposed flow results in the long-time asymptotic dispersion of the center of mass, which we quantify in terms of a hydrodynamic dispersion tensor. We then discuss a simple yet efficient chromatographic device that exploits the competition between different modes of transport to sort filaments in a dilute suspension according to their lengths.

Show Abstract

Black holes in the low-mass gap: Implications for gravitational-wave observations

Anuradha Gupta, Davide Gerosa, K. G. Arun, Emanuele Berti, W. Farr, B. S. Sathyaprakash

Binary neutron-star mergers will predominantly produce black-hole remnants of mass ∼3−4M⊙, thus populating the putative \emph{low mass gap} between neutron stars and stellar-mass black holes. If these low-mass black holes are in dense astrophysical environments, mass segregation could lead to "second-generation" compact binaries merging within a Hubble time. In this paper, we investigate possible signatures of such low-mass compact binary mergers in gravitational-wave observations. We show that this unique population of objects, if present, will be uncovered by the third-generation gravitational-wave detectors, such as Cosmic Explorer and Einstein Telescope. Future joint measurements of chirp mass  and effective spin χeff could clarify the formation scenario of compact objects in the low mass gap. As a case study, we show that the recent detection of GW190425 (along with GW170817) favors a double Gaussian mass model for neutron stars, under the assumption that the primary in GW190425 is a black hole formed from a previous binary neutron star merger.

Show Abstract

On the solution of Laplace’s equation in the vicinity of triple junctions

Jeremy Hoskins, M. Rachh

An important component of many image alignment methods is the calculation of inner products (correlations) between an image of $n\times n$ pixels and another image translated by some shift and rotated by some angle. For robust alignment of an image pair, the number of considered shifts and angles is typically high, thus the inner product calculation becomes a bottleneck. Existing methods, based on fast Fourier transforms (FFTs), compute all such inner products with computational complexity $\mathcal{O}(n^3 \log n)$ per image pair, which is reduced to $\mathcal{O}(N n^2)$ if only $N$ distinct shifts are needed. We propose to use a factorization of the translation kernel (FTK), an optimal interpolation method which represents images in a Fourier--Bessel basis and uses a rank-$H$ approximation of the translation kernel via an operator singular value decomposition (SVD). Its complexity is $\mathcal{O}(Hn(n + N))$ per image pair. We prove that $H = \mathcal{O}((W + \log(1/\epsilon))^2)$, where $2W$ is the magnitude of the maximum desired shift in pixels and $\epsilon$ is the desired accuracy. For fixed $W$ this leads to an acceleration when $N$ is large, such as when sub-pixel shift grids are considered. Finally, we present numerical results in an electron cryomicroscopy application showing speedup factors of $3$-$10$ with respect to the state of the art.

Show Abstract

Revisiting the Effect of f-Functions in Predicting the Right Reaction Mechanism for Hypervalent Iodine Reagents

Tian-Yu Sun, Kai Chen, Huakang Zhou, Tingting You, Penggang Yin, X. Wang

To understand the effect of f-functions in predicting the right reaction mechanism for hypervalent iodine reagents, we adopt the Ahlrichs basis set family def2-SVP and def2-TZVP to revisit the potential energy surfaces of IBX-mediated oxidation and Togni I's isomerisation. Our results further prove that f-functions (in either Pople, Dunning, or Ahlrichs basis set series) are indispensable to predict the correct rate-determining step of hypervalent iodine reagents. The f-functions have a significant impact on the predicted reaction barriers for processes involving the I-X (X = O, OH, CF3, etc.) bond cleavage and formation, e.g. in the reductive elimination step or the hypervalent twist step. We furthermore explore two hypervalent twist modes that account for the different influences of f-functions for IBX and Togni I. Our findings may be helpful for theoretical chemists to appropriately study the reaction mechanism of hypervalent iodine reagents.

Show Abstract

Genome-wide landscape of RNA-binding protein dysregulation reveals a major impact on psychiatric disorder risk

C. Park, J Zhou, A. Wong, K. Chen, C Theesfeld, R Darnell, O. Troyanskaya

Despite the strong genetic basis of psychiatric disorders, the molecular origins of these diseases are still largely unmapped. RNA-binding proteins (RBPs) are responsible for most post-transcriptional regulation, from splicing to translational to localization. RBPs thus act as key gatekeepers of cellular homeostasis, especially in the brain. Here, we leverage a deep learning approach to interrogate variant effects genome-wide, and discover that the dysregulation of RBP target sites is a principal contributor to psychiatric disorder risk. We show that specific modes of RBP regulation are genetically linked to the heritability of psychiatric disorders, and demonstrate that diverse RBP regulatory functions are reflected in distinct genome-wide negative selection signatures. Notably, RBP dysregulation has a stronger impact on psychiatric disorders than common coding region variants and explains heritability not currently captured by large-scale molecular QTL studies (expression QTLs and splicing QTLs). We share genome-wide profiles of RBP target site dysregulation, which we used to identify DDHD2 as a candidate schizophrenia risk gene, in a public web server. This resource provides a novel analytical framework to connect the full range of RNA regulation to complex disease.

Show Abstract
  • Previous Page
  • Viewing
  • Next Page
Advancing Research in Basic Science and MathematicsSubscribe to Flatiron Institute announcements and other foundation updates