Searcharxiv⌕ Search

arXiv subjects

Pedro L. S. Lopes

Publications and source records attributed to Pedro L. S. Lopes.

At least 19 recordsLinked to original sources

A Heterogeneous Distributed Architecture for Quantum Simulation

Architectural specialization and distribution can help scale fault-tolerant quantum computers, but may also introduce substantial overheads from communication, routing, and resource duplication. We introduce a heterogeneous distributed architecture in which a magic core is connected to an extensible storage system composed of one-dimensional lanes of specialized cold-storage nodes. The storage system supports parallel random access to Pauli string parities. This organization is particularly well suited to fermionic quantum simulation, enabling parallel execution of the highly non-local Pauli strings arising from these systems. We evaluate the architecture on fault-tolerant simulations of the dynamics of the Fermi-Hubbard and sparse Sachdev-Ye-Kitaev (SYK) models on systems of up to 450 logical qubits. These workloads exhibit complementary communication structures: Fermi-Hubbard produces a spectrum of interactions from local to non-local shaped by lattice geometry, whereas sparse SYK produces highly non-local and overlapping Pauli operators. For a Trotter step of a 450-logical-qubit Fermi-Hubbard workload, a six-lane system with 30 T-state factories is within approximately $1.4\times$ the wall-clock time of a homogeneous distributed architecture with 4 times as many T-state factories and substantially greater connectivity and sites for injecting magic. For matched T-factory counts, our architecture is $\sim 2\times$ faster.

quant-ph↗

Learning and Generating Mixed States Prepared by Shallow Channel Circuits

Learning quantum states from measurement data is a central problem in quantum information and computational complexity. In this work, we study the problem of learning to generate mixed states on a finite-dimensional lattice. Motivated by recent developments in mixed state phases of matter, we focus on arbitrary states in the trivial phase. A state belongs to the trivial phase if there exists a shallow preparation channel circuit under which local reversibility is preserved throughout the preparation. We prove that any mixed state in this class can be efficiently learned from measurement access alone. Specifically, given copies of an unknown trivial phase mixed state, our algorithm outputs a shallow local channel circuit that approximately generates this state in trace distance. The sample complexity and runtime are polynomial (or quasi-polynomial) in the number of qubits, assuming constant (or polylogarithmic) circuit depth and gate locality. Importantly, the learner is not given the original preparation circuit and relies only on its existence. Our results provide a structural foundation for quantum generative models based on shallow channel circuits. In the classical limit, our framework also inspires an efficient algorithm for classical diffusion models using only a polynomial overhead of training and generation.

quant-ph↗

Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study

We present an architecture-algorithm co-design study of the Optimistic Quantum Fourier Transform (OQFT) under a surface-code fault-tolerant execution model for reconfigurable neutral-atom hardware. Analyzing the OQFT structure, particularly its reliance on phase-gradient resources and small-scale blocks, highlights architectural requirements for resource mobility and parallel execution. Guided by that, we introduce a hot-zone architecture that decouples data storage from processing and dynamically routes mobile resource packages (magic-state factories, bridge qubits, and phase-gradient registers) to stationary data regions. To expose dominant costs, we route rotation insertions via catalytic phase-gradient addition and heuristically micro-schedule ripple-carry adders to patch-level moves. Under this model, leading Gidney~\cite{Gidney2018halvingcostof} and Cuccaro~\cite{cuccaro2004} adders have similar space-time volume but require different levels of parallelism. At the algorithm level, the five-layer OQFT shows a tunable parallelism/latency trade-off: two hot zones match serial-QFT latency, four hot zones roughly halve runtime, and additional hot zones asymptotically approach constant-time execution at substantial resource cost. Across 256-2048-bit instances, the requirements for half-time performance converge to about 500 additional logical ancillae and a peak parallelism of 128 logical qubits. We also identify broader algorithm-architecture bottlenecks, including endianness mismatches between phase-gradient and data registers, addressed via cyclic phase-gradient swaps and alternating QFT reflections. Scoped to surface codes and cultivation-only magic-state factories, our analysis identifies reaction-limited operation and parallelism demand as primary drivers of resource estimation and establishes a generalizable foundation for primitive-based architectural studies.

quant-ph↗

Quantum criticality and nonequilibrium dynamics on a Lieb lattice of Rydberg atoms

