Related papers: Fast Scrambling in Classically Simulable Quantum C…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
The field of information scrambling has seen significant growth over the last decade, where the out-of-time-ordered correlator (OTOC) has emerged as a prominent tool to probe it. In this work, we use bipartite OTOC, a particular form of…
Investigating the influence of quantum information (QI) scrambling on quantum correlations in a physical system is an interesting problem. In this article we establish the mathematical connections among the quantifiers known as quantum…
Out-of-time-ordered correlators (OTOCs) have been proposed as a tool to witness quantum information scrambling in many-body system dynamics. These correlators can be understood as averages over nonclassical multi-time quasi-probability…
Quantum algorithms are a very promising field. However, creating and manipulating these kind of algorithms is a very complex task, specially for software engineers used to work at higher abstraction levels. The work presented here is part…
We study theoretically entanglement and operator growth in a spin system coupled to an environment, which is modeled with classical dephasing noise. Using exact numerical simulations we show that the entanglement growth and its fluctuations…
The ability to selectively measure, initialize, and reuse qubits during a quantum circuit enables a mapping of the spatial structure of certain tensor-network states onto the dynamics of quantum circuits, thereby achieving dramatic resource…
Dynamic circuits use real-time outcomes of mid-circuit measurements, processed by a classical controller, to adapt subsequent operations during circuit execution. This additional flexibility over static circuits comes at a price.…
We analyze the complexity of classically simulating continuous-time dynamics of locally interacting quantum spin systems with a constant rate of entanglement breaking noise. We prove that a polynomial time classical algorithm can be used to…
Quantum computers hold great promise for arriving at exact simulations of nuclear dynamical processes (e.g., scattering and reactions) that are paramount to the study of nuclear matter at the limit of stability and to explaining the…
The concept of out-of-time-ordered correlation (OTOC) function is treated as a very strong theoretical probe of quantum randomness, using which one can study both chaotic and non-chaotic phenomena in the context of quantum statistical…
Fast scrambling, quantified by the exponential initial growth of Out-of-Time-Ordered-Correlators (OTOCs), is the ability to efficiently spread quantum correlations among the degrees of freedom of interacting systems, and constitutes a…
Much recent work has been devoted to the study of information scrambling in quantum systems. In this paper, we study the long-time properties of the algebraic out-of-time-order-correlator ("$\mathcal{A}$-OTOC") and derive an analytical…
We define a class of stochastic processes based on evolutions and measurements of quantum systems, and consider the complexity of predicting their long-term behavior. It is shown that a very general class of decision problems regarding…
Measurement-induced phase transitions arise due to a competition between the scrambling of quantum information in a many-body system and local measurements. In this work we investigate these transitions in different classes of fast…
We study the finite-temperature scrambling behavior of a quantum system described by a Hamiltonian chosen from a random matrix ensemble. This effectively (0+1)-dimensional model admits an exact calculation of various ensemble-averaged…
(Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution is a formalism of restricted quantum operations, named…
We study how probes of quantum scrambling dynamics respond to two kinds of imperfections -- unequal forward and backward evolutions and decoherence -- in a solvable Brownian circuit model. We calculate a ``renormalized'' out-of-time-order…
Digital quantum simulation is a promising application for quantum computers. Their free programmability provides the potential to simulate the unitary evolution of any many-body Hamiltonian with bounded spectrum by discretizing the time…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…