THE QUANTUM HALL EFFECT AND COORDINATE–FREE QUANTIZATION

Ying-Hai Wu, Bo Yang, Zlatko Papić

Wolfgang Ketterle

Zhen-Lai Wang, Xiang-Song Chen

We present a novel fundamental effect that for the matter waves the space-averaging free-fall point of quantum particles undergoes a spin-dependent transverse shift in the gravitational field of Earth. This effect is similar to the geometric spin Hall effect (GSHE) [Aiello et al., Phys. Rev. Lett. 103, 100401 (2009)] and can be called gravity-induced GSHE. This effect suggests that there might be violations of the universality of free fall (UFF) or weak equivalence principle (WEP) in the quantum domain.

Zhen-Lai Wang, Xiang-Song Chen

We present a novel fundamental effect that for the matter waves the space-averaging free-fall point of quantum particles undergoes a spin-dependent transverse shift in the gravitational field of Earth. This effect is similar to the geometric spin Hall effect (GSHE) [Aiello et al., Phys. Rev. Lett. 103, 100401 (2009)] and can be called gravity-induced GSHE. This effect suggests that there might be violations of the universality of free fall (UFF) or weak equivalence principle (WEP) in the quantum domain.

Iain Burge, Michel Barbeau, Joaquín García-Alfaro

This work introduces a quantum algorithm for computing the function arcsine, with arbitrary accuracy. We leverage a technique from embedded computing and field-programmable gate arrays, called COordinate Rotation DIgital Computer (CORDIC). CORDIC is a family of iterative algorithms that, in a classical context, can approximate various trigonometric, hyperbolic, and elementary functions using only bit shifts and additions. Adapting CORDIC to the quantum context is non-trivial, as the algorithm traditionally uses several non-reversible operations. We detail a method for CORDIC that avoids such non-reversible operations. We propose an approach to calculate the arcsine function reversibly with CORDIC. For n bits of precision, our method has space complexity of order n qubits, a layer count in the order of n times log n, and a CNOT count in the order of n squared. This primitive function is a required step for the Harrow-Hassidim-Lloyd (HHL) algorithm, is necessary for quantum digital-to-analog conversion, can simplify a quantum speed-up for Monte-Carlo methods, and has direct applications in the quantum estimation of Shapley values.