Neutral-atom quantum simulators offer a promising approach to the exploration of strongly interacting many-body systems, with applications spanning condensed matter, statistical mechanics, and high-energy physics. Through a combination of quantum experiments, numerical calculations, and analytical methods, we demonstrate a rich set of phenomena accessible on such quantum simulators by studying an array of Rydberg atoms placed on the Lieb lattice. First, we map out the ground states and phase diagram of the system, identifying a range of density-wave-ordered phases -- including a collinear phase stabilized purely by quantum fluctuations -- and find good agreement between theory and experiment. Allowing for local control of the detuning field thereafter, we discover a quantum analog of the classical liquid-vapor transition between two density-wave phases distinguished by sublattice occupation, and probe its underlying hysteretic dynamics. Furthermore, we study out-of-equilibrium quantum quenches and observe anomalously slow relaxation dynamics consistent with the kinetic constraints of an emergent string phase. These results highlight how geometric control offered by neutral-atom simulators can extend the frontiers of programmable quantum matter, enabling access to complex phases, metastability, and thermalization dynamics in many-body quantum systems.

cond-mat.quant-gas↗

Information Propagation in Rydberg Arrays via Analog OTOC Calculations

Out-of-time-order correlators (OTOCs) are the main tool for probing quantum chaos and scrambling, and have become crucial probes in many areas of quantum computing. However, the measurement of OTOCs is difficult to implement on analog quantum computers due to the requirement of backward time evolution. In this paper, we develop and implement a randomized measurement protocol to compute OTOCs on Aquila by QuEra Computing. Unlike traditional methods that require backward time evolution, our approach utilizes a sequence of global randomized quenches that approximates the unitary 2-design properties necessary for extracting infinite-temperature OTOCs from statistical correlations. We demonstrate the protocol's success by explicitly observing the lightcone of information propagation in 1D Rydberg chains, and compare hardware results to both state-vector simulations and matrix product state (MPS) tensor network calculations. This work establishes the first demonstration of fully analog randomized OTOC measurements in neutral-atom simulators, providing a scalable pathway to probe quantum chaos in complex many-body systems.

quant-ph↗

Observation of an anomaly in the statistics of Kibble-Zurek defects

The Kibble-Zurek mechanism quantifies defect formation during adiabatic passage across a continuous phase transition, providing key insights into universality in quantum many-body systems. We explore counting statistics of defects in adiabatic passage experiments on long 1D Rydberg atom chains. The experiments reveal an anomaly in the defect number distribution at long ramp times, challenging the hypothesis of defect formation through independent domain mergers. Numerical simulations confirm the anomaly and suggest its link to non-critical coarsening dynamics, which we suppress in prepare-and-hold experiments. Our results highlight the ability of quantum simulators to uncover unexpected correlated quantum phenomena.

quant-ph↗

Probing emergent prethermal dynamics and resonant melting on a programmable quantum simulator

The dynamics of isolated quantum systems following a sudden quench plays a central role in many areas of material science, high-energy physics, and quantum chemistry. Featuring complex phenomena with implications for thermalization, non-equilibrium phase transitions, and Floquet phase engineering, such far-from-equilibrium quantum dynamics is challenging to study numerically, in particular, in high-dimensional systems. Here, we use a programmable neutral atom quantum simulator to systematically explore quench dynamics in spin models with up to 180 qubits. By initializing the system in a product state and performing quenches across a broad parameter space, we discover several stable, qualitatively distinct dynamical regimes. We trace their robustness to Floquet-like prethermal steady states that are stabilized over long emergent timescales by strong dynamical constraints. In addition, we observe sharp peaks in the dynamical response that are quantitatively explained by the structured melting of prethermalization through resonances. In two dimensions, we uncover a sharp dynamical response change that converges with increased system size, that is linked to the proliferation of Néel-order defects and indicative of a dynamical phase transition with no equilibrium analogs. Uncovering an intricate interplay between quantum prethermalization and emergent dynamical phases, our results demonstrate the use of quantum simulators for revealing complex non-equilibrium quantum many-body phenomena.

quant-ph↗

Compilation of QCrank Encoding Algorithm for a Dynamically Programmable Qubit Array Processor

Algorithm and hardware-aware compilation co-design is essential for the efficient deployment of near-term quantum programs. We present a compilation case-study implementing QCrank -- an efficient encoding protocol for storing sequenced real-valued classical data in a quantum state -- targeting neutral atom-based Dynamically Programmable Qubit Arrays (DPQAs). We show how key features of neutral-atom arrays such as high qubits count, operation parallelism, multi-zone architecture, and natively reconfigurable connectivity can be used to inform effective algorithm deployment. We identify algorithmic and circuit features that signal opportunities to implement them in a hardware-efficient manner. To evaluate projected hardware performance, we define a realistic noise model for DPQAs using parameterized Pauli channels, implement it in Qiskit circuit simulators, and assess QCrank's accuracy for writing and reading back 24-320 real numbers into 6-20 qubits. We compare DPQA results with simulated performances of Quantinuum's H1-1E and with experimental results from IBM Fez, highlighting promising accuracy scaling for DPQAs.

