Related papers: Ghost factors in Gauss-sum factorization with tran…
The strangeness content of nucleon form factors is analyzed in a two-component model with a quark-like intrinsic structure surrounded by a meson cloud. A comparison with the available experimental data from the SAMPLE, PVA4, HAPPEX and G0…
We consider computations of a Turing machine under noise that causes consecutive violations of the machine's transition function. Given a constant upper bound B on the size of bursts of faults, we construct a Turing machine M(B) subject to…
It was recently proven that, in contrast to their matrix analogues, the moments of a real Gaussian tensor of size N do not in general factorize over their connected components in the asymptotic large N limit. While the original proof of…
Modern cryptography is largely based on complexity assumptions, for example, the ubiquitous RSA is based on the supposed complexity of the prime factorization problem. Thus, it is of fundamental importance to understand how a quantum…
Ghost imaging is a method to nonlocally image an object by transmitting pairs of entangled photons through the object and a reference optical system respectively. We present a theoretical analysis of the quantum noise in this imaging…
The execution cost of quantum algorithms is typically quantified through asymptotic gate counts and qubit register sizes, yet these metrics do not directly capture which genuinely quantum resources, and in what amount, must be created and…
Bayesian sparse factor models have proven useful for characterizing dependence in multivariate data, but scaling computation to large numbers of samples and dimensions is problematic. We propose expandable factor analysis for scalable…
Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We…
Refinement types decorate types with assertions that enable automatic verification. Like assertions, refinements are limited to binders that are in scope, and hence, cannot express higher-order specifications. Ghost variables circumvent…
Assessment of practical quantum information processing (QIP) remains partial without understanding limits imposed by noise. Unfortunately, mere description of noise grows exponentially with system size, becoming cumbersome even for modest…
Exploiting the indistinguishability of objects in a probabilistic graphical model such as a factor graph is key to lifted probabilistic inference algorithms and allows for tractable probabilistic inference problems with respect to domain…
We derive an analytical expression for the solution of a two-dimensional quasicontinuum method with a planar interface. The expression is used to prove that the ghost force may lead to a finite size error for the gradient of the solution.…
Although the Gaussian-noise assumption is widely adopted in the study of qubit decoherence, non-Gaussian noise sources, especially the strong discrete fluctuators, have been detected in many qubits. It remains an important task to further…
The strange form factors of the nucleon are studied in a two-component model consisting of a three-quark intrinsic structure surrounded by a meson cloud. A comparison with the available experimental world data from the SAMPLE, PVA4, HAPPEX…
The ghost form factor entering the Gribov no-pole condition is evaluated till the third order in the gauge fields. The resulting expression turns out to coincide with Zwanziger's horizon function implementing the restriction to the Gribov…
Quantum computing is one of the most promising technology advances of the latest years. Once only a conceptual idea to solve physics simulations, quantum computation is today a reality, with numerous machines able to execute quantum…
We introduce a coherence susceptibility method, based on the fact that it signals quantum fluctuations, for identifying quantum phase transitions, which are induced by quantum fluctuations. This method requires no prior knowledge of order…
The factorization of a large digit integer in polynomial time is a challenging computational task to decipher. The exponential growth of computation can be alleviated if the factorization problem is changed to an optimization problem with…
The long time consumption is a bottleneck for the applicability of the ghost imaging (GI). By introducing a criterion for the convergence of GI, we investigate a factor that impacts on the convergence speed of it. Based on computer…
We evaluate non factorizable $O(\alpha\alpha_s)$ corrections to the process $Z\to b\bar{b}$ due to the virtual t-quark. All two-loop vertex diagrams with $W$'s and charged ghosts $\Phi$'s are included. They are evaluated in the large…