Searcharxiv⌕ Search

arXiv subjects

Francesco Tacchino

Publications and source records attributed to Francesco Tacchino.

At least 19 recordsLinked to original sources

Spin-adapted sample-based quantum diagonalization with randomized time evolution

Quantum algorithms based on the classical post-processing of measurement samples have emerged as effective and robust methods to approximate low-energy wavefunctions of many-body quantum systems on present-day and early-fault-tolerant quantum devices. This paper introduces a generic framework for enforcing spin symmetry within these approaches. We tailor this framework to SqDRIFT, a sample-based quantum diagonalization variant that uses the qDRIFT randomized compilation protocol to generate the quantum samples. We discuss how three key components of SqDRIFT (the initial-state preparation, the construction of the time-evolution circuits, and the classical post-processing) can be adapted to incorporate spin symmetry. We show that spin-pure circuits alone are not sufficient, since the sampled determinants generally span a subspace that is not closed under $\hat{S}^2$, and we restore this closure by completing the sampled electronic configurations. In classical simulations of 4-aminobenzonitrile and of an $[\text{Fe}(\text{NH}_{3})_{4}]^{2+}$ model complex, and in experiments on an IBM quantum processor for the oxo-Mn(Salen) complex, this spin-adapted post-processing yields roots that are exact spin eigenfunctions at every subspace size. On hardware, it does so with diagonalized subspaces two to three orders of magnitude smaller than those of the conventional constructions for the same circuit depth.

quant-ph↗

Nonperturbative string dynamics in a (2+1)D lattice gauge theory on a superconducting quantum processor

Electric flux strings underpin confinement in gauge theories. In two spatial dimensions, their evolution involves competing processes of charge motion, pair creation, and transverse deformation. Accessing these dynamics beyond perturbative limits challenges classical approaches, as entanglement growth restricts the times accessible to tensor-network simulations. Here we use quantum simulation to investigate a (2+1)D Z2 lattice gauge theory with dynamical matter and an explicit magnetic plaquette interaction, spanning strongly confined and nonperturbative deconfined regimes. Using 63 superconducting qubits, including 12 ancillas, we evolve initially localized strings with static or dynamical endpoint charges. Spatially resolved measurements reveal rapid charge and flux spreading in the deconfined regime, enhanced matter occupation in the string interior near the pair-creation resonance, and suppressed spreading at strong electric fields. String-path occupations further probe transverse rearrangements between configurations connected by plaquette operations. Retaining separate matter and gauge degrees of freedom makes local Gauss-law constraints directly accessible for error detection. Combining these constraints with ancilla checks and noise rescaling, we measure dynamics in circuits containing up to 15 second-order Trotter steps. Our results establish quantum simulation as a practical approach to exploring nonperturbative string dynamics in two spatial dimensions, with gauge redundancy serving as an experimental resource.

quant-ph↗

Benchmarking Quantum Convolutional Neural Networks and their classical surrogates on long-range strongly correlated models

We benchmark quantum convolutional neural networks (QCNNs) and their classical surrogates for phase differentiation in one-dimensional strongly correlated systems with beyond-nearest-neighbour terms. Using an anisotropic Heisenberg spin chain and an extended $t$-$t'$ Fermi-Hubbard model as representative spin and fermionic testbeds, we train QCNN classifiers on labelled ground-state datasets and map out finite-size phase diagrams. In hybrid setups, we employ Pauli backpropagation to express the QCNN measurement as a weighted sum of Pauli-string expectation values to be evaluated directly on input states, and study how truncation parameters control the trade-off between approximation accuracy and the size of the resulting Pauli expansion. Robust convergence is achieved for the Heisenberg model under aggressive truncation, whereas the Fermi-Hubbard model requires substantially looser thresholds, resulting in a sharp growth in retained Pauli strings and evaluation cost. Our results contribute to charting where hybrid quantum-classical training is viable for learning strongly correlated quantum states, and provide practical guidance for choosing truncation regimes in Pauli backpropagation-based surrogates.

quant-ph↗

