Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Foundations of Physics

Compact quantum systems and the Pauli data problem

Anthony J. Bracken, Robert Fawcett

Published Feb 1, 1993• 0 citations
Publisher
DOI
10.1007/bf01883630

Related papers

Compact quantum systems

Robert Fawcett

•Jan 1, 1990•0 citations

PACOX: A FPGA-based Pauli Composer Accelerator for Pauli String Computation

Tran Xuan Hieu Le, Tuan Hai Vu, Vu Trung Duong Le +2 more

Pauli strings are a fundamental computational primitive in hybrid quantum-classical algorithms. However, classical computation of Pauli strings suffers from exponential complexity and quickly becomes a performance bottleneck as the number of qubits increases. To address this challenge, this paper proposes the Pauli Composer Accelerator (PACOX), the first dedicated FPGA-based accelerator for Pauli string computation. PACOX employs a compact binary encoding with XOR-based index permutation and phase accumulation. Based on this formulation, we design a parallel and pipelined processing element (PE) cluster architecture that efficiently exploits data-level parallelism on FPGA. Experimental results on a Xilinx ZCU102 FPGA show that PACOX operates at 250 MHz with a dynamic power consumption of 0.33 W, using 8,052 LUTs, 10,934 FFs, and 324 BRAMs. For Pauli strings of up to 19 qubits, PACOX consistently outperforms state-of-the-art CPU-based methods in terms of execution speed, while also requiring significantly less memory and achieving a much lower power-delay product. These results demonstrate that PACOX delivers high computational speed with superior energy efficiency for Pauli-based workloads in hybrid quantum-classical systems.

quant-pharXiv:2601.04827•IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS)•Jan 9, 2026•1 citation

Mathematical Problems of Large Quantum Systems

Jan Philip Solovej

•Jan 1, 2006•0 citations

On the relaxation to equilibrium of a quantum oscillator interacting with a radiation field

Pierre-A. Vuillermot

In this article we investigate from the point of view of spectral theory the problem of relaxation to thermodynamical equilibrium of a quantum harmonic oscillator interacting with a radiation field. Our starting point is a system of infinitely many Pauli master equations governing the time evolution of the occupation probabilities of the available quantum states. The system we consider is derived from the evolution equation for the reduced density operator obtained after the initial interaction of the oscillator with the radiation field, the latter acting as a heat bath. We provide a complete spectral analysis of the infinitesimal generator of the equations, showing thereby that it generates an infinite-dimensional system of hyperbolic type. This implies that every global solution to the equations converge exponentially rapidly toward the corresponding Gibbs equilibrium state. We also provide a complete spectral analysis of a linear pencil naturally associated with the Pauli equations. All of our considerations revolve around the notion of compactness, more specifically around the existence of a new compact embedding result involving a space of sequences of Sobolev type into a weighted space of square-integrable summable sequences.

arXiv:2404.11329•Communications in Mathematical Sciences•Jan 1, 2025•2 citations

Mathematical Problems of Large Quantum Systems

Ryszard Nest

•Nov 9, 2009•0 citations

Utility-Constrained Pauli–Weyl Randomization for Robust Quantum α-z Rényi Privacy

Nguyen Hoang Minh, Trung Hoa Dinh, Le Cong Trinh

Abstract Random-unitary noise is an implementable way to hide quantum information, since it can be realized by applying unitary gates sampled from a classical random key. However, the unconstrained minimization of pairwise quantum $\alpha$-$z$ R\'enyi divergences over all mixed-unitary channels is degenerate: the completely depolarizing channel is a Weyl average and maps every input state to $I_d/d$. This paper develops a non-erasing privacy--utility framework based on Pauli--Weyl randomization. For a finite protected ensemble $\mathcal{E}=\{\rho_1,\ldots,\rho_m\}$, a compact admissible set $K$ of Weyl probability distributions, and a fidelity-type utility threshold $\eta$, we study the robust radius $$R^\eta_{\alpha,z}(\mathcal{E};K) = \inf_{p\in K:\,\mathcal{U}_{\mathcal{E}}(\Phi_p)\ge\eta} \max_{i\ne j} D_{\alpha,z}\bigl(\Phi_p(\rho_i)\Vert\Phi_p(\rho_j)\bigr). $$ We prove well-posedness, a zero-radius characterization, and active-pair optimality conditions. The main exact result is a Pauli reduction theorem for equal-purity binary qubit ensembles: in adapted Bloch coordinates, optimization over all Pauli channels reduces to a two-parameter contraction problem separating the sensitive direction from the common direction. This yields an explicit two-eigenvalue formula for the reduced $\alpha$-$z$ divergence and a closed-form optimal mechanism on the fidelity line $\alpha=z=1/2$ for arbitrary pure binary qubit states. A complementary commuting result solves antipodal binary pairs throughout the data-processing region. For diagonal qudit ensembles, Weyl randomization reduces to cyclic convolution; the utility has a Fourier autocorrelation representation, and the minimax problem admits convex global formulations for $0<\alpha<1$ and $\alpha=2$. Finally, the radius is shown to be stable under post-processing and measurement, to imply binary discrimination bounds, and to support hardware-aware calibration certificates. MSC Classification: Primary 81P45 , 94A17; Secondary 81P50 , 47N50 , 49K35 , 90C25 ,90C30

