arXiv subjects

Gaurav Gyawali

Publications and source records attributed to Gaurav Gyawali.

10 recordsLinked to original sources

arXiv2026

How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits. Nevertheless, there are significant outstanding challenges in quantum hardware, fabrication, software architecture, and algorithms on the path towards a full-stack scalable quantum computing technology. Here, we provide a comprehensive review of these scaling challenges. We show how to facilitate scaling by adopting existing semiconductor technology to build much higher-quality qubits, employing systems engineering approaches, and performing distributed heterogeneous quantum-classical computing. We provide a detailed resource and sensitivity analysis for quantum applications on surface-code error-corrected quantum computers given current, target, and desired hardware specifications based on superconducting qubits, accounting for a realistic distribution of errors. We provide comprehensive resource estimates for several utility-scale applications including quantum chemistry calculations, catalyst design, NMR spectroscopy, and Fermi-Hubbard simulation. We show that orders of magnitude enhancement in performance could be obtained by a combination of hardware improvements and tight quantum-HPC integration. Furthermore, we introduce high-performance architectures for quantum-probabilistic computing with custom-designed accelerators to tackle today's industry-scale classical optimization, machine learning, and quantum simulation tasks in a cost-effective manner.

quant-ph↗

arXiv2026

Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers

Efficient simulation of strongly-interacting fermionic systems on quantum processing units (QPUs) is a challenging task due to nonlocal mode entanglement generation. However, it is not yet well understood how the structure of entanglement governs the hardness of large-scale quantum chemistry simulations or the scaling of distributing such workloads. Here, we introduce an algorithm for estimating the distribution complexity of hybrid quantum-classical simulation for electronic structure Hamiltonians over heterogeneous high-performance architectures. Our algorithm relies on efficient analytical evaluation of the low entanglement boundaries for the orbital rotations and dephasing-induced localization within tensor fragments, in a double-factorized representation. Our entanglement estimation scales as $O(N^3)$ for each fragment, where $N$ is the number of orbitals. When QPUs are communicating via a quantum network, the cost of distribution per fragment is reduced quadratically from $O(N^2)$ to $O(N)$. Similarly, for hybrid quantum-classical approaches, with access to only conventional HPC interconnects, the worst-case cost is reduced from $O(\exp(N^2))$ to $O(\exp(N))$. We show that emergent entanglement patterns are induced by the interplay between coherent Gaussian orbital rotations and disordered Coulomb interactions. We discuss the underlying physical mechanisms that govern distribution complexity and introduce model systems that are tunable based on the localizability of fragments and the overlap of interfragment rotations. We characterize three different regimes of hardness for distribution complexity and classical simulability. The framework introduced here enables novel and more efficient quantum-classical application workflows towards utility-scale quantum computing.

quant-ph↗

arXiv2026

Measurement-Induced Landscape Transitions and Coding Barren Plateaus in Hybrid Variational Quantum Circuits

The entanglement-induced barren plateau is an exponential vanishing of the parameter gradients with system size that limits the practical application of variational quantum algorithms (VQA). A landscape transition from barren plateau to no-barren plateau was recently observed in monitored quantum circuits, hypothesized to coincide with the measurement-induced phase transition (MIPT) that separates the area-law states from the volume-law states. We argue from an information theory perspective that these are different transitions. This hypothesis is supported by a numerical study that includes cost-gradient variances, visualizations of the optimization runs and cost-landscape, and a quantum-classical channel mutual information measure. The results are evidence for a universal measurement-induced landscape transition (MILT) at $p_c^{\text{MILT}} \approx 0.2 < p_c^{\text{MIPT}}$ and that throughout $0<p<p_c^{\text{MILT}}$, there is a finite quantum-classical channel mutual information in the limit of a large number of qubits. Unlike the barren plateau without measurements, a non-zero rate of measurements induces a coding barren plateau where, typically, information about the parameters is available to a local cost function despite a vanishing gradient.

quant-ph↗

arXiv2026

Partially Fault-Tolerant Quantum Computation for Megaquop Applications

