arXiv subjects

Eli Chertkov

Publications and source records attributed to Eli Chertkov.

17 recordsLinked to original sources

arXiv2025

Fermionic dynamics on a trapped-ion quantum computer beyond exact classical simulation

Simulation of the time-dynamics of fermionic many-body systems has long been predicted to be one of the key applications of quantum computers. Such simulations -- for which classical methods are often inaccurate -- are critical to advancing our knowledge and understanding of quantum chemistry and materials, underpinning a wide range of fields, from biochemistry to clean-energy technologies and chemical synthesis. However, the performance of all previous digital quantum simulations of fermions has been matched by classical methods, and it has thus far remained unclear whether near-term, intermediate-scale quantum hardware could offer any computational advantage in this area. Here, we implement an efficient quantum simulation algorithm on Quantinuum's System Model H2 trapped-ion quantum computer for the time dynamics of a 56-qubit system that is too complex for exact classical simulation. We focus on the periodic spinful 2D Fermi-Hubbard model and present evidence of spin-charge separation, where the elementary electron's charge and spin decouple. In the limited cases where ground truth is available through exact classical simulation, we find that it agrees with the results we obtain from the quantum device. Employing long-range Wilson operators to study deconfinement of the effective gauge field between spinons and the effective potential between charge carriers, we find behaviour that differs from predictions made by classical tensor network methods. Our results herald the use of quantum computing for simulating strongly correlated electronic systems beyond the capacity of classical computing.

quant-ph↗

arXiv2025

Probing the Critical Point (CritPt) of AI Reasoning: a Frontier Physics Research Benchmark

While large language models (LLMs) with reasoning capabilities are progressing rapidly on high-school math competitions and coding, can they reason effectively through complex, open-ended challenges found in frontier physics research? And crucially, what kinds of reasoning tasks do physicists want LLMs to assist with? To address these questions, we present the CritPt (Complex Research using Integrated Thinking - Physics Test, pronounced "critical point"), the first benchmark designed to test LLMs on unpublished, research-level reasoning tasks that broadly covers modern physics research areas, including condensed matter, quantum physics, atomic, molecular & optical physics, astrophysics, high energy physics, mathematical physics, statistical physics, nuclear physics, nonlinear dynamics, fluid dynamics and biophysics. CritPt consists of 71 composite research challenges designed to simulate full-scale research projects at the entry level, which are also decomposed to 190 simpler checkpoint tasks for more fine-grained insights. All problems are newly created by 50+ active physics researchers based on their own research. Every problem is hand-curated to admit a guess-resistant and machine-verifiable answer and is evaluated by an automated grading pipeline heavily customized for advanced physics-specific output formats. We find that while current state-of-the-art LLMs show early promise on isolated checkpoints, they remain far from being able to reliably solve full research-scale challenges: the best average accuracy among base models is only 5.7%, achieved by GPT-5 (high), moderately rising to around 10% when equipped with coding tools. Through the realistic yet standardized evaluation offered by CritPt, we highlight a large disconnect between current model capabilities and realistic physics research demands, offering a foundation to guide the development of scientifically grounded AI tools.

cs.AI↗

arXiv2025

Error detection without post-selection in adaptive quantum circuits

Current quantum computers are limited by errors, but have not yet achieved the scale required to benefit from active error correction in large computations. We show how simulations of open quantum systems can benefit from error detection. In particular, we use Quantinuum's H2 quantum computer to perform logical simulations of a non-equilibrium phase transition using the [[4,2,2]] code. Importantly, by converting detected errors into random resets, which are an intended part of the dissipative quantum dynamics being studied, we avoid any post-selection in our simulations, thereby eliminating the exponential cost typically associated with error detection. The encoded simulations perform near break-even with unencoded simulations at short times.

quant-ph↗

arXiv2025

The Future of the Correlated Electron Problem