Quantum chemistry with provable convergence via randomized sample-based Krylov quantum diagonalization

Quantum algorithms based on classical processing of individual samples have recently emerged as a promising route to perform large-scale quantum-chemical calculations on pre-fault-tolerant and early-fault-tolerant quantum devices. In these algorithms, the quantum computer acts as a sampling engine that generates the subspace in which the Hamiltonian is classically diagonalized. The recently proposed Sample-based Krylov Quantum Diagonalization (SKQD) uses quantum Krylov states as circuits from which samples are collected. Convergence guarantees can be derived for SKQD under assumptions similar to those of quantum phase estimation -- namely, a sufficiently large overlap between the reference and the target ground state -- with the additional requirement that the ground-state wave function be well approximated by a polynomial subset of the full Hilbert space. However, implementations of SKQD for complex many-body Hamiltonians, such as quantum chemistry ones, are limited by the depths of time-evolution circuits needed to generate Krylov vectors. In this work, we introduce a method that combines SKQD with a qDRIFT randomized compilation of the Hamiltonian propagator. The resulting algorithm, termed SqDRIFT, enables executing quantum chemistry experiments on present-day quantum processors while retaining provable convergence guarantees, which we extend to account for the error of the randomized compilation and of finite sampling. We demonstrate its viability by applying SqDRIFT to calculate the electronic ground-state energy of several polycyclic aromatic hydrocarbons, up to system sizes beyond the reach of exact diagonalization.

quant-ph↗

Shaping double descent in quantum extreme learning through model design

Increasing capacity can induce a machine learning model to generalize worse until it perfectly interpolates the training data, and better once it moves beyond interpolation. This inversion, known as \emph{double descent}, is well understood for independent features. For correlated features, its shape is governed by the spectrum of the feature covariance, but existing analyses typically yield only implicit equations. We first close this gap for classical linear regression, analytically characterizing the entire risk curve through two quantities, namely the condition number of the feature population covariance and a spectral measure of correlation strength. Then, we apply this theory on quantum models, focusing on quantum extreme learning machines (QELMs). We show that three tunable design knobs, \textit{i.e.,} encoding strength, input reuploads, and measurement shots, each regularize the QELM output covariance, and derive conditions under which the interpolation threshold remains stable. Finite measurement shot noise can be leveraged to guarantee this stability. Numerical experiments confirm each prediction, yielding concrete design principles for QELMs that generalize well beyond interpolation.

quant-ph↗

Neutrino thermalization via randomization on a quantum processor

The dynamical evolution of neutrino flavor in supernovae can be modeled by an all-to-all spin Hamiltonian with random couplings. Simulating such two-local Hamiltonian dynamics remains a major challenge, as methods with controllable accuracy require circuit depths that increase at least linearly with system size, exceeding the capabilities of current quantum devices. The eigenstate thermalization hypothesis predicts that these systems should thermalize, a behavior confirmed in small-scale classical simulations. Here we investigate flavor thermalization in much larger systems using random quantum circuits as an empirical tool to emulate the non-local dynamics, and demonstrate that thermal behavior can be reproduced using a depth independent of system size. By simulating systems of over one hundred qubits, we find that the thermalization time grows approximately as the square root of the system size, consistent with predictions from semi-classical methods. Our study also illustrates that near-term quantum devices are useful tools to test and validate empirical classical methods, and highlights an application of random circuits in physics.

quant-ph↗

Computing noise-canceling observables via Pauli propagation

The pursuit of quantum advantage is driving the co-evolution of quantum processors and classical simulation methods. Despite advances in scale and quality, the accuracy of quantum simulation is ultimately limited by error rates and sampling overheads. Similarly, while classical simulation methods such as Pauli propagation have made remarkable progress, their accuracy is ultimately limited by the exponential growth of operator paths and the truncations needed to control memory and runtime. Here we show that these complementary limitations can be mitigated by embedding Pauli propagation within a hybrid error-mitigation framework that reduces quantum sampling overhead while achieving lower truncation errors with fewer classical resources than traditional Pauli propagation alone. In this framework, a target observable is classically propagated through noise-canceling inverse channels, producing a modified observable that is measured directly on a quantum processor. We prototype two implementations and benchmark their performance numerically on canonical models that challenge traditional Pauli propagation. We also perform experiments on a quantum processor using 56 superconducting qubits, revealing the tradeoffs of their respective truncation strategies. These results illustrate how classical and quantum resources can be orchestrated to extend observable estimation beyond the limits of either approach alone, providing a foundation for quantum-centric supercomputing and future demonstrations of quantum advantage.

