Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.16871

Direct polarisation-state reconstruction with a temporal pointer: accessible states, resolution and optimal coupling

Shane P. Gervais·Lambert Giner
View original source ↗Read source document ↗Export metadata ↓

Abstract

Weak measurements are used to amplify small signals, to address foundational questions, and to characterise quantum states without tomography. In direct state reconstruction each amplitude of the state vector is proportional to a single complex weak value, which for a temporal pointer is read from the mean arrival time and the mean frequency of the postselected pulse. Such an experiment requires three quantities to be fixed, the coupling, the angular resolution demanded of the reconstruction, and the set of states over which the method remains usable, and these are commonly set by the available apparatus rather than derived. We derive all three for a Gaussian temporal pointer and an arbitrary postselection state. The states that cannot be reconstructed form a spherical cap centred on the state orthogonal to the postselection, whose geodesic half-angle follows from the largest of three independent thresholds and involves no adjustable parameter. Two states are distinguishable only if they differ by more than a minimal step fixed by the coupling, by the number of incident photons and by the sensitivity of the weak value along the path followed. For an inversion at first order in the coupling the systematic and statistical errors are opposed and fix an optimal coupling that varies as the inverse sixth root of the number of incident photons, whereas an exact inversion at finite coupling removes the systematic error, the remaining bound being one on the two-centroid readout rather than on the inversion, since below an amplitude equal to a quarter of the coupling two states give the same pair of centroids while their profiles differ. These results allow a direct reconstruction experiment to be dimensioned before the apparatus is assembled.

Explore related subjects

quant-phphysics.optics

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shane P. Gervais, Lambert Giner. 2026-10-12. Direct polarisation-state reconstruction with a temporal pointer: accessible states, resolution and optimal coupling. https://arxiv.org/abs/2610.16871

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

KEEP EXPLORING

Related papers

arXiv2026

All you need is Trotter

The work here enables a cost scaling of $\tilde{O}\left( \frac{T ^{1+o(1)}\,{\rm log}^2 (1/ε)}{\varepsilon}\right)$ and maximum depth $\tilde{O}\left( \frac{T^{1+o(1)}\,{\rm log} (1/ε)}{\varepsilon}\right)$ for estimating observables after some Hamiltonian evolution $e^{i H T}$ using no extra block-encoding qubits, where $ε$ is the algorithmic error of the target Hamiltonian evolution and $\varepsilon$ is the statistical error from the observable estimation. Throughout, $\tilde{O}$ suppresses factors that are doubly logarithmic in $1/ε$ (i.e. ${\rm polyloglog}(1/ε)$), which are subdominant to the displayed ${\rm polylog}(1/ε)$ factors. This is achieved through product formulas, stable interpolation (Chebyshev), and to calculate the needed fractional queries, cardinal sine interpolation is used. This is an improvement over similar work using interpolation methods which have a superlinear scaling of the form $5^p T^{1+1/p}$, where $p$ is the order of the product formula used and an improvement on required qubits over Quantum Signal Processing methods while maintaining scaling with ${\rm polylog}{1/ε}$. This is accomplished through an optimized and variable (with $T$) order $p$. The slightly better $\log^2(1/ε)$ compared to $\log^3(1/ε)$ comes from the use of cardinal sine interpolation compared to other methods using Chebyshev interpolation and product formulas. The work presented here also provides an alternative to Quantum Signal Processing techniques to calculate observables or amplitudes after a fractional query evolution with a cost $O(T\log{1/ε})$ through this cardinal sine interpolation.

quant-ph↗
arXiv2026

Noncontextuality inequalities for prepare-transform-measure scenarios

We provide the first systematic technique for deriving witnesses of contextuality in prepare-transform-measure scenarios. More specifically, we show how linear quantifier elimination can be used to compute a polytope of correlations consistent with generalized noncontextuality in such scenarios. This polytope is specified as a set of noncontextuality inequalities that are necessary and sufficient conditions for observed data in the scenario to admit of a classical explanation relative to any linear operational identities, if one ignores some constraints from diagram preservation. While including these latter constraints generally leads to tighter inequalities, it seems that nonlinear quantifier elimination would be required to systematically include them. We also provide a linear program which can certify the nonclassicality of a set of numerical data arising in a prepare-transform-measure experiment. We apply our results to get a robust noncontextuality inequality for transformations that can be violated within the stabilizer subtheory. Finally, we give a simple algorithm for computing all the linear operational identities holding among a given set of states, of transformations, or of measurements.

quant-ph↗
arXiv2026

A General Framework for Gradient-Based Optimization of Superconducting Quantum Circuits using Qubit Discovery as a Case Study

Engineering the Hamiltonian of a quantum system is fundamental to the design of quantum systems. Automating Hamiltonian design through gradient-based optimization can dramatically accelerate this process. However, computing the gradients of eigenvalues and eigenvectors of a Hamiltonian--a large, sparse matrix--relative to system properties poses a significant challenge, especially for arbitrary systems. Superconducting quantum circuits offer substantial flexibility in Hamiltonian design, making them an ideal platform for this task. In this work, we present a comprehensive framework for the gradient-based optimization of superconducting quantum circuits, leveraging the SQcircuit software package. By addressing the challenge of calculating the gradient of the eigensystem for large, sparse Hamiltonians and integrating automatic differentiation within SQcircuit, our framework enables efficient and precise computation of gradients for various circuit properties or custom-defined metrics, streamlining the optimization process. We apply this framework to the qubit discovery problem, demonstrating its effectiveness in identifying qubit designs with superior performance metrics. The optimized circuits show improvements in a heuristic measure of gate count, upper bounds on gate speed, decoherence time, and resilience to noise and fabrication errors compared to existing qubits. While this methodology is showcased through qubit optimization and discovery, it is versatile and can be extended to tackle other optimization challenges in superconducting quantum hardware design.

quant-ph↗