A central problem in modern condensed matter physics is the understanding of materials with strong electron correlations. Despite extensive work, the essential physics of many of these systems is not understood and there is very little ability to make predictions in this class of materials. In this manuscript we share our personal views on the major open problems in the field of correlated electron systems. We discuss some possible routes to make progress in this rich and fascinating field. This manuscript is the result of the vigorous discussions and deliberations that took place at Johns Hopkins University during a three-day workshop January 27, 28, and 29, 2020 that brought together six senior scientists and 46 more junior scientists. Our hope, is that the topics we have presented will provide inspiration for others working in this field and motivation for the idea that significant progress can be made on very hard problems if we focus our collective energies.

cond-mat.str-el↗

arXiv2025

Digital quantum magnetism on a trapped-ion quantum computer

Digital quantum matter -- realized when discrete quantum gates approximate continuous time evolution -- is susceptible to heating into chaotic, structureless states. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviors observed in equilibrium systems, ranging from the nontrivial microscopic origins of thermalization itself to the stabilization of effective models hosting exotic emergent properties. Here, we use Quantinuum's system model H2 quantum computer to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics due to approximate energy conservation, and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration. Our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of $99.94(1)\%$), and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.

quant-ph↗

arXiv2025

End-to-End Quantum Algorithms for the Jones Polynomial

We present an end-to-end algorithmic pipeline where a noisy digital quantum computer is used to approximate the value of the Jones polynomial at the fifth root of unity for any input link, i.e. a closed braid. This problem is DQC1-complete for Markov-closed braids and BQP-complete for Plat-closed braids, and we accommodate both versions of the problem. Even though it is widely believed that DQC1 is strictly contained in BQP, and so is 'less quantum', the resource requirements of classical algorithms for the DQC1 version are at least as high as for the BQP version, and so we potentially gain 'more advantage' by focusing on Markov-closed braids in our exposition. We demonstrate our quantum algorithm on Quantinuum's H2-2 quantum computer and show the effect of problem-tailored error-mitigation techniques. Further, leveraging that the Jones polynomial is a link invariant, we construct an efficiently verifiable benchmark to characterise the effect of noise present in a given quantum processor. In parallel, we develop and benchmark the state-of-the-art tensor-network-based classical algorithms for computing the Jones polynomial. The reconfigurable tools provided in this work allow for precise resource estimation to identify minimum link sizes for near-term quantum advantage in practice for a meaningful quantum-native problem in knot theory, if a candidate set of links are provided.

quant-ph↗

arXiv2024

Probing critical states of matter on a digital quantum computer

Although quantum mechanics underpins the microscopic behavior of all materials, its effects are often obscured at the macroscopic level by thermal fluctuations. A notable exception is a zero-temperature phase transition, where scaling laws emerge entirely due to quantum correlations over a diverging length scale. The accurate description of such transitions is challenging for classical simulation methods of quantum systems, and is a natural application space for quantum simulation. These quantum simulations are, however, not without their own challenges \textemdash~representing quantum critical states on a quantum computer requires encoding entanglement of a large number of degrees of freedom, placing strict demands on the coherence and fidelity of the computer's operations. Using Quantinuum's H1-1 quantum computer, we address these challenges by employing hierarchical quantum tensor-network techniques, creating the ground state of the critical transverse-field Ising chain on 128-sites with sufficient fidelity to extract accurate critical properties of the model. Our results suggest a viable path to quantum-assisted tensor network contraction beyond the limits of classical methods.

quant-ph↗

arXiv2024

Robustness of near-thermal dynamics on digital quantum computers

Understanding the impact of gate errors on quantum circuits is crucial to determining the potential applications of quantum computers, especially in the absence of large-scale error-corrected hardware. We put forward analytical arguments, corroborated by extensive numerical and experimental evidence, that Trotterized quantum circuits simulating the time-evolution of systems near thermal equilibrium are substantially more robust to both quantum gate errors and Trotter (discretization) errors than is widely assumed. In Quantinuum's trapped-ion computers, the weakly entangling gates that appear in Trotterized circuits can be implemented natively, and their error rate is smaller when they generate less entanglement; from benchmarking, we know that the error for a gate $\exp[-i (Z\otimes Z) \tau]$ decreases roughly linearly with $\tau$, up to a small offset at $\tau = 0$. We provide extensive evidence that this scaling, together with the robustness of near-thermal dynamics to both gate and discretization errors, facilitates substantial improvements in the achievable accuracy of Trotterized dynamics on near-term quantum computers. We make heavy use of a new theoretical tool -- a statistical ensemble of random product states that approximates a thermal state, which can be efficiently prepared with low noise on quantum computers. We outline how the random product state ensemble can be used to predict, optimize, and design Hamiltonian simulation experiments on near-thermal quantum systems.

