Coherent states bridge the gap between quantum and classical physics, but their overcomplete and nonorthogonal nature makes it difficult to identify the minimal discrete set needed to reconstruct quantum information. Finite spin-coherent tomography and discrete coherent-state operator bases are known, but here we address the more specific rank-resolved problem of preserving the canonical contravariant-symbol representation. We show that the canonical finite coherent-state formula reconstructs every operator in the rank-$S$ sector exactly if and only if the sampling points form a spherical $(2J+S)$-design. We call the associated configurations spin-coherent quantum designs. We further give a fully explicit positive-weight Gauss-Legendre construction that avoids the need for an equal-weight spherical design. Together, these results establish a unified framework for reading out physical observables from a handful of measurement samples, playing for spin systems the role that the so-called von Neumann lattice plays for canonical coherent states. Finally, we derive practical protocols for estimating moments of spin operators from these constructions, with direct applications to polarimetry, magnetometry, and quantum state tomography.
How a quantum state responds to small parameter changes underlies state distinguishability, many-body response, and metrological sensitivity. The Pauli probability spectrum provides a natural description of many-body quantum states, but it is not evident how much of this response survives in the corresponding classical...
This work introduces a unified measure, the magic R\'enyi entropy (MRE), to quantify computational resources in spins, bosons, and fermions on an equal footing and shows that the MRE is a resource monotone under stabilizer and Gaussian protocols involving measurements and feedforward operations.
Recent work introduced Interval Quantum Mechanics (IQM), a finite-precision framework in which physical information is represented by sets of possible states rather than exact states. We extend this approach to algebraic quantum field theory (AQFT) by introducing Interval Algebraic Quantum Field Theory (IAQFT), whose b...
Quantum computation has traditionally been formulated by postulating abstract information carriers and subsequently identifying physical systems that realize them. We adopt the opposite viewpoint and ask what computational structure is supplied by a fundamental relativistic quantum system itself. Focusing on the simple...
Quantum state tomography provides complete information about a quantum state, but its measurement cost generally grows exponentially with system size. In many-particle quantum simulators, this challenge is further compounded by the limited accessibility of local measurements and controls. Here we develop a tomography p...
Applying this framework to unstructured search, periodicity finding, and matrix arithmetic, Grover's algorithm, the quantum Fourier transform underlying Shor's algorithm, and quantum singular value transformation are reconstructed.
Masayuki Ohzeki· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.