arXiv subjects

Hannes Pichler

Publications and source records attributed to Hannes Pichler.

At least 37 records · Page 2Linked to original sources

arXiv2025

Fast entangling gates for Rydberg atoms via resonant dipole-dipole interaction

The advent of digital neutral-atom quantum computers relies on the development of fast and robust protocols for high-fidelity quantum operations. In this work, we introduce a novel scheme for entangling gates using four atomic levels per atom: a ground-state qubit and two Rydberg states. A laser field couples the qubit to one of the two Rydberg states, while a microwave field drives transitions between the two Rydberg states, enabling a resonant dipole-dipole interaction between different atoms. We show that controlled-Z gates can be realized in this scheme without requiring optical phase modulation and relying solely on a microwave field with time-dependent phase and amplitude. We demonstrate that such gates are faster and less sensitive to Rydberg decay than state-of-the-art Rydberg gates based on van der Waals interactions. Moreover, we systematically stabilize our protocol against interatomic distance fluctuations and analyze its performance in realistic setups with rubidium or cesium atoms. Our results open up new avenues to the use of microwave-driven dipolar interactions for quantum computation with neutral atoms.

quant-ph↗

arXiv2025

Quantum adiabatic optimization with Rydberg arrays: localization phenomena and encoding strategies

Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native constraints of quantum hardware, necessitating encoding strategies to map the original problem into a hardware-conformant form. While the classical overhead associated with such mappings is easily quantifiable and typically polynomial in problem size, it is much harder to quantify their overhead on the quantum algorithm, e.g., the transformation of the adiabatic timescale. In this work, we address this challenge on the concrete example of the encoding scheme proposed in [Nguyen et al., PRX Quantum 4, 010316 (2023)], which is designed to map optimization problems on arbitrarily connected graphs into Rydberg atom arrays. We consider the fundamental building blocks underlying this encoding scheme and determine the scaling of the minimum gap with system size along adiabatic protocols. Even when the original problem is trivially solvable, we find that the encoded problem can exhibit an exponentially closing minimum gap. We show that this originates from a quantum coherent effect, which gives rise to an unfavorable localization of the ground-state wavefunction. On the QuEra Aquila neutral atom machine, we observe such localization and its effect on the success probability of finding the correct solution to the encoded optimization problem. Finally, we propose quantum-aware modifications of the encoding scheme that avoid this quantum bottleneck and lead to an exponential improvement in the adiabatic performance. This highlights the crucial importance of accounting for quantum effects when designing strategies to encode classical problems onto quantum platforms.

quant-ph↗

arXiv2025

Quantum dimer models with Rydberg gadgets

The Rydberg blockade mechanism is an important ingredient in quantum simulators based on neutral atom arrays. It enables the emergence of a rich variety of quantum phases of matter, such as topological spin liquids. The typically isotropic nature of the blockade effect, however, restricts the range of natively accessible models and quantum states. In this work, we propose a method to systematically overcome this limitation, by developing gadgets, i.e., specific arrangements of atoms, that transform the underlying Rydberg blockade into more general constraints. We apply this technique to realize dimer models on square and triangular geometries. In these setups, we study the role of the quantum fluctuations induced by a coherent drive of the atoms and find signatures of $U(1)$ and $\mathbb{Z}_2$ quantum spin liquid states in the respective ground states. Finally, we show that these states can be dynamically prepared with high fidelity, paving the way for the quantum simulation of a broader class of constrained models and topological matter in experiments with Rydberg atom arrays.

quant-ph↗

arXiv2024

Derandomized shallow shadows: Efficient Pauli learning with bounded-depth circuits

Efficiently estimating large numbers of non-commuting observables is an important subroutine of many quantum science tasks. We present the derandomized shallow shadows (DSS) algorithm for efficiently learning a large set of non-commuting observables, using shallow circuits to rotate into measurement bases. Exploiting tensor network techniques to ensure polynomial scaling of classical resources, our algorithm outputs a set of shallow measurement circuits that approximately minimizes the sample complexity of estimating a given set of Pauli strings. We numerically demonstrate systematic improvement, in comparison with state-of-the-art techniques, for energy estimation of quantum chemistry benchmarks and verification of quantum many-body systems, and we observe DSS's performance consistently improves as one allows deeper measurement circuits. These results indicate that in addition to being an efficient, low-depth, stand-alone algorithm, DSS can also benefit many larger quantum algorithms requiring estimation of multiple non-commuting observables.