quant-ph↗

String dynamics of a (2+1)D U(1) quantum link model on a digital quantum computer

The (2+1)D U(1) pure gauge theory always exists in the confining phase, with strings of non-zero string tension giving a characteristic linear potential between static charges. This makes it a useful testing ground for quantum computing methods designed to study string dynamics of confining gauge theories. Here we implement a minimal U(1) quantum link model on a quantum computer with qubit degrees of freedom representing the dual height variables of the model. This facilitates an efficient realization of plaquette interactions and enables effective calculations of real-time dynamics that are inaccessible to traditional quantum Monte Carlo. A specifically tailored lattice geometry is chosen to match the heavy-hexagonal geometry of the IBM quantum hardware used here, minimizing non-adjacent qubit interactions. By performing quantum quenches from a simple initial string state, we probe the transverse quantum fluctuations of the string before it thermalizes. Our experimental results from digital quantum simulations, with up to 112 qubits, show good agreement with reference tensor-network calculations at short times and with thermal averages at long times. Near the phase transition, the quench dynamics exhibit large fluctuations of the initial string that extend across both spatial dimensions of the lattice. Nonetheless, our error-mitigated estimators from the quantum hardware also give accurate predictions in that regime, with noise-induced violations of local gauge symmetries comparable to finite-bond-dimension tensor-network results.

quant-ph↗

Combining non-parametric quantum states and MERA tensor networks for ground-state optimization

Hybrid tensor networks offer a promising route to enhance the expressivity of classical tensor network methods by incorporating quantum states prepared on a quantum computer. Existing approaches are limited by the variational optimization of the quantum component of the tensor network. In this work, we introduce an alternative strategy that combines a non-parametric quantum state prepared through quantum annealing and a classical isometric tensor network. The latter is variationally optimized while the former is used as a fixed, boundary tensor resource in the form of classical shadows. We demonstrate the feasibility of this approach through extensive numerical simulations on the transverse-field Ising model, showing that the optimization procedure remains robust under statistical and hardware noise. Moreover, our results indicate that our newly proposed setup improves the accuracy of the obtained ground state approximation compared to the original quantum simulation, without increasing the depth of the applied quantum circuits. Therefore, this setup offers a practical route to scale variational quantum algorithms towards the quantum utility scale.

quant-ph↗

Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes

Variational Quantum Algorithms are promising candidates for near-term quantum computing, yet they face scalability challenges due to barren plateaus, where gradients vanish exponentially relative to system size. Recent conjectures suggest that avoiding these plateaus might inherently lead to classical simulability, thereby limiting the opportunities for quantum advantage. In this work, we advance the theoretical understanding of the relationship between gradient scalability at initialization and the computational complexity of variational quantum algorithms. We first present the Taylor surrogate, a classical simulation technique that matches Pauli path runtime guarantees on near-Clifford regions while offering runtime advantages in specific regimes. Leveraging this surrogate, we prove that beyond previously established classically simulable regions, the computational complexity is at least super-polynomial. Next, we introduce the Linear Clifford Encoder, a classically efficient ansatz modifier that ensures constant-scaling gradients within landscape regions close to Clifford circuits. Finally, numerical experiments on these modified landscapes provide preliminary empirical evidence of a transition zone where constant-scaling gradients may decay polynomially in super-polynomially complex regions rather than exponentially. These findings suggest speculative instances where non-vanishing gradients and super-polynomial complexity could potentially coexist, vindicating the need for future formal proofs.

quant-ph↗