quant-ph↗

Experimental Demonstration of Logical Magic State Distillation

Realizing universal fault-tolerant quantum computation is a key goal in quantum information science. By encoding quantum information into logical qubits utilizing quantum error correcting codes, physical errors can be detected and corrected, enabling substantial reduction in logical error rates. However, the set of logical operations that can be easily implemented on such encoded qubits is often constrained, necessitating the use of special resource states known as 'magic states' to implement universal, classically hard circuits. A key method to prepare high-fidelity magic states is to perform 'distillation', creating them from multiple lower fidelity inputs. Here we present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer. Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel. We demonstrate the distillation of magic states encoded in d=3 and d=5 color codes, observing improvements of the logical fidelity of the output magic states compared to the input logical magic states. These experiments demonstrate a key building block of universal fault-tolerant quantum computation, and represent an important step towards large-scale logical quantum processors.

quant-ph↗

False vacuum decay and nucleation dynamics in neutral atom systems

Metastable states of quantum many-body systems with confinement offer a means to simulate false vacuum phenomenology, including non-equilibrium dynamical processes like decay by nucleation, in truncated limits. Recent work has examined the decay process in 1D ferromagnetic Ising spins and superfluids. In this paper, we study nucleation dynamics in 1D antiferromagnetic neutral atom chains with Rydberg interactions, using both numerical simulations and analytic modeling. We apply a staggered local detuning field to generate the metastable and ground states. Our efforts focus on two dynamical regimes: decay and annealing. In the first, we corroborate the phenomenological decay rate scaling and determine the associated parameter range for the decay process; in the second, we uncover and elucidate a procedure to anneal the metastable state from the initial to the final system, with intermediate nucleation events. We further propose experimental protocols to prepare the required states and perform quenches on near-term neutral atom quantum simulators, examining the experimental feasibility of our proposed setup and parameter regime.

quant-ph↗

Long-lived oscillations of metastable states in neutral atom systems

Metastable states arise in a range of quantum systems and can be observed in various dynamical scenarios, including decay, bubble nucleation, and long-lived oscillations. The phenomenology of metastable states has been examined in quantum many-body systems, notably in 1D ferromagnetic Ising spin systems and superfluids. In this paper, we study long-lived oscillations of metastable and ground states in 1D antiferromagnetic neutral atom chains with long-range Rydberg interactions. We use a staggered local detuning field to achieve confinement. Using theoretical and numerical models, we identify novel spectral signatures of quasiparticle oscillations distinct to antiferromagnetic neutral atom systems and interpret them using a classical energy model of short-range meson repulsion. Finally, we evaluate the experimental accessibility of our proposed setup on current neutral-atom platforms and discuss experimental feasibility and constraints.

quant-ph↗

Engineering quantum states with neutral atoms

Aquila, an analog quantum simulation platform developed by QuEra Computing, supports control of the position and coherent evolution of up to 256 neutral atoms. This study details novel experimental protocols designed for analog quantum simulators that generate Bell state entanglement far away from the blockade regime, construct a $Z_2$ state with a defect induced by an ancilla, and optimize the driving fields schedule to prepare excited states with enhanced fidelity. We additionally evaluate the effectiveness of readout error mitigation techniques in improving the fidelity of measurement results. All experiments were executed on Aquila from QuEra and facilitated by the AWS Braket interface. Our experimental results closely align with theoretical predictions and numerical simulations. The insights gained from this study showcase Aquila's capabilities in handling complex quantum simulations and computations, and also pave the way for new avenues of research in quantum information processing and physics that employ programmable analog hardware platforms.

quant-ph↗

Large-scale quantum reservoir learning with an analog quantum computer

Quantum machine learning has gained considerable attention as quantum technology advances, presenting a promising approach for efficiently learning complex data patterns. Despite this promise, most contemporary quantum methods require significant resources for variational parameter optimization and face issues with vanishing gradients, leading to experiments that are either limited in scale or lack potential for quantum advantage. To address this, we develop a general-purpose, gradient-free, and scalable quantum reservoir learning algorithm that harnesses the quantum dynamics of neutral-atom analog quantum computers to process data. We experimentally implement the algorithm, achieving competitive performance across various categories of machine learning tasks, including binary and multi-class classification, as well as timeseries prediction. Effective and improving learning is observed with increasing system sizes of up to 108 qubits, demonstrating the largest quantum machine learning experiment to date. We further observe comparative quantum kernel advantage in learning tasks by constructing synthetic datasets based on the geometric differences between generated quantum and classical data kernels. Our findings demonstrate the potential of utilizing classically intractable quantum correlations for effective machine learning. We expect these results to stimulate further extensions to different quantum hardware and machine learning paradigms, including early fault-tolerant hardware and generative machine learning tasks.