quant-ph↗

arXiv2024

Error-corrected fermionic quantum processors with neutral atoms

Many-body fermionic systems can be simulated in a hardware-efficient manner using a fermionic quantum processor. Neutral atoms trapped in optical potentials can realize such processors, where non-local fermionic statistics are guaranteed at the hardware level. Implementing quantum error correction in this setup is however challenging, due to the atom-number superselection present in atomic systems, that is, the impossibility of creating coherent superpositions of different particle numbers. In this work, we overcome this constraint and present a blueprint for an error-corrected fermionic quantum computer that can be implemented using current experimental capabilities. To achieve this, we first consider an ancillary set of fermionic modes and design a fermionic reference, which we then use to construct superpositions of different numbers of referenced fermions. This allows us to build logical fermionic modes that can be error corrected using standard atomic operations. Here, we focus on phase errors, which we expect to be a dominant source of errors in neutral-atom quantum processors. We then construct logical fermionic gates, and show their implementation for the logical particle-number conserving processes relevant for quantum simulation. Finally, our protocol is illustrated using a minimal fermionic circuit, where it leads to a quadratic suppression of the logical error rate.

quant-ph↗

arXiv2024

Probing topological entanglement on large scales

Topologically ordered quantum matter exhibits intriguing long-range patterns of entanglement, which reveal themselves in subsystem entropies. However, measuring such entropies, which can be used to certify topological order, on large partitions is challenging and becomes practically unfeasible for large systems. We propose a protocol based on local adiabatic deformations of the Hamiltonian which extracts the universal features of long-range topological entanglement from measurements on small subsystems of finite size, trading an exponential number of measurements against a polynomial-time evolution. Our protocol is general and readily applicable to various quantum simulation architectures. We apply our method to various string-net models representing both abelian and non-abelian topologically ordered phases, and illustrate its application to neutral atom tweezer arrays with numerical simulations.

quant-ph↗

arXiv2024

Variational manifolds for ground states and scarred dynamics of blockade-constrained spin models on two and three dimensional lattices

We introduce a variational manifold of simple tensor network states for the study of a family of constrained models that describe spin-1/2 systems as realized by Rydberg atom arrays. Our manifold permits analytical calculation via perturbative expansion of one- and two-point functions in arbitrary spatial dimensions and allows for efficient computation of the matrix elements required for variational energy minimization and variational time evolution in up to three dimensions. We apply this framework to the PXP model on the hypercubic lattice in 1D, 2D, and 3D, and show that, in each case, it exhibits quantum phase transitions breaking the sub-lattice symmetry in equilibrium, and hosts quantum many body scars out of equilibrium. We demonstrate that our variational ansatz qualitatively captures all these phenomena and predicts key quantities with an accuracy that increases with the dimensionality of the lattice, and conclude that our method can be interpreted as a generalization of mean-field theory to constrained spin models.

quant-ph↗

arXiv2024

Quantum trajectory entanglement in various unravelings of Markovian dynamics

The cost of classical simulations of quantum many-body dynamics is often determined by the amount of entanglement in the system. In this paper, we study entanglement in stochastic quantum trajectory approaches that solve master equations describing open quantum system dynamics. First, we introduce and compare adaptive trajectory unravelings of master equations. Specifically, building on Ref. [Phys. Rev. Lett. 128, 243601 (2022)], we study several greedy algorithms that generate trajectories with a low average entanglement entropy. Second, we consider various conventional unravelings of a one-dimensional open random Brownian circuit and locate the transition points from area- to volume-law-entangled trajectories. Third, we compare various trajectory unravelings using matrix product states with a direct integration of the master equation using matrix product operators. We provide concrete examples of dynamics, for which the simulation cost of stochastic trajectories is exponentially smaller than the one of matrix product operators.

quant-ph↗

arXiv2024

Spatio-seasonal risk assessment of upward lightning at tall objects using meteorological reanalysis data

