Related papers: Estimating Non-Stabilizerness Dynamics Without Sim…
Classical simulation of quantum circuits plays a crucial role in validating quantum hardware and delineating the boundaries of quantum advantage. Among the most effective simulation techniques are those based on the stabilizer extent, which…
In this paper, we study the problem of learning an unknown quantum circuit of a certain structure. If the unknown target is an $n$-qubit Clifford circuit, we devise an efficient algorithm to reconstruct its circuit representation by using…
Non-stabilizerness - also colloquially referred to as magic - is the a resource for advantage in quantum computing and lies in the access to non-Clifford operations. Developing a comprehensive understanding of how non-stabilizerness can be…
This paper discusses discretization methods for implementing nonlinear model predictive controllers using Iterative Linear Quadratic Regulator (ILQR). Finite-difference approximations are mostly used to derive a discrete-time state equation…
Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for…
We develop a general approach to the nonequilibrium dynamics of quantum impurity systems for arbitrary coupling strength. The numerical renormalization group is used to generate a complete basis set necessary for the correct description of…
Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic…
Achieving near-term quantum advantage will require effective methods for mitigating hardware noise. Data-driven approaches to error mitigation are promising, with popular examples including zero-noise extrapolation (ZNE) and Clifford data…
The nonstabilizerness, or magic, is an essential quantum resource to perform universal quantum computation. Robustness of magic (RoM) in particular characterizes the degree of usefulness of a given quantum state for non-Clifford operation.…
We investigate the emergence of quantum complexity and chaos in doped Clifford circuits acting on qudits of odd prime dimension $d$. Using doped Clifford Weingarten calculus and a replica tensor network formalism, we derive exact results…
This article proposes a Graph Neural Network (GNN) approach to estimate nonstabilizerness in quantum circuits, measured by the stabilizer R\'enyi entropy (SRE). Nonstabilizerness is a fundamental resource for quantum advantage, and…
One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms…
We present an initialisation method for variational quantum algorithms applicable to intermediate scale quantum computers. The method uses simulated annealing of the efficiently simulable Clifford parameter points as a pre-optimisation to…
Quantum magic, or non-stabilizerness, is an important quantum resource that characterizes computational power beyond classically simulable Clifford operations and is therefore essential for achieving quantum advantage. While previous…
We introduce a novel hybrid approach combining tensor network methods with the stabilizer formalism to address the challenges of simulating many-body quantum systems. By integrating these techniques, we enhance our ability to accurately…
Chaotic behavior of quantum systems can be characterized by the adherence of the expectation values of given probes to moments of the Haar distribution. In this work, we analyze the behavior of several probes of chaos using a technique…
We analyze quantum mechanical systems using the non-perturbative renormalization group (NPRG). The NPRG method enables us to calculate quantum corrections systematically and is very effective for studying non-perturbative dynamics. We start…
We show that states obtained from deep random Clifford circuits doped with non-Clifford phase gates (including T-gates and $\sqrt{\mathrm{T}}$-gates) can be disentangled completely, provided the number of non-Clifford gates is smaller or…
Quantum simulation of fermionic Hamiltonians is a leading application of quantum computing, but accurate execution on present-day hardware is limited by error accumulation in deep Trotter circuits. We present a device-matched…
Clifford noise reduction (CliNR) is a partial error correction scheme that reduces the logical error rate of Clifford circuits at the cost of a modest qubit and gate overhead. The CliNR implementation of an $n$-qubit Clifford circuit of…