SearcharxivSearch

arXiv · 2310.17150

Generating a 4-photon Tetrahedron State: Towards Simultaneous Super-sensitivity to Non-commuting Rotations

Abstract

It is often thought that the super-sensitivity of a quantum state to an observable comes at the cost of a decreased sensitivity to other non-commuting observables. For example, a squeezed state squeezed in position quadrature is super-sensitive to position displacements, but very insensitive to momentum displacements. This misconception was cleared with the introduction of the compass state, a quantum state equally super-sensitive to displacements in position and momentum. When looking at quantum states used to measure spin rotations, N00N states are known to be more advantageous than classical methods as long as they are aligned to the rotation axis. When considering the estimation of a rotation with unknown direction and amplitude, a certain class of states stands out with interesting properties. These states are equally sensitive to rotations around any axis, are second-order unpolarized, and can possess the rotational properties of platonic solids in particular dimensions. Importantly, these states are optimal for simultaneously estimating the three parameters describing a rotation. In the asymptotic limit, estimating all d parameters describing a transformation simultaneously rather than sequentially can lead to a reduction of the appropriately-weighted sum of the measured parameters' variances by a factor of d. We report the experimental creation and characterization of the lowest-dimensional such state, which we call the "tetrahedron state" due to its tetrahedral symmetry. This tetrahedron state is created in the symmetric subspace of four optical photons' polarization in a single spatial and temporal mode, which behaves as a spin-2 particle. While imperfections due to the hardware limit the performance of our method, we argue that better technology can improve our method to the point of outperforming any other existing strategy in per-photon comparisons.

Explore related subjects

Keep this discovery

BibTeXRIS

Hugo Ferretti, Y. Batuhan Yilmaz, Kent Bonsma-Fisher, Aaron Z. Goldberg, Noah Lupu-Gladstein, Arthur O. T. Pang, Lee A. Rozema, Aephraim M. Steinberg. 2023-10-26. Generating a 4-photon Tetrahedron State: Towards Simultaneous Super-sensitivity to Non-commuting Rotations. https://doi.org/10.1364/opticaq.510125

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