This study investigates lightning at tall objects and evaluates the risk of upward lightning (UL) over the eastern Alps and its surrounding areas. While uncommon, UL poses a threat, especially to wind turbines, as the long-duration current of UL can cause significant damage. Current risk assessment methods overlook the impact of meteorological conditions, potentially underestimating UL risks. Therefore, this study employs random forests, a machine learning technique, to analyze the relationship between UL measured at Gaisberg Tower (Austria) and $35$ larger-scale meteorological variables. Of these, the larger-scale upward velocity, wind speed and direction at 10 meters and cloud physics variables contribute most information. The random forests predict the risk of UL across the study area at a 1 km$^2$ resolution. Strong near-surface winds combined with upward deflection by elevated terrain increase UL risk. The diurnal cycle of the UL risk as well as high-risk areas shift seasonally. They are concentrated north/northeast of the Alps in winter due to prevailing northerly winds, and expanding southward, impacting northern Italy in the transitional and summer months. The model performs best in winter, with the highest predicted UL risk coinciding with observed peaks in measured lightning at tall objects. The highest concentration is north of the Alps, where most wind turbines are located, leading to an increase in overall lightning activity. Comprehensive meteorological information is essential for UL risk assessment, as lightning densities are a poor indicator of lightning at tall objects.

physics.soc-ph↗

arXiv2024

Hamilton-Jacobi-Bellman equations for Rydberg-blockade processes

We discuss time-optimal control problems for two setups involving globally driven Rydberg atoms in the blockade limit by deriving the associated Hamilton-Jacobi-Bellman equations. From these equations, we extract the globally optimal trajectories and the corresponding controls for several target processes of the atomic system, using a generalized method of characteristics. We apply this method to retrieve known results for CZ and C-phase gates, and to find new optimal pulses for all elementary processes involved in the universal quantum computation scheme introduced in [Physical Review Letters 131, 170601 (2023)].

quant-ph↗

arXiv2024

Hamiltonian Learning in Quantum Field Theories

We discuss Hamiltonian learning in quantum field theories as a protocol for systematically extracting the operator content and coupling constants of effective field theory Hamiltonians from experimental data. Learning the Hamiltonian for varying spatial measurement resolutions gives access to field theories at different energy scales, and allows to learn a flow of Hamiltonians reminiscent of the renormalization group. Our method, which we demonstrate in both theoretical studies and available data from a quantum gas experiment, promises new ways of addressing the emergence of quantum field theories in quantum simulation experiments.

cond-mat.quant-gas↗

arXiv2023

Unraveling PXP Many-Body Scars through Floquet Dynamics

Quantum scars are special eigenstates of many-body systems that evade thermalization. They were first discovered in the PXP model, a well-known effective description of Rydberg atom arrays. Despite significant theoretical efforts, the fundamental origin of PXP scars remains elusive. By investigating the discretized dynamics of the PXP model as a function of the Trotter step $τ$, we uncover a remarkable correspondence between the zero- and two-particle eigenstates of the integrable Floquet-PXP cellular automaton at $τ=π/2$ and the PXP many-body scars of the time-continuous limit. Specifically, we demonstrate that PXP scars are adiabatically connected to the eigenstates of the $τ=π/2$ Floquet operator. Building on this result, we propose a protocol for achieving high-fidelity preparation of PXP scars in Rydberg atom experiments.

cond-mat.stat-mech↗

arXiv2023

Continuous Coherent Quantum Feedback with Time Delays: Tensor Network Solution

In this paper we develop a novel method to solve problems involving quantum optical systems coupled to coherent quantum feedback loops featuring time delays. Our method is based on exact mappings of such non-Markovian problems to equivalent Markovian driven dissipative quantum many-body problems. In this work we show that the resulting Markovian quantum many-body problems can be solved (numerically) exactly and efficiently using tensor network methods for a series of paradigmatic examples, consisting of driven quantum systems coupled to waveguides at several distant points. In particular, we show that our method allows solving problems in so far inaccessible regimes, including problems with arbitrary long time delays and arbitrary numbers of excitations in the delay lines. We obtain solutions for the full real-time dynamics as well as the steady state in all these regimes. Finally, motivated by our results, we develop a novel mean-field approach, which allows us to find the solution semi-analytically and identify parameter regimes where this approximation is in excellent agreement with our exact tensor network results.

quant-ph↗

arXiv2023

Universal Quantum Computation in Globally Driven Rydberg Atom Arrays

We develop a model for quantum computation with Rydberg atom arrays, which only relies on global driving, without the need of local addressing of the qubits: any circuit is executed by a sequence of global, resonant laser pulses on a static atomic arrangement. We present two constructions: for the first, the circuit is imprinted in the trap positions of the atoms and executed by the pulses; for the second, the atom arrangement is circuit-independent, and the algorithm is entirely encoded in the global driving sequence. Our results show in particular that a quadratic overhead in atom number is sufficient to eliminate the need for local control to realize a universal quantum processor. We give explicit protocols for all steps of an arbitrary quantum computation, and discuss strategies for error suppression specific to our model. Our scheme is based on dual-species processors with atoms subjected to Rydberg blockade constraints, but it might be transposed to other setups as well.