•Jul 3, 2026•0 citations
Pauli strings are a fundamental computational primitive in hybrid quantum-classical algorithms. However, classical computation of Pauli strings suffers from exponential complexity and quickly becomes a performance bottleneck as the number of qubits increases. To address this challenge, this paper proposes the Pauli Composer Accelerator (PACOX), the first dedicated FPGA-based accelerator for Pauli string computation. PACOX employs a compact binary encoding with XOR-based index permutation and phase accumulation. Based on this formulation, we design a parallel and pipelined processing element (PE) cluster architecture that efficiently exploits data-level parallelism on FPGA. Experimental results on a Xilinx ZCU102 FPGA show that PACOX operates at 250 MHz with a dynamic power consumption of 0.33 W, using 8,052 LUTs, 10,934 FFs, and 324 BRAMs. For Pauli strings of up to 19 qubits, PACOX consistently outperforms state-of-the-art CPU-based methods in terms of execution speed, while also requiring significantly less memory and achieving a much lower power-delay product. These results demonstrate that PACOX delivers high computational speed with superior energy efficiency for Pauli-based workloads in hybrid quantum-classical systems.
In this article we investigate from the point of view of spectral theory the problem of relaxation to thermodynamical equilibrium of a quantum harmonic oscillator interacting with a radiation field. Our starting point is a system of infinitely many Pauli master equations governing the time evolution of the occupation probabilities of the available quantum states. The system we consider is derived from the evolution equation for the reduced density operator obtained after the initial interaction of the oscillator with the radiation field, the latter acting as a heat bath. We provide a complete spectral analysis of the infinitesimal generator of the equations, showing thereby that it generates an infinite-dimensional system of hyperbolic type. This implies that every global solution to the equations converge exponentially rapidly toward the corresponding Gibbs equilibrium state. We also provide a complete spectral analysis of a linear pencil naturally associated with the Pauli equations. All of our considerations revolve around the notion of compactness, more specifically around the existence of a new compact embedding result involving a space of sequences of Sobolev type into a weighted space of square-integrable summable sequences.
Abstract Random-unitary noise is an implementable way to hide quantum information, since it can be realized by applying unitary gates sampled from a classical random key. However, the unconstrained minimization of pairwise quantum α\alphaα-zzz R\'enyi divergences over all mixed-unitary channels is degenerate: the completely depolarizing channel is a Weyl average and maps every input state to Id/dI_d/dId​/d. This paper develops a non-erasing privacy--utility framework based on Pauli--Weyl randomization. For a finite protected ensemble E={ρ1,…,ρm}\mathcal{E}=\{\rho_1,\ldots,\rho_m\}E={ρ1​,…,ρm​}, a compact admissible set KKK of Weyl probability distributions, and a fidelity-type utility threshold η\etaη, we study the robust radius Rα,zη(E;K)=inf⁡p∈K: UE(Φp)≥ηmax⁡i≠jDα,z(Φp(ρi)∥Φp(ρj)).R^\eta_{\alpha,z}(\mathcal{E};K) = \inf_{p\in K:\,\mathcal{U}_{\mathcal{E}}(\Phi_p)\ge\eta} \max_{i\ne j} D_{\alpha,z}\bigl(\Phi_p(\rho_i)\Vert\Phi_p(\rho_j)\bigr). Rα,zη​(E;K)=infp∈K:UE​(Φp​)≥η​maxi=j​Dα,z​(Φp​(ρi​)∥Φp​(ρj​)). We prove well-posedness, a zero-radius characterization, and active-pair optimality conditions. The main exact result is a Pauli reduction theorem for equal-purity binary qubit ensembles: in adapted Bloch coordinates, optimization over all Pauli channels reduces to a two-parameter contraction problem separating the sensitive direction from the common direction. This yields an explicit two-eigenvalue formula for the reduced α\alphaα-zzz divergence and a closed-form optimal mechanism on the fidelity line α=z=1/2\alpha=z=1/2α=z=1/2 for arbitrary pure binary qubit states. A complementary commuting result solves antipodal binary pairs throughout the data-processing region. For diagonal qudit ensembles, Weyl randomization reduces to cyclic convolution; the utility has a Fourier autocorrelation representation, and the minimax problem admits convex global formulations for 0<α<10<\alpha<10<α<1 and α=2\alpha=2α=2. Finally, the radius is shown to be stable under post-processing and measurement, to imply binary discrimination bounds, and to support hardware-aware calibration certificates. MSC Classification: Primary 81P45 , 94A17; Secondary 81P50 , 47N50 , 49K35 , 90C25 ,90C30