Related papers: Tunable Geometries in Sparse Clifford Circuits
Active colloidal particles typically exhibit a pronounced affinity for accumulating and being captured at boundaries. Here, we engineer long-range repulsive interactions between colloids that self-propel under an electric field and…
We propose new methods for multivariate linear regression when the regression coefficient matrix is sparse and the error covariance matrix is dense. We assume that the error covariance matrix has equicorrelation across the response…
The use of discrete material representation in numerical models is advantageous due to the straightforward way it takes into account material heterogeneity and randomness, and the discrete and orientated nature of cracks. Unfortunately, it…
Quantum states featuring extensive multipartite entanglement are a resource for quantum-enhanced metrology, with sensitivity up to the Heisenberg limit. However, robust generation of these states using unitary dynamics typically requires…
Sparse coding algorithms trained on natural images can accurately predict the features that excite visual cortical neurons, but it is not known whether such codes can be learned using biologically realistic plasticity rules. We have…
Random fields have remained a topic of great interest over past decades for the purpose of structured inference, especially for problems such as image segmentation. The local nodal interactions commonly used in such models often suffer the…
Comprehending the connections between the geometric, topological, and dynamical structures of integrable quantum systems with quantum phenomena exploitable in quantum information tasks, such as quantum entanglement, is a major problem in…
We numerically survey predictions on the shapes and scaling laws of particle condensates that emerge as a result of spontaneous symmetry breaking in pair- factorized steady states of a stochastic transport process. The specific model…
This thesis includes analysis of disordered spin ensembles corresponding to Exact Cover, a multi-access channel problem, and composite models combining sparse and dense interactions. The satisfiability problem in Exact Cover is addressed…
The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…
A monitored quantum system undergoing a cyclic evolution of the parameters governing its Hamiltonian accumulates a geometric phase that depends on the quantum trajectory followed by the system on its evolution. The phase value will be…
We study the limiting behavior of interacting particle systems indexed by large sparse graphs, which evolve either according to a discrete time Markov chain or a diffusion, in which particles interact directly only with their nearest…
The vast and complicated large-qubit state space forbids us to comprehensively capture the dynamics of modern quantum computers via classical simulations or quantum tomography. Recent progress in quantum learning theory prompts a crucial…
The study of the boundary between classically simulable and computationally complex quantum dynamics is fundamental to understanding which physical resources may enable enhanced information-processing capabilities. We investigate this…
Variational quantum algorithms are considered to be appealing applications of near-term quantum computers. However, it has been unclear whether they can outperform classical algorithms or not. To reveal their limitations, we must seek a…
We consider the random deposition of objects of variable width and height over a line. The successive additions of these structures create a random interface. We focus on the regime of heavy tailed distributions of the structure width. When…
We explore a roughening phase transition that occurs in the entanglement dynamics of certain quantum circuits. Viewing entanglement as the free energy of a membrane in a circuit-defined random environment, there is a competition between…
Pseudorandom circuits generate quantum states and unitary operators which are approximately distributed according to the unitarily invariant Haar measure. We explore how several design parameters affect the efficiency of pseudo-random…
We present a framework to define a large class of neural networks for which, by construction, training by gradient flow provably reaches arbitrarily low loss when the number of parameters grows. Distinct from the fixed-space global…
In recent years inelastic spin-flip spectroscopy using a lowtemperature scanning tunneling microscope has been a very successful tool for studying not only individual spins but also complex coupled systems. When these systems interact with…