Bowtie VarQTE: A Resource-Efficient Quantum State Preparation Primitive

The preparation of quantum states is a fundamental requirement for many quantum algorithms. A native route to preparing physically structured states is based on short-time simulation of dynamical processes, such as real or imaginary time evolution. This work presents a resource-efficient framework for the approximation thereof with \textit{bowtie \ac{VarQTE}} which uses classical simulation where possible and quantum resources where necessary. We introduce a framework that leverages existing causal light-cones to minimize quantum resource requirements in the evaluation of gradient and quantum geometric tensor terms by utilizing classical simulation methods for causally relevant subcircuits. This in turn enables exact parameter updates according to McLachlan's variational principle and, thereby, improves numerical stability. We conduct a comparison with a state preparation method that is based on a tensor-network compiled Trotter algorithm: approximate quantum compilation (AQC). In recent work, this approach has shown impressive performance. However, its key-bottleneck is the necessity to have a classical (approximate) representation of the target state. Our numerical experiments indicate that bowtie VarQTE can achieve comparable fidelities without this requirement. We further illustrate how bowtie VarQTE can facilitate a state-preparation pipeline that combines the simulation of imaginary and real time evolution for a sample-based quantum algorithm. In fact, results on 2D systems show how bowtie VarQTE can reduce the quantum requirements compared to standard, sample-based Krylov diagonalization calculations. Our results indicate that VarQTE is a promising primitive for the preparation of physically structured quantum states that reduces requirements on quantum resources by leveraging existing structures and the associated possibility of enabling classical simulations.

quant-ph↗

A circuit-differentiation framework for Green's functions on quantum computers

We propose a general framework for computing Retarded Green's Functions (RGFs) on quantum computers by recasting their evaluation as a problem of circuit differentiation. Our proposal is based on real-time evolution and specifically designed circuit components, which we refer to as circuit perturbations, acting as a direct representation of the external perturbative force within the quantum circuit in a linear-response setting. The direct mapping between circuit derivatives and the computation of RGFs enables the use of a broad range of differentiation strategies. We provide two such examples, including a class of stochastic estimators which do not require extra qubit connectivity with respect to the underlying time-evolution operations. We demonstrate our approach on interacting spin and fermionic models, showing that accurate dynamical correlations can be obtained even under realistic noise assumptions. Finally, we outline how our proposal can be tied to efficient gradient-estimation techniques relevant for the fault-tolerant regime.

quant-ph↗

Exploring pathways towards quantum advantage in quantum chemistry: the case of a molecule with half-Möbius topology

We report quantum chemistry calculations performed on superconducting quantum processors for a molecule exhibiting the half-Möbius electronic topology originally introduced by Rončević et al. Using SqDRIFT, a randomized sample-based Krylov quantum diagonalization algorithm, we achieve reliable quantum simulations on active spaces corresponding to 36 orbitals (72 qubits) and extend previous studies up to 50 orbitals (100 qubits). We demonstrate that a systematic increase of active space sizes, which has a concrete impact on the accuracy of the electronic structure description, is achievable with state-of-the-art quantum processors, thus offering a promising path towards practically relevant quantum-assisted electronic-structure calculations.

quant-ph↗

Breaking concentration barriers for quantum extreme learning on digital quantum processors

Reservoir computing leverages rich, non-linear dynamics to process temporal data. Quantum variants promise enhanced expressivity from high-dimensional Hilbert spaces, yet their practical applicability is hindered by hardware noise and concentration effects that can erase input-output distinguishability at large system sizes. In this work, we present and experimentally demonstrate a Quantum Extreme Learning Machine (QELM) tailored to state-of-the-art superconducting platforms, employing up to 124 qubits and circuits with more than 5,000 two-qubit gates on IBM Quantum computers. We introduce a practical multi-objective hyperparameter tuning strategy that jointly monitors observable variability, capacity, and task performance to identify noise-robust operating points. In addition, we develop a local eigentask analysis that enables computationally efficient feature selection and effective information retrieval. We report evidence of a regime of optimality that is identifiable at small scales and transferable across tasks and larger systems, and we achieve performances competitive with leading classical baselines on representative benchmarks for time-series forecasting and satellite image classification. Together, our results establish a viable and robust framework for large-scale, pre-fault-tolerant quantum machine learning and provide a foundation for extending reservoir-based methods to more expressive architectures and real-world scenarios.