quant-ph↗

arXiv2024

The computational power of random quantum circuits in arbitrary geometries

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of $\sim 50$ qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and therefore how much infidelity is suffered) in generating highly-entangled states. Here, we describe recent hardware upgrades to Quantinuum's H2 quantum computer enabling it to operate on up to $56$ qubits with arbitrary connectivity and $99.843(5)\%$ two-qubit gate fidelity. Utilizing the flexible connectivity of H2, we present data from random circuit sampling in highly connected geometries, doing so at unprecedented fidelities and a scale that appears to be beyond the capabilities of state-of-the-art classical algorithms. The considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the QCCD architecture as continued progress is made towards building larger machines.

quant-ph↗

arXiv2022

Qubit-reuse compilation with mid-circuit measurement and reset

A number of commercially available quantum computers, such as those based on trapped-ion or superconducting qubits, can now perform mid-circuit measurements and resets. In addition to being crucial for quantum error correction, this capability can help reduce the number of qubits needed to execute many types of quantum algorithms by measuring qubits as early as possible, resetting them, and reusing them elsewhere in the circuit. In this work, we introduce the idea of qubit-reuse compilation, which takes as input a quantum circuit and produces as output a compiled circuit that requires fewer qubits to execute due to qubit reuse. We present two algorithms for performing qubit-reuse compilation: an exact constraint programming optimization model and a greedy heuristic. We introduce the concept of dual circuits, obtained by exchanging state preparations with measurements and vice versa and reversing time, and show that optimal qubit-reuse compilation requires the same number of qubits to execute a circuit as its dual. We illustrate the performance of these algorithms on a variety of relevant near-term quantum circuits, such as one-dimensional and two-dimensional time-evolution circuits, and numerically benchmark their performance on the quantum adiabatic optimization algorithm (QAOA) applied to the MaxCut problem on random three-regular graphs. To demonstrate the practical benefit of these techniques, we experimentally realize an 80-qubit QAOA MaxCut circuit on the 20-qubit Quantinuum H1-1 trapped ion quantum processor using qubit-reuse compilation algorithms.

quant-ph↗

arXiv2022

Characterizing a non-equilibrium phase transition on a quantum computer

At transitions between phases of matter, physical systems can exhibit universal behavior independent of their microscopic details. Probing such behavior in quantum many-body systems is a challenging and practically important problem that can be solved by quantum computers, potentially exponentially faster than by classical computers. In this work, we use the Quantinuum H1-1 quantum computer to realize a quantum extension of a simple classical disease spreading process that is known to exhibit a non-equilibrium phase transition between an active and absorbing state. Using techniques such as qubit-reuse and error avoidance based on real-time conditional logic (utilized extensively in quantum error correction), we are able to implement large instances of the model with $73$ sites and up to $72$ circuit layers, and quantitatively determine the model's critical properties. This work demonstrates how quantum computers capable of mid-circuit resets, measurements, and conditional logic enable the study of difficult problems in quantum many-body physics: the simulation of open quantum system dynamics and non-equilibrium phase transitions.

quant-ph↗

arXiv2021

Holographic dynamics simulations with a trapped ion quantum computer