Partially fault-tolerant quantum computing (FTQC) has recently emerged as a promising approach for the execution of megaquop-scale circuits with millions of logical operations. In this work, we demonstrate the strengths and the limitations of this approach by conducting quantum resource estimation (QRE) of the space--time-efficient analog rotation (STAR) architecture using realistic hardware specifications for superconducting processors, and compare it against the QRE of the full FTQC architecture. We show how the performance of the STAR architecture's protocols is affected by hardware improvements. We also reduce the space requirements for partial FTQC by developing a procedure leveraging code growth to decrease the size of a factory producing analog rotation states. Our results reveal a non-trivial dependence of the optimal pre-growth code distance on the rotation angle with respect to post-growth infidelity. Further, we analyze space--time trade-offs between the factory size and the error-mitigation overhead, and observe that in an application-agnostic setting, there is a Goldilocks zone for circuits in the regime of roughly $10^5$--$10^6$ small-angle rotation gates. We show that quantum simulation of 2D Fermi--Hubbard model systems is a particularly well-suited application for the STAR architecture, requiring only hundreds of thousands of physical qubits and runtimes on the order of minutes for modest system sizes. Due to its favourable algorithmic scaling to larger system sizes, utility-scale simulation of the 2D Fermi--Hubbard model could potentially be attained using partial FTQC.

quant-ph↗

arXiv2026

Distributed Quantum Computing via Adaptive Circuit Knitting

Distributing quantum workloads over many Quantum Processing Units (QPUs) is a crucial step in scaling up quantum computers toward practical quantum advantage due to the limitations in size of a single QPU. In the absence of high-fidelity quantum interconnects, circuit knitting could provide a path to computing certain properties of large quantum systems on many QPUs of limited size in a distributed fashion using only classical communication. Circuit knitting partitions large quantum circuits into manageable sub-circuits, however, reconstructing observables in a straightforward manner comes at an exponential cost in sampling and classical post-processing. To mitigate the overhead this technique incurs, we introduce an Adaptive Circuit Knitting (ACK) method that finds efficient partitions of quantum circuits by discovering regions of minimal entanglement between subsystems. We simulate 1D and 2D disordered mixed-field Ising models up to 60 qubits and show that the ACK approach can reduce circuit knitting sampling overheads by up to four orders of magnitude for observables of interest. We highlight our parallel GPU-accelerated implementation and discuss the need for efficient classical simulators to enable distributed quantum algorithm development. Our techniques could enable efficient distribution of quantum simulation for both near-term and fault-tolerant architectures.

quant-ph↗

arXiv2026

The source of hardware-tailored codes and coding phases

