arXiv subjects

Amit Jamadagni

Publications and source records attributed to Amit Jamadagni.

14 recordsLinked to original sources

arXiv2026

Composite-Dimensional Topological Codes with Boundaries and Defects

We introduce new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and $0D$ defects of Abelian composite-dimensional twisted quantum doubles. Using the physically intuitive concept of condensation, our algorithm explicitly describes how to construct the boundary and domain-wall stabilizers starting from the bulk model. This extends the utility of Pauli stabilizer models in describing non-translationally invariant topological orders with gapped boundaries. To highlight this utility, we provide a series of examples, including a new family of quantum error-correcting codes where the double of $\mathbb{Z}_4$ is coupled to instances of the double semion (DS) phase. We discuss the codes' utility in the burgeoning area of quantum error correction with an emphasis on the interplay between deconfined anyons, logical operators, error rates, and decoding. We also augment our construction, built using algorithmic tools to describe the properties of explicit stabilizer layouts at the microscopic lattice-level, with dimensional counting arguments and macroscopic-level constructions building on pants decompositions. The latter outlines how such codes' representation and design can be automated. Our results are validated by a series of error-correcting threshold calculations comparing our code's performance with standard surface codes. To do so, we introduce a composite dimensional belief propagation decoder with ordered statistics that utilizes combination sweeps. Going beyond our worked-out examples, we expect our explicit step-by-step algorithms to pave the path for new higher-dimensional codes to be discovered and implemented in near-term architectures that take advantage of various hardware's distinct strengths.

quant-ph↗

arXiv2026

Towards Predictive Quantum Algorithmic Performance: Modeling Time-Correlated Noise at Scale

Combining tensor network techniques with quantum autoregressive moving average models, we quantify the effects of time-correlated noise on quantum algorithms and predict their performance at scale. As a paradigmatic test case, we examine the quantum Fourier transformation. Building on our first technical result, which shows how stochastic tensor network calculations capture frequency correlations, our second result is the revelation that infidelity exponents (scaling from diffuse, to superdiffuse) are determined by the spectral features of the noise. This numerical result rigorously quantifies the common belief that the temporal correlation scale is a key predictive feature of noise's deleterious impact on multi-qubit circuits. To highlight prospects for predicting algorithmic performance, our third result quantifies how infidelity scaling exponents -- which are fits determined by training data at moderate scales (40-80 qubits) -- can be used to predict more computationally expensive simulation at larger scales (100-128 qubits). Aside from highlighting the scalability of our methods, this workflow feeds into our last result, which is the proposal of predictive benchmarking protocols connecting simulations to experiments. Our work paves the way for large-scale algorithmic simulations and performance prediction under hardware-relevant noise conditions informed by realistic device characteristics.

quant-ph↗

arXiv2025

Locally Purified Maximally Mixed States At Scale: Entanglement Pruning and Symmetries

Locally Purified Density Operators (LPDOs) are state-of-the-art tensor network ansatze candidates that efficiently represent mixed quantum states at scale. However, given their non-uniqueness, their representational complexity is generally sub-optimal in practical computations. In this work we perform a comprehensive numerical and analytical analysis and resolve this issue in the experimentally relevant limit where noise depolarizes the density operator into a maximally mixed state. To resolve the sub-optimality issue, we analyze two numerical tools, one analytic method, and detail the relations between them. The numerical tools used are fidelity-preserving truncations and isometric gauge transformations leveraging Riemannian optimizations over entropic objective functions. In addition, by invoking the injectivity and symmetry constraints of the maximally mixed LPDO, we also present analytical closed-form expressions for the disentangler and discuss their relation to numerical optimizers. Further, away from the maximally mixed state, our simulations highlight how the truncation threshold smoothly interpolate, as a function of depolarization, between established matrix product results and our new results. Our work shows how, by minimizing the resources required to represent key states of practical interest in experiment, the efficiency of tensor network algorithms can be substantially increased. This paves the path for uncovering tensor network's fundamental scalability limits and latent potential in representing the wide locus of mixed quantum states that are accessible on near-term quantum devices.

quant-ph↗

arXiv2025

Gauge-Fixing Quantum Density Operators At Scale