quant-ph↗

Stabilizer-based quantum simulation of fermion dynamics with local qubit encodings

Simulating the dynamical properties of large-scale many-fermion systems is a longstanding goal of quantum chemistry, material science and condensed matter. Local fermion-to-qubit encodings have opened a new path for practical fermionic simulations on digital quantum hardware where fermionic statistics are not enforced at the hardware level. In this paper, we explore these local encodings from the perspective of the corresponding time-evolution unitaries. Specifically, we propose a new framework for digital implementations of these qubit-encoded fermionic time-evolution unitaries based on \emph{flow sets}, which are one-dimensional subsets of the directed fermionic interaction graph. We find that any local fermionic encoding, when restricted to a given flow set, adopts a simple structure that we can classify systematically. For each categorized flow-set form, we propose a low-depth qubit quantum circuit that implements the time evolution unitary using the stabilizer formalism. As an application of our construction, we introduce novel flow-based decompositions for known two-dimensional encodings, leading to efficient circuit decompositions of time-evolution unitaries. We generally observe a space-time trade-off, where mappings with larger qubit-to-fermion ratios yield shallower time-evolution quantum circuits.

quant-ph↗

Optimizing two-dimensional isometric tensor networks with quantum computers

We propose a hybrid quantum-classical algorithm for approximating the ground state of two-dimensional quantum systems using an isometric tensor network ansatz, which maps naturally to quantum circuits. Inspired by the density matrix renormalization group, we optimize tensors sequentially by diagonalizing a series of effective Hamiltonians. These are constructed using a tomography-inspired method on a qubit subset whose size depends only on the bond dimension. Our approach leverages quantum computers to enable accurate solutions without relying on approximate contractions, circumventing the exponential complexity faced by classical techniques. We demonstrate our method on the two-dimensional (2D) transverse-field Ising model, achieving ground-state optimization on up to 25 qubits with modest quantum overhead -- significantly less than standard solutions based on variational quantum eigensolvers. Overall, our results offer a path towards scalable variational quantum algorithms in both noisy and fault-tolerant regimes.

quant-ph↗

Large-scale implementation of quantum subspace expansion with classical shadows

Quantum subspace expansion (QSE) offers promising avenues to perform spectral calculations on quantum processors but comes with a large measurement overhead. Informationally complete (IC) measurements, such as classical shadows, were recently proposed to overcome this bottleneck. Here, we report the first large-scale implementation of QSE with IC measurements. In particular, we probe the quantum phase transition of a spin model with three-body interactions, for which we observe accurate ground state energy recovery and mitigation of local order parameters across system sizes of up to 80 qubits. We achieve this by reformulating QSE as a constrained optimization problem, obtaining rigorous statistical error estimates and avoiding numerical ill-conditioning. With over $3 \times 10^4$ measurement basis randomizations per circuit and the evaluation of $O(10^{14})$ Pauli traces, this represents one of the most significant experimental realizations of classical shadows to date.

quant-ph↗

Resource-Efficient Simulations of Particle Scattering on a Digital Quantum Computer

We develop and demonstrate methods for simulating the scattering of particle wave packets in the interacting Thirring model on digital quantum computers, with hardware implementations on up to 80 qubits. We identify low-entanglement time slices of the scattering dynamics and exploit their efficient representation by tensor networks. Circuit compression based on matrix product state techniques yields on average a reduction by a factor of 3.2 in circuit depth compared to conventional approaches, allowing longer evolution times to be evaluated with higher fidelity on contemporary quantum processors. Utilizing zero-noise extrapolation in combination with Pauli twirling, on quantum hardware we accurately simulate the full scattering dynamics on 40 qubits, and further demonstrate the wave packet state-preparation on 80 qubits.

quant-ph↗