quant-ph↗

Industry applications of neutral-atom quantum computing solving independent set problems

Architectures for quantum computing based on neutral atoms have risen to prominence as candidates for both near and long-term applications. These devices are particularly well suited to solve independent set problems, as the combinatorial constraints can be naturally encoded in the low-energy Hilbert space due to the Rydberg blockade mechanism. Here, we approach this connection with a focus on a particular device architecture and explore the ubiquity and utility of independent set problems by providing examples of real-world applications. After a pedagogical introduction of basic graph theory concepts of relevance, we briefly discuss how to encode independent set problems in Rydberg Hamiltonians. We then outline the major classes of independent set problems and include associated example applications with industry and social relevance. We determine a wide range of sectors that could benefit from efficient solutions of independent set problems -- from telecommunications and logistics to finance and strategic planning -- and display some general strategies for efficient problem encoding and implementation on neutral-atom platforms.

quant-ph↗

$G_2$ Integrable Point Characterization via Isotropic Spin-3 Chains

We investigate the physical properties of $G_2$-symmetric integrable chains with local degrees of freedom in the fundamental representation; given the typical connection between integrability and critical points, we test the model's properties against a hypothesis of conformal-invariant long-distance behavior. Leveraging an embedding between the $G_2$ exceptional Lie algebra and $SU(2)$-symmetric chains with local spin-3 representations, we perform numerical analyses via exact diagonalization (ED) targeted at specific spin sectors, as well as via non-Abelian density-matrix renormalization group (DMRG). A basic study of the momentum-resolved ED spectrum suggests the low-energy system is effectively described by a $(G_2)_1$ Wess--Zumino--Witten (WZW) theory, but we find challenges in further numerical characterization of conformal data. The study and control of the phenomenology of this model may have implications for the development of accessible models for Fibonacci anyons.

cond-mat.str-el↗

The case of SU$(3)$ criticality in spin-2 chains

It was proposed in [(https://doi.org/10.1103/PhysRevLett.114.145301){Chen et al., Phys. Rev. Lett. $\mathbf{114}$, 145301 (2015)}] that spin-2 chains display an extended critical phase with enhanced SU$(3)$ symmetry. This hypothesis is highly unexpected for a spin-2 system and, as we argue, would imply an unconventional mechanism for symmetry emergence. Yet, the absence of convenient critical points for renormalization group perturbative expansions, allied with the usual difficulty in the convergence of numerical methods in critical or small-gapped phases, renders the verification of this hypothetical SU$(3)$-symmetric phase a non-trivial matter. By tracing parallels with the well-understood phase diagram of spin-1 chains and searching for signatures robust against finite-size effects, we draw criticism on the existence of this phase. We perform non-Abelian density matrix renormalization group studies of multipolar static correlation function, energy spectrum scaling, single-mode approximation, and entanglement spectrum to shed light on the problem. We determine that the hypothetical SU$(3)$ spin-2 phase is, in fact, dominated by ferro-octupolar correlations and also observe a lack of Luttinger-liquid-like behavior in correlation functions that suggests that is perhaps not critical. We further construct an infinite family of spin-$S$ systems with similar ferro-octupolar-dominated quasi-SU$(3)$-like phenomenology; curiously, we note that the spin-3 version of the problem is located in a subspace of exact G$_2$ symmetry, making this a point of interest for search of Fibonacci topological properties in magnetic systems.

cond-mat.str-el↗

Multi-impurity chiral Kondo model: correlation functions and anyon fusion rules

The multichannel Kondo model supports effective anyons on the partially screened impurity, as suggested by its fractional impurity entropy. It was recently demonstrated for the multi-impurity chiral Kondo model, that scattering of an electron through the impurities depends on the anyon's total fusion channel. Here we study the correlation between impurity-spins. We argue, based on a combination of conformal field theory, a perturbative limit with a large number of channels $k$, and the exactly solvable two-channel case, that the inter-impurity spin correlation probes the anyon fusion of the pair of correlated impurities. This may allow, using measurement-only topological quantum computing protocols, to braid the multichannel Kondo anyons via consecutive measurements.

cond-mat.str-el↗

Topological Josephson Bifurcation Amplifier: Semiclassical theory

Amplifiers based on Josephson junctions allow for a fast and noninvasive readout of superconducting qubits. Motivated by the ongoing progress toward the realization of fault-tolerant qubits based on Majorana bound states, we investigate the topological counterpart of the Josephson bifurcation amplifier. We predict that the bifurcation dynamics of a topological Josephson junction driven in the appropriate parameter regime may be used as an additional tool to detect the emergence of Majorana bound states.

cond-mat.supr-con↗