We provide theory, algorithms, and simulations of non-equilibrium quantum systems using a one-dimensional (1D) completely-positive (CP), matrix-product (MP) density-operator ($ρ$) representation. By generalizing the matrix product state's orthogonality center, to additionally store positive classical mixture correlations, the MP$ρ$ factorization naturally emerges. In this work we analytically and numerically examine the virtual freedoms associated with the representation of quantum density operators. Using this augmented perspective, we simplify algorithms in certain limits to integrate the canonical form's master equation dynamics. This enables us to quickly evolve under the dynamics of two-body quantum channels without resorting to optimization-based methods. In addition to this technical advance, we also scale-up numerical examples and discuss implications for accurately modeling hardware architectures and predicting their performance. This includes an example of the quantum to classical transition of informationally leaky, i.e., decohering, qubits. In this setting, due to loss from environmental interactions, non-local complex coherence correlations are converted into global incoherent classical statistical mixture correlations. Lastly, the representation of both global and local correlations is discussed. We expect this work to have applications in additional non-equilibrium settings, beyond qubit engineering.

quant-ph↗

arXiv2025

Comparing performance of variational quantum algorithm simulations on HPC systems

Variational quantum algorithms are of special importance in the research on quantum computing applications because of their applicability to current Noisy Intermediate-Scale Quantum (NISQ) devices. The main building blocks of these algorithms (among them, the definition of the Hamiltonian and of the ansatz, the optimizer) define a relatively large parameter space, making the comparison of results and performance between different approaches and software simulators cumbersome and prone to errors. In this paper, we employ a generic description of the problem, in terms of both Hamiltonian and ansatz, to port a problem definition consistently among different simulators. Three use cases of relevance for current quantum hardware (ground state calculation for the Hydrogen molecule, MaxCut, Travelling Salesman Problem) have been run on a set of HPC systems and software simulators to study the dependence of performance on the runtime environment, the scalability of the simulation codes and the mutual agreement of the physical results, respectively. The results show that our toolchain can successfully translate a problem definition between different simulators. On the other hand, variational algorithms are limited in their scaling by the long runtimes with respect to their memory footprint, so they expose limited parallelism to computation. This shortcoming is partially mitigated by using techniques like job arrays. The potential of the parser tool for exploring HPC performance and comparisons of results of variational algorithm simulations is highlighted.

quant-ph↗

arXiv2025

Efficient computation of topological order

We analyze the computational aspects of detecting topological order in a quantum many-body system. We contrast the widely used topological entanglement entropy with a recently introduced operational definition for topological order based on error correction properties, finding exponential scaling with the system size for the former and polynomial scaling for the latter. We exemplify our approach for a variant of the paradigmatic toric code model with mobile particles, finding that the error correction method allows to treat substantially larger system sizes. In particular, the phase diagram of the model can be successfully computed using error correction, while the topological entanglement entropy is too severely limited by finite size effects to obtain conclusive results. While we mainly focus on one-dimensional systems whose ground states can be expressed in terms of matrix product states, our strategy can be readily generalized to higher dimensions and systems out of equilibrium, even allowing for an efficient detection of topological order in current quantum simulation experiments.

quant-ph↗

arXiv2024

Benchmarking Quantum Computer Simulation Software Packages: State Vector Simulators

Rapid advances in quantum computing technology lead to an increasing need for software simulators that enable both algorithm design and the validation of results obtained from quantum hardware. This includes calculations that aim at probing regimes of quantum advantage, where a quantum computer outperforms a classical computer in the same task. High performance computing (HPC) platforms play a crucial role as today's quantum devices already reach beyond the limits of what powerful workstations can model, but a systematic evaluation of the individual performance of the many offered simulation packages is lacking so far. In this Technical Review, we benchmark several software packages capable of simulating quantum dynamics with a special focus on HPC capabilities. We develop a containerized toolchain for benchmarking a large set of simulation packages on a local HPC cluster using different parallelisation capabilities, and compare the performance and system size-scaling for three paradigmatic quantum computing tasks. Our results can help finding the right package for a given simulation task and lay the foundation for a systematic community effort to benchmark and validate upcoming versions of existing and also newly developed simulation packages.

quant-ph↗

arXiv2024

Kibble-Zurek mechanism and errors of gapped quantum phases

Kibble-Zurek mechanism relates the domain of non-equilibrium dynamics with the critical properties at equilibrium. It establishes a power law connection between non-equilibrium defects quenched through a continuous phase transition and the quench rate via the scaling exponent. We present a novel numerical scheme to estimate the scaling exponent wherein the notion of defects is mapped to errors, previously introduced to quantify a variety of gapped quantum phases. To demonstrate the versatility of our method we conduct numerical experiments across a broad spectrum of spin-half models hosting local and symmetry protected topological order. Furthermore, an implementation of the quench dynamics featuring a topological phase transition on a digital quantum computer is proposed to quantify the associated criticality.

