Related papers: The principle of majorization: application to rand…
Higher-order networks with multiway interactions can exhibit collective dynamical phenomena that are absent in traditional pairwise network models. However, analyzing such dynamics becomes computationally prohibitive as their state space…
Randomized protocols are procedures that incorporate probabilistic choices during their execution and they play a central role in quantum algorithms, spanning Hamiltonian simulation, noise mitigation, and measurement tasks. In practical…
The compression of quantum circuits is a foundational challenge for near-term quantum computing, yet the principles governing circuit stability remain poorly understood. We investigate this problem through a large-scale numerical analysis…
Quantum state discrimination plays a central role in defining the possible and impossible operations through a restricted class of quantum operations. A seminal result by Bennett et al. [Phys. Rev. A 59, 1070 (1999)] demonstrates the…
Circuit quantization links a physical circuit to its corresponding quantum Hamiltonian. The standard quantization procedure generally assumes any external magnetic flux to be static. Time dependence naturally arises, however, when flux is…
This paper studies majorization of high tensor powers of finitely supported probability distributions. Viewing probability distributions as a resource with majorization as a means of transformation corresponds to the resource theory of pure…
We aim to establish a scalable scheme for characterising diagonal non-Clifford gates for single- and multi-qudit systems; \(d\) is a prime-power integer. By employing cyclic operators and a qudit T gate, we generalise the dihedral…
We study the asymptotic behaviour of random factorizations of the $n$-cycle into transpositions of fixed genus $g>0$. They have a geometric interpretation as branched covers of the sphere and their enumeration as Hurwitz numbers was…
We introduce and study a generalization of majorization called relative submajorization and show that it has many applications to the resource theories of thermodynamics, bipartite entanglement, and quantum coherence. In particular, we show…
In randomized benchmarking of quantum logical gates, partial twirling can be used for simpler implementation, better scaling, and higher accuracy and reliability. For instance, for two-qubit gates, single-qubit twirling is easier to realize…
Digital quantum simulation is a promising application for quantum computers. Their free programmability provides the potential to simulate the unitary evolution of any many-body Hamiltonian with bounded spectrum by discretizing the time…
Mid-circuit measurements and measurement-controlled gates are supported by an increasing number of quantum hardware platforms and will become more relevant as an essential building block for quantum error correction. However, mid-circuit…
We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in $d \geq 2$ dimensions. Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be…
We describe and expand upon the scalable randomized benchmarking protocol proposed in Phys. Rev. Lett. 106, 180504 (2011) which provides a method for benchmarking quantum gates and estimating the gate-dependence of the noise. The protocol…
We consider a random time evolution operator composed of a circuit of random unitaries coupling even and odd neighboring spins on a chain in turn. In spirit of Floquet evolution, the circuit is time-periodic; each timestep is repeated with…
We study the amount of interference in random quantum algorithms using a recently derived quantitative measure of interference. To this end we introduce two random circuit ensembles composed of random sequences of quantum gates from a…
Advancements in quantum computing have spurred significant interest in harnessing its potential for speedups over classical systems. However, noise remains a major obstacle to achieving reliable quantum algorithms. In this work, we present…
We construct a gate and time-independent noise model that results in the output of a logical randomized benchmarking protocol oscillating rather than decaying exponentially. To illustrate our idea, we first construct an example in standard…
We study the $k$-core of a random (multi)graph on $n$ vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50--62] we used properties of empirical distributions of independent random variables…
With the help of a smooth scaling and coarse-graining approach of observables, developed recently by us in the context of so-called fluctuation operators (inspired by prior work of Verbeure et al) we perform a rigorous renormalisation group…