Quantum computers have the potential to efficiently simulate the dynamics of many interacting quantum particles, a classically intractable task of central importance to fields ranging from chemistry to high-energy physics. However, precision and memory limitations of existing hardware severely limit the size and complexity of models that can be simulated with conventional methods. Here, we demonstrate and benchmark a new scalable quantum simulation paradigm--holographic quantum dynamics simulation--which uses efficient quantum data compression afforded by quantum tensor networks along with opportunistic mid-circuit measurement and qubit reuse to simulate physical systems that have far more quantum degrees of freedom than can be captured by the available number of qubits. Using a Honeywell trapped ion quantum processor, we simulate the non-integrable (chaotic) dynamics of the self-dual kicked Ising model starting from an entangled state of $32$ spins using at most $9$ trapped ion qubits, obtaining excellent quantitative agreement when benchmarking against dynamics computed directly in the thermodynamic limit via recently developed exact analytical techniques. These results suggest that quantum tensor network methods, together with state-of-the-art quantum processor capabilities, enable a viable path to practical quantum advantage in the near term.

quant-ph↗

arXiv2021

Numerical evidence for many-body localization in two and three dimensions

Disorder and interactions can lead to the breakdown of statistical mechanics in certain quantum systems, a phenomenon known as many-body localization (MBL). Much of the phenomenology of MBL emerges from the existence of $\ell$-bits, a set of conserved quantities that are quasilocal and binary (i.e., possess only $\pm 1$ eigenvalues). While MBL and $\ell$-bits are known to exist in one-dimensional systems, their existence in dimensions greater than one is a key open question. To tackle this question, we develop an algorithm that can find approximate binary $\ell$-bits in arbitrary dimensions by adaptively generating a basis of operators in which to represent the $\ell$-bit. We use the algorithm to study four models: the one-, two-, and three-dimensional disordered Heisenberg models and the two-dimensional disordered hard-core Bose-Hubbard model. For all four of the models studied, our algorithm finds high-quality $\ell$-bits at large disorder strength and rapid qualitative changes in the distributions of $\ell$-bits in particular ranges of disorder strengths, suggesting the existence of MBL transitions. These transitions in the one-dimensional Heisenberg model and two-dimensional Bose-Hubbard model coincide well with past estimates of the critical disorder strengths in these models which further validates the evidence of MBL phenomenology in the other two and three-dimensional models we examine. In addition to finding MBL behavior in higher dimensions, our algorithm can be used to probe MBL in various geometries and dimensionality.

cond-mat.dis-nn↗

arXiv2021

Motif magnetism and quantum many-body scars

We generally expect quantum systems to thermalize and satisfy the eigenstate thermalization hypothesis (ETH), which states that finite energy density eigenstates are thermal. However, some systems, such as many-body localized systems and systems with quantum many-body scars, violate ETH and have high-energy athermal eigenstates. In systems with scars, most eigenstates thermalize, but a few atypical scar states do not. Scar states can give rise to a periodic revival when time-evolving particular initial product states, which can be detected experimentally. Recently, a family of spin Hamiltonians was found with magnetically ordered 3-colored eigenstates that are quantum many-body scars [Lee et al. Phys. Rev. B 101, 241111(2020)]. These models can be realized in any lattice that can be tiled by triangles, such as the triangular or kagome lattices, and have been shown to have close connections to the physics of quantum spin liquids in the Heisenberg kagome antiferromagnet. In this work, we introduce a generalized family of $n$-colored Hamiltonians with "spiral colored" eigenstates made from $n$-spin motifs such as polygons or polyhedra. We show how these models can be realized in many different lattice geometries and provide numerical evidence that they can exhibit quantum many-body scars with periodic revivals that can be observed by time-evolving simple product states. The simple structure of these Hamiltonians makes them promising candidates for future experimental studies of quantum many-body scars.

cond-mat.str-el↗

arXiv2019

Engineering Topological Models with a General-Purpose Symmetry-to-Hamiltonian Approach

