NMR implementations of Gauss sums
英文摘要：
I describe the use of NMR experiments which implement Gauss sums as a method for factoring numbers and discuss whether this approach can be computationally useful.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
NMR experiment factors numbers with Gauss sums
We factor the number 157573 using an NMR implementation of Gauss sums.
quant-ph
Comment on "NMR Experiment Factors Numbers with Gauss Sums"
Mehring et al. have recently described an elegant nuclear magnetic resonance (NMR) experiment implementing an algorithm to factor numbers based on the properties of Gauss sums. Similar experiments have also been described by Mahesh et al. In fact these algorithms do not factor numbers directly, but rather check whether a trial integer $\ell$ is a factor of a given integer $N$. Here I show that these NMR schemes cannot be used for factor checking without first implicitly determining whether or not $\ell$ is a factor of $N$.
quant-ph
Factorizing Numbers with the Gauss Sum Technique: NMR Implementations
Several physics-based algorithms for factorizing large number were recently published. A notable recent one by Schleich et al. uses Gauss sums for distinguishing between factors and non-factors. We demonstrate two NMR techniques that evaluate Gauss sums and thus implement their algorithm. The first one is based on differential excitation of a single spin magnetization by a cascade of RF pulses. The second method is based on spatial averaging and selective refocusing of magnetization for Gauss sums corresponding to factors. All factors of 16637 and 52882363 are successfully obtained.
quant-ph
Factorization of numbers with Gauss sums: III. Algorithms with Entanglement
We propose two algorithms to factor numbers using Gauss sums and entanglement: (i) in a Shor-like algorithm we encode the standard Gauss sum in one of two entangled states and (ii) in an interference algorithm we create a superposition of Gauss sums in the probability amplitudes of two entangled states.These schemes are rather efficient provided that there exists a fast algorithm that can detect a period of a function hidden in its zeros.
quant-ph
Factorization of numbers with Gauss sums: I. Mathematical background
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and scales exponentially.
quant-ph
Factorization of numbers with truncated Gauss sums at rational arguments
Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a one-to-one relationship. As a result the identification of factors by the maxima is unique. However, for non-integer arguments such as rational numbers this powerful instrument to find factors breaks down. We develop new strategies for factoring numbers using Gauss sums at rational arguments. This approach may find application in a recent suggestion to factor numbe…
quant-ph
更多相关论文收起更多论文
An angular momentum approach to quadratic Fourier transform, Hadamard matrices, Gauss sums, mutually unbiased bases, unitary group and Pauli group
The construction of unitary operator bases in a finite-dimensional Hilbert space is reviewed through a nonstandard approach combinining angular momentum theory and representation theory of SU(2). A single formula for the bases is obtained from a polar decomposition of SU(2) and analysed in terms of cyclic groups, quadratic Fourier transforms, Hadamard matrices and generalized Gauss sums. Weyl pairs, generalized Pauli operators and their application to the unitary group and the Pauli group naturally arise in this approach.
quant-ph
New factorization algorithm based on a continuous representation of truncated Gauss sums
In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a single run without precalculating the ratio N/l, where l are all the possible trial factors. Continuous truncated exponential sums turn out to be a powerful tool for distinguishing factors from non-factors (we also suggest, with regard to this topic, to read an interesting paper by S. Woelk et al. also published in this issue [Woelk, Feiler, Schleich, J. Mod. …
quant-ph
Equientangled Bases in Arbitrary Dimensions and Quadratic Gauss Sums
Recently [Karimipour and Memarzadeh, PhysRevA 73, 012329 (2006)] posed the problem of finding a continuous family of orthonormal bases in a bipartite space of two identical systems with the following properties: i) in each basis, all states have to be equally entangled, and ii) the family continuously interpolate between the product basis and the maximally entangled basis. The authors provided a necessary condition and simple examples for relatively small dimensions, but questioned the existence of a general solution for arbitrary dimensions. Employing the properties of quadratic Gauss sums, w…
quant-ph
Factorization of numbers with Gauss sums: II. Suggestions for implementations with chirped laser pulses
We propose three implementations of the Gauss sum factorization schemes discussed in part I of this series: (i) a two-photon transition in a multi-level ladder system induced by a chirped laser pulse, (ii) a chirped one-photon transition in a two-level atom with a periodically modulated excited state, and (iii) a linearly chirped one-photon transition driven by a sequence of ultrashort pulses. For each of these quantum systems we show that the excitation probability amplitude is given by an appropriate Gauss sum. We provide rules how to encode the number N to be factored in our system and how …
quant-ph
Classical simulation of quantum circuits by half Gauss sums
We give an efficient algorithm to evaluate a certain class of exponential sums, namely the periodic, quadratic, multivariate half Gauss sums. We show that these exponential sums become $\#\mathsf{P}$-hard to compute when we omit either the periodicity or quadraticity condition. We apply our results about these exponential sums to the classical simulation of quantum circuits, and give an alternative proof of the Gottesman-Knill theorem. We also explore a connection between these exponential sums and the Holant framework. In particular, we generalize the existing definition of affine signatures …
math-phmath.MPquant-ph
Mutually unbiased phase states, phase uncertainties, and Gauss sums
Mutually unbiased bases (MUBs), which are such that the inner product between two vectors in different orthogonal bases is a constant equal to 1/sqrt{d), with d the dimension of the finite Hilbert space, are becoming more and more studied for applications such as quantum tomography and cryptography, and in relation to entangled states and to the Heisenberg-Weil group of quantum optics. Complete sets of MUBs of cardinality d+1 have been derived for prime power dimensions d=p^m using the tools of abstract algebra. Presumably, for non prime dimensions the cardinality is much less. Here we reinter…
quant-ph
Circulant matrices, gauss sums and mutually unbiased I. The prime number case
In this paper, we consider the problem of Mutually Unbiased Bases in prime dimension $d$. It is known to provide exactly $d+1$ mutually unbiased bases. We revisit this problem using a class of circulant $d \times d$ matrices. The constructive proof of a set of $d+1$ mutually unbiased bases follows, together with a set of properties of Gauss sums, and of bi-unimodular sequences.
math-phmath.MPquant-ph
Efficient Quantum Algorithms for Estimating Gauss Sums
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction from the discrete logarithm problem to Gauss sum estimation we also give evidence that this problem is hard for classical algorithms. The workings of the quantum algorithm rely on the interaction between the additive characters of the Fourier transform and the multiplicative characters of the Gauss sum.
cs.DMmath.NTquant-ph
Chirped quasi-phase-matching with Gauss sums for production of biphotons
We study the theory of linearly chirped biphoton wave-packets produced in two basic quasi-phase-matching configurations: chirped photonic-like crystals and aperiodically poled crystals. The novelty is that these structures are considered as definite assembles of nonlinear layers that leads to detailed description of spontaneous parametric down-conversion (SPDC) processes through the discrete Gauss sums. We demonstrate that biphoton spectra for chirped photonic crystals involving a small number of layers consist from definite well-resolved spectral lines. We also discuss the forming of broadban…
physics.opticsquant-ph
Gauss Sums and Quantum Mechanics
By adapting Feynman's sum over paths method to a quantum mechanical system whose phase space is a torus, a new proof of the Landsberg-Schaar identity for quadratic Gauss sums is given. In contrast to existing non-elementary proofs, which use infinite sums and a limiting process or contour integration, only finite sums are involved. The toroidal nature of the classical phase space leads to discrete position and momentum, and hence discrete time. The corresponding `path integrals' are finite sums whose normalisations are derived and which are shown to intertwine cyclicity and discreteness to giv…
math-phmath.MPmath.NT
Superpositions of coherent states determined by Gauss sums
We describe a family of quantum states of the Schrödinger cat type as superpositions of the harmonic oscillator coherent states with coefficients defined by the quadratic Gauss sums. These states emerge as eigenfunctions of the lowering operators obtained after canonical transformations of the Heisenberg-Weyl algebra associated with the ordinary and fractional Fourier transformation. The first member of this family is given by the well known Yurke-Stoler coherent state.
math-phmath.CAmath.MP
Construction of Equientangled Bases in Arbitrary Dimensions via Quadratic Gauss Sums and Graph States
Recently [Karimipour and Memarzadeh, Phys. Rev. A 73, 012329 (2006)] studied the problem of finding a family of orthonormal bases in a bipartite space each of dimension $D$ with the following properties: (i) The family continuously interpolates between the product basis and the maximally entangled basis as some parameter $t$ is varied, and (ii) for a fixed $t$, all basis states have the same amount of entanglement. The authors derived a necessary condition and provided explicit solutions for $D \leq 5$ but the existence of a solution for arbitrary dimensions remained an open problem. We prove …
math-phmath.MPquant-ph
Quantum phase uncertainty in mutually unbiased measurements and Gauss sums
Mutually unbiased bases (MUBs), which are such that the inner product between two vectors in different orthogonal bases is constant equal to the inverse $1/\sqrt{d}$, with $d$ the dimension of the finite Hilbert space, are becoming more and more studied for applications such as quantum tomography and cryptography, and in relation to entangled states and to the Heisenberg-Weil group of quantum optics. Complete sets of MUBs of cardinality $d+1$ have been derived for prime power dimensions $d=p^m$ using the tools of abstract algebra (Wootters in 1989, Klappenecker in 2003). Presumably, for non pr…
math-phmath.MPquant-ph