quant-ph↗

arXiv2022

Learning of error statistics for the detection of quantum phases

We present a binary classifier based on neural networks to detect gapped quantum phases. By considering the errors on top of a suitable reference state describing the gapped phase, we show that a neural network trained on the errors can capture the correlation between the errors and can be used to detect the phase boundaries of the gapped quantum phase. We demonstrate the application of the method for matrix product state calculations for different quantum phases exhibiting local symmetry-breaking order, symmetry-protected topological order, and intrinsic topological order.

quant-ph↗

arXiv2021

An Operational Definition of Topological Order

The unrivaled robustness of topologically ordered states of matter against perturbations has immediate applications in quantum computing and quantum metrology, yet their very existence poses a challenge to our understanding of phase transitions. However, a comprehensive understanding of what actually constitutes topological order is still lacking. Here we show that one can interpret topological order as the ability of a system to perform topological error correction. We find that this operational approach corresponding to a measurable both lays the conceptual foundations for previous classifications of topological order and also leads to a successful classification in the hitherto inaccessible case of topological order in open quantum systems. We demonstrate the existence of topological order in open systems and their phase transitions to topologically trivial states. Our results demonstrate the viability of topological order in nonequilibrium quantum systems and thus substantially broaden the scope of possible technological applications.

cond-mat.str-el↗

arXiv2021

Error-correction properties of an interacting topological insulator

We analyze the phase diagram of a topological insulator model including antiferromagnetic interactions in the form of an extended Su-Schrieffer Heeger model. To this end, we employ a recently introduced operational definition of topological order based on the ability of a system to perform topological error correction. We show that the necessary error correction statistics can be obtained efficiently using a Monte-Carlo sampling of a matrix product state representation of the ground state wave function. Specifically, we identify two distinct symmetry-protected topological phases corresponding to two different fully dimerized reference states. Finally, we extend the notion of error correction to classify thermodynamic phases to those exhibiting local order parameters, finding a topologically trivial antiferromagnetic phase for sufficiently strong interactions.

cond-mat.str-el↗

arXiv2021

Topological Phase Transitions Induced by Varying Topology and Boundaries in the Toric Code

One of the important characteristics of topological phases of matter is the topology of the underlying manifold on which they are defined. In this paper, we present the sensitivity of such phases of matter to the underlying topology, by studying the phase transitions induced due to the change in the boundary conditions. We claim that these phase transitions are accompanied by broken symmetries in the excitation space and to gain further insight we analyze various signatures like the ground state degeneracy, topological entanglement entropy while introducing the open-loop operator whose expectation value effectively captures the phase transition. Further, we extend the analysis to an open quantum setup by defining effective collapse operators, the dynamics of which cool the system to different topologically ordered steady states. We show that the phase transition between such steady states is effectively captured by the expectation value of the open-loop operator.

cond-mat.str-el↗

arXiv2019

Quantum Zeno-based Detection and State Engineering of Ultracold Polar Molecules

We present and analyze a toolbox for the controlled manipulation of ultracold polar molecules, consisting of detection of molecules, atom-molecule entanglement, and engineering of dissipative dynamics. Our setup is based on fast chemical reactions between molecules and atoms leading to a quantum Zeno-based collisional blockade in the system. We demonstrate that the experimental parameters for achieving high fidelities can be found using a straightforward numerical optimization. We exemplify our approach for a system comprised of NaK molecules and Na atoms and we discuss the consequences of residual imperfections such as a finite strength of the quantum Zeno blockade.

cond-mat.quant-gas↗

arXiv2018

Robustness of Topological Order in the Toric Code with Open Boundaries

We analyze the robustness of topological order in the toric code in an open boundary setting in the presence of perturbations. The boundary conditions are introduced on a cylinder, and are classified into condensing and non-condensing classes depending on the behavior of the excitations at the boundary under perturbation. For the non-condensing class, we see that the topological order is more robust when compared to the case of periodic boundary conditions while in the condensing case topological order is lost as soon as the perturbation is turned on. In most cases, the robustness can be understood by the quantum phase diagram of a equivalent Ising model.

cond-mat.str-el↗