quant-ph↗

arXiv2023

Enhancing Detection of Topological Order by Local Error Correction

The exploration of topologically-ordered states of matter is a long-standing goal at the interface of several subfields of the physical sciences. Such states feature intriguing physical properties such as long-range entanglement, emergent gauge fields and non-local correlations, and can aid in realization of scalable fault-tolerant quantum computation. However, these same features also make creation, detection, and characterization of topologically-ordered states particularly challenging. Motivated by recent experimental demonstrations, we introduce a new paradigm for quantifying topological states -- locally error-corrected decoration (LED) -- by combining methods of error correction with ideas of renormalization-group flow. Our approach allows for efficient and robust identification of topological order, and is applicable in the presence of incoherent noise sources, making it particularly suitable for realistic experiments. We demonstrate the power of LED using numerical simulations of the toric code under a variety of perturbations. We subsequently apply it to an experimental realization, providing new insights into a quantum spin liquid created on a Rydberg-atom simulator. Finally, we extend LED to generic topological phases, including those with non-abelian order.

quant-ph↗

arXiv2023

Quantum speedup for combinatorial optimization with flat energy landscapes

Designing quantum algorithms with a speedup over their classical analogs is a central challenge in quantum information science. Motivated by recent experimental observations of a superlinear quantum speedup in solving the Maximum Independent Set problem on certain unit-disk graph instances [Ebadi et al., Science 376, 6598 (2022)], we develop a theoretical framework to analyze the relative performance of the optimized quantum adiabatic algorithm and a broad class of classical Markov chain Monte Carlo algorithms. We outline conditions for the quantum adiabatic algorithm to achieve a quadratic speedup on hard problem instances featuring flat low-energy landscapes and provide example instances with either a quantum speedup or slowdown. We then introduce an additional local Hamiltonian with no sign problem to the optimized adiabatic algorithm to achieve a quadratic speedup over a wide class of classical simulated annealing, parallel tempering, and quantum Monte Carlo algorithms in solving these hard problem instances. Finally, we use this framework to analyze the experimental observations.

quant-ph↗

arXiv2023

Preparing random states and benchmarking with many-body quantum chaos

Producing quantum states at random has become increasingly important in modern quantum science, with applications both theoretical and practical. In particular, ensembles of such randomly-distributed, but pure, quantum states underly our understanding of complexity in quantum circuits and black holes, and have been used for benchmarking quantum devices in tests of quantum advantage. However, creating random ensembles has necessitated a high degree of spatio-temporal control, placing such studies out of reach for a wide class of quantum systems. Here we solve this problem by predicting and experimentally observing the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics, which we use to implement an efficient, widely applicable benchmarking protocol. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system, offering new insights into quantum thermalization. Predicated on this discovery, we develop a fidelity estimation scheme, which we demonstrate for a Rydberg quantum simulator with up to 25 atoms using fewer than 10^4 experimental samples. This method has broad applicability, as we show for Hamiltonian parameter estimation, target-state generation benchmarking, and comparison of analog and digital quantum devices. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a much wider context.

quant-ph↗

arXiv2023

Fermionic quantum processing with programmable neutral atom arrays

Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics. Although qubit-based quantum computers can potentially tackle this problem more efficiently than classical devices, encoding non-local fermionic statistics introduces an overhead in the required resources, limiting their applicability on near-term architectures. In this work, we present a fermionic quantum processor, where fermionic models are locally encoded in a fermionic register and simulated in a hardware-efficient manner using fermionic gates. We consider in particular fermionic atoms in programmable tweezer arrays and develop different protocols to implement non-local tunneling gates, guaranteeing Fermi statistics at the hardware level. We use this gate set, together with Rydberg-mediated interaction gates, to find efficient circuit decompositions for digital and variational quantum simulation algorithms, illustrated here for molecular energy estimation. Finally, we consider a combined fermion-qubit architecture, where both the motional and internal degrees of freedom of the atoms are harnessed to efficiently implement quantum phase estimation, as well as to simulate lattice gauge theory dynamics.

quant-ph↗