Symmetry is at the heart of modern physics. Phases of matter are classified by symmetry breaking, topological phases are characterized by non-local symmetries, and point group symmetries are critical to our understanding of crystalline materials. Symmetries could then be used as a criterion to engineer quantum systems with targeted properties. Toward that end, we have developed a novel approach, the symmetric Hamiltonian construction (SHC), that takes as input symmetries, specified by integrals of motion or discrete symmetry transformations, and produces as output all local Hamiltonians consistent with these symmetries (see github.com/ClarkResearchGroup/qosy for our open-source code). This approach builds on the slow operator method [PRE 92, 012128]. We use our new approach to construct new Hamiltonians for topological phases of matter. Topological phases of matter are exotic quantum phases with potential applications in quantum computation. In this work, we focus on two types of topological phases of matter: superconductors with Majorana zero modes and $Z_2$ quantum spin liquids. In our first application of the SHC approach, we analytically construct a large and highly tunable class of superconducting Hamiltonians with Majorana zero modes with a given targeted spatial distribution. This result lays the foundation for potential new experimental routes to realizing Majorana fermions. In our second application, we find new $Z_2$ spin liquid Hamiltonians on the square and kagome lattices. These new Hamiltonians are not sums of commuting operators nor frustration-free and, when perturbed appropriately (in a way that preserves their $Z_2$ spin liquid behavior), exhibit level-spacing statistics that suggest non-integrability. This result demonstrates how our approach can automatically generate new spin liquid Hamiltonians with interesting properties not often seen in solvable models.

cond-mat.str-el↗

arXiv2018

Computational inverse method for constructing spaces of quantum models from wave functions

Traditional computational methods for studying quantum many-body systems are "forward methods," which take quantum models, i.e., Hamiltonians, as input and produce ground states as output. However, such forward methods often limit one's perspective to a small fraction of the space of possible Hamiltonians. We introduce an alternative computational "inverse method," the Eigenstate-to-Hamiltonian Construction (EHC), that allows us to better understand the vast space of quantum models describing strongly correlated systems. EHC takes as input a wave function $|ψ_T\rangle$ and produces as output Hamiltonians for which $|ψ_T\rangle$ is an eigenstate. This is accomplished by computing the quantum covariance matrix, a quantum mechanical generalization of a classical covariance matrix. EHC is widely applicable to a number of models and in this work we consider seven different examples. Using the EHC method, we construct a parent Hamiltonian with a new type of antiferromagnetic ground state, a parent Hamiltonian with two different targeted degenerate ground states, and large classes of parent Hamiltonians with the same ground states as well-known quantum models, such as the Majumdar-Ghosh model, the XX chain, the Heisenberg chain, the Kitaev chain, and a 2D BdG model.

cond-mat.str-el↗

arXiv2015

Inverse design of disordered stealthy hyperuniform spin chains

Positioned between crystalline solids and liquids, disordered many-particle systems which are stealthy and hyperuniform represent new states of matter that are endowed with novel physical and thermodynamic properties. Such stealthy and hyperuniform states are unique in that they are transparent to radiation for a range of wavenumbers around the origin. In this work, we employ recently developed inverse statistical-mechanical methods, which seek to obtain the optimal set of interactions that will spontaneously produce a targeted structure or configuration as a unique ground state, to investigate the spin-spin interaction potentials required to stabilize disordered stealthy hyperuniform one-dimensional (1D) Ising-like spin chains. By performing an exhaustive search over the spin configurations that can be enumerated on periodic 1D integer lattices containing $N=2,3,\ldots,36$ sites, we were able to identify and structurally characterize \textit{all} stealthy hyperuniform spin chains in this range of system sizes. Within this pool of stealthy hyperuniform spin configurations, we then utilized such inverse optimization techniques to demonstrate that stealthy hyperuniform spin chains can be realized as either unique or degenerate disordered ground states of radial long-ranged (relative to the spin chain length) spin-spin interactions. Such exotic ground states are distinctly different from spin glasses in both their inherent structural properties and the nature of the spin-spin interactions required to stabilize them. As such, the implications and significance of the existence of such disordered stealthy hyperuniform ground state spin systems warrants further study, including whether their bulk physical properties and excited states, like their many-particle system counterparts, are singularly remarkable, and can be experimentally realized.

cond-mat.stat-mech↗