A central challenge in quantum error correction is identifying powerful quantum codes tailored to specific hardware and determining their error thresholds above which quantum information is unprotected. This problem is hard because we cannot determine the noise models for our devices. Inspired by the quantum capacity theorem, we seek an optimal quantum source of information, namely the density matrix that degrades minimally when passed through a noisy channel. We explore this idea with the Open Random Unitary Model (ORUM), a simplified model of a $N$-qubit quantum computer with competing depolarizing and dephasing channels as a stand-in for unitary gates and measurements. Through numerical optimization, we find that the ORUM hosts three discrete regimes, three "phases", the "maximally mixed source" phase, a "$\mathbb{Z}_2$ source" phase (where ORUM's $U(1)$ gauge symmetry is broken down to $\mathbb{Z}_2$), and a no-coding phase where all information is lost. These phases exhibit first-order transitions among themselves and converge at a novel zero-capacity multicritical point. These results show a remarkable similarity between the quantum capacity theorem and Jaynes' maximum entropy principle of statistical mechanics. Using the $\mathbb{Z}_2$ source, we build two codes, a classical cat code capable of correcting all the dephasing errors and a concatenated cat code capable of correcting all errors up to a distance $d=\text{min}(m,N)$ and reduces to Shor's 9-qubit code for $m=N=3$. Neither classical nor quantum code survives near the vicinity of the zero-capacity multicritical point in the source phase diagram. Applying our approach to current noisy devices could provide a systematic method for constructing quantum codes for robust computation and communication.

quant-ph↗

arXiv2025

Observation of disorder-free localization using a (2+1)D lattice gauge theory on a quantum processor

Disorder-induced phenomena in quantum many-body systems pose significant challenges for analytical methods and numerical simulations at relevant time and system scales. To reduce the cost of disorder-sampling, we investigate quantum circuits initialized in states tunable to superpositions over all disorder configurations. In a translationally-invariant lattice gauge theory (LGT), these states can be interpreted as a superposition over gauge sectors. We observe localization in this LGT in the absence of disorder in one and two dimensions: perturbations fail to diffuse despite fully disorder-free evolution and initial states. However, Rényi entropy measurements reveal that superposition-prepared states fundamentally differ from those obtained by direct disorder sampling. Leveraging superposition, we propose an algorithm with a polynomial speedup in sampling disorder configurations, a longstanding challenge in many-body localization studies.

quant-ph↗

arXiv2025

Visualizing Dynamics of Charges and Strings in (2+1)D Lattice Gauge Theories

Lattice gauge theories (LGTs) can be employed to understand a wide range of phenomena, from elementary particle scattering in high-energy physics to effective descriptions of many-body interactions in materials. Studying dynamical properties of emergent phases can be challenging as it requires solving many-body problems that are generally beyond perturbative limits. Here, we investigate the dynamics of local excitations in a $\mathbb{Z}_2$ LGT using a two-dimensional lattice of superconducting qubits. We first construct a simple variational circuit which prepares low-energy states that have a large overlap with the ground state; then we create charge excitations with local gates and simulate their quantum dynamics via a discretized time evolution. As the electric field coupling constant is increased, our measurements show signatures of transitioning from deconfined to confined dynamics. For confined excitations, the electric field induces a tension in the string connecting them. Our method allows us to experimentally image string dynamics in a (2+1)D LGT from which we uncover two distinct regimes inside the confining phase: for weak confinement the string fluctuates strongly in the transverse direction, while for strong confinement transverse fluctuations are effectively frozen. In addition, we demonstrate a resonance condition at which dynamical string breaking is facilitated. Our LGT implementation on a quantum processor presents a novel set of techniques for investigating emergent excitations and string dynamics.

quant-ph↗

arXiv2023

Revealing microcanonical phases and phase transitions of strongly correlated electrons via time-averaged classical shadows

Quantum computers and simulators promise to enable the study of strongly correlated quantum systems. Yet, surprisingly, it is hard for them to compute ground states. They can, however, efficiently compute the dynamics of closed quantum systems. We propose a method to study the quantum thermodynamics of strongly correlated electrons from quantum dynamics. We define time-averaged classical shadows (TACS) and prove it is a classical shadow(CS) of the von Neumann ensemble, the time-averaged density matrix. We then show that the diffusion maps, an unsupervised machine learning algorithm, can efficiently learn the phase diagram and phase transition of the one-dimensional transverse field Ising model both for ground states using CS \emph{and state trajectories} using TACS. It does so from state trajectories by learning features that appear to be susceptibility and entropy from a total of 90,000 shots taken along a path in the microcanonical phase diagram. Our results suggest a low number of shots from quantum simulators can produce quantum thermodynamic data with a quantum advantage.

quant-ph↗

arXiv2022

Adaptive variational preparation of the Fermi-Hubbard eigenstates

Approximating the ground states of strongly interacting electron systems in quantum chemistry and condensed matter physics is expected to be one of the earliest applications of quantum computers. In this paper, we prepare highly accurate ground states of the Fermi-Hubbard model for small grids up to 6 sites (12 qubits) by using an interpretable, adaptive variational quantum eigensolver(VQE) called ADAPT-VQE. In contrast with non-adaptive VQE, this algorithm builds a system-specific ansatz by adding an optimal gate built from one-body or two-body fermionic operators at each step. We show this adaptive method outperforms the non-adaptive counterpart in terms of fewer variational parameters, short gate depth, and scaling with the system size. The fidelity and energy of the prepared state appear to improve asymptotically with ansatz depth. We also demonstrate the application of adaptive variational methods by preparing excited states and Green functions using a proposed ADAPT-SSVQE algorithm. Lower depth, asymptotic convergence, noise tolerance of a variational approach, and a highly controllable, system-specific ansatz make the adaptive variational methods particularly well-suited for NISQ devices.

quant-ph↗