Related papers: Estimating Non-Stabilizerness Dynamics Without Sim…
Iterative deblurring, notably the Richardson-Lucy algorithm with and without regularization, is analyzed in the context of nuclear and high-energy physics applications. In these applications, probability distributions may be discretized…
Constrained Differential Renormalization (CDR) and the constrained version of Implicit Regularization (IR) are two regularization independent techniques that do not rely on dimensional continuation of the space-time. These two methods which…
We study the effect of noise on the classical simulatability of quantum circuits defined by computationally tractable (CT) states and efficiently computable sparse (ECS) operations. Examples of such circuits, which we call CT-ECS circuits,…
Implicit regularization (IR) has been shown as an useful momentum space tool for perturbative calculations in dimension specific theories, such as chiral gauge, topological and supersymmetric quantum field theoretical models at one loop…
In quantum computing, the nonstabilizerness of quantum operations is crucial for understanding and quantifying quantum speedups. In this study, we explore the phenomena of nonstabilizerness of the quantum SWITCH, a novel structure that…
An experimental study of NMR spin decoherence in nematic liquid crystals (LC) is presented. Decoherence dynamics can be put in evidence by means of refocusing experiments of the dipolar interactions. The experimental technique used in this…
Quantum error mitigation techniques mimic noiseless quantum circuits by running several related noisy circuits and combining their outputs in particular ways. How well such techniques work is thought to depend strongly on how noisy the…
We consider the effects of weak measurements on the quantum critical ground state of the one-dimensional (a) tricritical and (b) critical quantum Ising model, by measuring in (a) the local energy and in (b) the local spin operator in a…
Quantum computing carries significant potential for addressing practical problems. However, currently available quantum devices suffer from noisy quantum gates, which degrade the fidelity of executed quantum circuits. Therefore, quantum…
Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators, acting on protected qubits, to be translated into physical operators (circuits) acting on physical quantum…
Nonstabilizerness, or magic, constitutes a fundamental resource for quantum computation and a crucial ingredient for quantum advantage. Recent progress has substantially advanced the characterization of magic in many-body quantum systems,…
Characterising quantum processes is a key task in and constitutes a challenge for the development of quantum technologies, especially at the noisy intermediate scale of today's devices. One method for characterising processes is randomised…
Achieving near-term quantum advantage will require accurate estimation of quantum observables despite significant hardware noise. For this purpose, we propose a novel, scalable error-mitigation method that applies to gate-based quantum…
Quantum impurities can host exotic many-body states that serve as sensitive probes of bath correlations. However, quantitative and non-perturbative methods for determining impurity thermodynamics in such settings remain scarce. Here, we…
We present a comprehensive and self-contained framework for the efficient classical simulation of Clifford circuits acting on $d$-dimensional qudits, including realistic Pauli/Weyl noise via stochastic simulation. Our approach uses the…
While there is strong evidence for advantages of quantum over classical computation, the repertoire of computational primitives with proven or conjectured quantum advantage remains limited. A big challenge of quantum algorithmic design is a…
Various algorithms have been developed to simulate quantum circuits on classical hardware. Among the most prominent are approaches based on \emph{stabilizer decompositions} and \emph{tensor network contraction}. In this work, we present a…
We give a new algorithm for computing the robustness of magic - a measure of the utility of quantum states as a computational resource. Our work is motivated by the magic state model of fault-tolerant quantum computation. In this model, all…
We start by studying the subgroup structures underlying stabilizer circuits and we use our results to propose a new normal form for stabilizer circuits. This normal form is computed by induction using simple conjugation rules in the…
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations to a universal set by the addition of `magic' quantum states. In this context, we develop a general…