SearcharxivSearch

arXiv · 2010.15783

On construction of finite averaging sets for $SL(2, \mathbb{C})$ via its Cartan decomposition

Abstract

Averaging physical quantities over Lie groups appears in many contexts across the rapidly developing branches of physics like quantum information science or quantum optics. Such an averaging process can be always represented as averaging with respect to a finite number of elements of the group, called a finite averaging set. In the previous research such sets, known as $t$-designs, were constructed only for the case of averaging over unitary groups (hence the name unitary $t$-designs). In this work we investigate the problem of constructing finite averaging sets for averaging over general non-compact matrix Lie groups, which is much more subtle task due to the fact that the the uniform invariant measure on the group manifold (the Haar measure) is infinite. We provide a general construction of such sets based on the Cartan decomposition of the group, which splits the group into its compact and non-compact components. The averaging over the compact part can be done in a uniform way, whereas the averaging over the non-compact one has to be endowed with a suppresing weight function, and can be approached using generalised Gauss quadratures. This leads us to the general form of finite averaging sets for semisimple matrix Lie groups in the product form of finite averaging sets with respect to the compact and non-compact parts. We provide an explicit calculation of such sets for the group $SL(2, \mathbb{C})$, although our construction can be applied to other cases. Possible applications of our results cover finding finite ensambles of random operations in quantum information science and quantum optics, which can be used in constructions of randomised quantum algorithms, including optical interferometric implementations.

Explore related subjects

Keep this discovery

BibTeXRIS

Marcin Markiewicz, Janusz Przewocki. 2020-10-29. On construction of finite averaging sets for $SL(2, \mathbb{C})$ via its Cartan decomposition. https://doi.org/10.1088/1751-8121%2Fabfa44

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph