Related papers: Tunable Geometries in Sparse Clifford Circuits

We propose an extended local-world evolving network model including a triad formation step. In the process of network evolution, random fluctuation in the number of new edges is involved. We derive analytical expressions for degree…

We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. The rest of the nodes are hidden, and do not provide any…

Many complex structures and stochastic patterns emerge from simple kinetic rules and local interactions, and are governed by scale invariance properties in combination with effects of the global geometry. We consider systems that can be…

Large ensembles of stochastically evolving interacting particles describe phenomena in diverse fields including statistical physics, neuroscience, biology, and engineering. In such systems, the infinitesimal evolution of each particle…

We explore the dynamical phases of unitary Clifford circuits with variable-range interactions, coupled to a monitoring environment. We investigate two classes of models, distinguished by the action of the unitary gates, which either are…

We investigate the self-organization of point-particles with short-range interactions modeled via simple 1D and 2D Hubbard-like models. We show how various properties emerge such as, boson-like ordering leading to topological structures in…

We present a unified geometric and dynamical framework for a physical system consisting of $n$ spin-$1/2$ particles with all-range Ising interaction. Using the Fubini-Study formalism, we derive the metric tensor of the associated quantum…

This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which…

A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more…

Linearized Coupled Cluster Doubles (LinCCD) often provides near-singular energies in small-gap systems that exhibit static correlation. This has been attributed to the lack of quadratic $T_2^2$ terms that typically balance out small energy…

The study of quantum circuit simulation using classical computers is a key research topic that helps define the boundary of verifiable quantum advantage, solve quantum many-body problems, and inform development of quantum hardware and…

A major challenge in the field of quantum computing is the construction of scalable qubit coupling architectures. Here, we demonstrate a novel tuneable coupling circuit that allows superconducting qubits to be coupled over long distances.…

A new scheme that tightly couples kinetic turbulence codes across a spatial interface is introduced. This scheme evolves from considerations of competing strategies and down-selection. It is found that the use of a composite kinetic…

Effective analysis in neuroscience benefits significantly from robust conceptual frameworks. Traditional metrics of interbrain synchrony in social neuroscience typically depend on fixed, correlation-based approaches, restricting their…

Measurement-only circuits provide a minimal setting in which repeated local projections can either generate or suppress many-body entanglement, giving rise to measurement-induced phase transitions and dynamical regimes, that might have no…

Predictive theory to geometrically engineer devices and materials in continuum systems to have desired topological-like effects is developed here by bridging the gap between quantum and continuum mechanical descriptions. A platonic crystal,…

Preparing a quantum circuit that implements a given sparse state is an important building block that is necessary for many different quantum algorithms. In the context of fault-tolerant quantum computing, the so-called non-Clifford gates…

Probabilistic circuits (PCs) are a tractable representation of probability distributions allowing for exact and efficient computation of likelihoods and marginals. There has been significant recent progress on improving the scale and…

We introduce a new methodology 'charcoal' for estimating the location of sparse changes in high-dimensional linear regression coefficients, without assuming that those coefficients are individually sparse. The procedure works by…

Teleportation of quantum information over long distances requires robust entanglement on the macroscopic scale. The construction of highly energetic eigenstates with tunable long-range entanglement can provide a new medium for information…