Related papers: Ghost factors in Gauss-sum factorization with tran…
Finding the factors of an integer can be achieved by various experimental techniques, based on an algorithm developed by Schleich et al., which uses specific properties of Gau\ss{}sums. Experimental limitations usually require truncation of…
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…
The two-photon ghost interference experiment, generalized to the case of massive particles, is theoretically analyzed. It is argued that the experiment is intimately connected to a double-slit interference experiment where, the which-path…
The factor analysis model is a statistical model where a certain number of hidden random variables, called factors, affect linearly the behaviour of another set of observed random variables, with additional random noise. The main assumption…
In a quantum computer any superposition of inputs evolves unitarily into the corresponding superposition of outputs. It has been recently demonstrated that such computers can dramatically speed up the task of finding factors of large…
We study the implementation of quantum phase measurement in a superconducting circuit, where two Josephson phase qubits are coupled to the photon field inside a resonator. We show that the relative phase of the superposition of two Fock…
The assumed computationally difficulty of factoring large integers forms the basis of security for RSA public-key cryptography, which specifically relies on products of two large primes or semi-primes. The best-known factoring algorithms…
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…
We investigate a clustering problem with data from a mixture of Gaussians that share a common but unknown, and potentially ill-conditioned, covariance matrix. We start by considering Gaussian mixtures with two equally-sized components and…
We describe a novel analogue algorithm that allows the simultaneous factorization of an exponential number of large integers with a polynomial number of experimental runs. It is the interference-induced periodicity of "factoring"…
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…
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…
$f(R)$ supergravity is known to contain a ghost mode associated with higher-derivative terms if it contains $R^n$ with $n$ greater than two.We remove the ghost in $f(R)$ supergravity by introducing auxiliary gauge field to absorb the ghost.…
Ghosts have been a stumbling block in the development of a UV complete quantum field theory for gravity. We discuss how difficulties associated with ghosts are overcome in the context of 0+1d QFT. Obtaining a probability interpretation is…
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.…
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…
A ghost over a finite p-group G is a map between modular representations of G which is invisible in Tate cohomology. Motivated by the failure of the generating hypothesis---the statement that ghosts between finite-dimensional…
The decoherence of a qubit due to a classical non-Gaussian noise with correlation time longer than the decoherence time is discussed for arbitrary working points of the qubit. A method is developed that allows an exact formula for the phase…
A quantum processor (QuP) can be used to exploit quantum mechanics to find the prime factors of composite numbers[1]. Compiled versions of Shor's algorithm have been demonstrated on ensemble quantum systems[2] and photonic systems[3-5],…
Quantum Hoare logic allows us to reason about quantum programs. We present an extension of quantum Hoare logic that introduces "ghost variables" to extend the expressive power of pre-/postconditions. Ghost variables are variables that do…