Related papers: Ghost factors in Gauss-sum factorization with tran…
This paper elaborates on a sieving technique that has first been applied in 2018 for improving bounds on deterministic integer factorization. We will generalize the sieve in order to obtain a polynomial-time reduction from integer…
Gibbs-type priors are widely used as key components in several Bayesian nonparametric models. By virtue of their flexibility and mathematical tractability, they turn out to be predominant priors in species sampling problems, clustering and…
Assuming that center vortices are the confining gauge field configurations, we argue that in gauges that are sensitive to the confining center vortex degrees of freedom, and where the latter lie on the Gribov horizon, the corresponding…
Shor's algorithm for factoring in polynomial time on a quantum computer\cite{Shor} gives an enormous advantage over all known classical factoring algorithm. We demonstrate how to factor products of large prime numbers using a compiled…
Coherent ensembles of $N$ qubits present an advantage in quantum phase estimation over separable mixtures, but coherence decay due to classical phase diffusion reduces overall precision. In some contexts, the strength of diffusion may be…
Overcoming the influence of noise and imperfections in quantum devices is one of the main challenges for viable quantum applications. In this article, we present different protocols, which we denote as "superposed quantum error mitigation",…
Valid causal inference in observational studies often requires controlling for confounders. However, in practice measurements of confounders may be noisy, and can lead to biased estimates of causal effects. We show that we can reduce the…
The tantalizing promise of quantum computational speedup in solving certain problems has been strongly supported by recent experimental evidence from a high-fidelity 53-qubit superconducting processor1 and Gaussian boson sampling (GBS) with…
The presence of noise is the primary challenge in realizing fault-tolerant quantum computers. In this work, we introduce and experimentally validate a novel strategy to circumvent noise by exploiting the phenomenon of metastability, where a…
The principal obstacle to quantum information processing with many qubits is decoherence. One source of decoherence is spontaneous emission which causes loss of energy and information. Inability to control system parameters with high…
The Douglas-Rachford algorithm is a very popular splitting technique for finding a zero of the sum of two maximally monotone operators. However, the behaviour of the algorithm remains mysterious in the general inconsistent case, i.e., when…
Within the Hamiltonian approach in Coulomb gauge the ghost and gluon propagators are determined from a variational solution of the Yang-Mills Schroedinger equation showing both gluon and heavy quark confinement. The continuum results are in…
Large-scale quantum computation requires a fast assessment of the main sources of error in the implemented quantum gates. To this aim, we provide a learning based framework that allows to extract the contribution of each physical noise…
This paper deals with the factor modeling for high-dimensional time series based on a dimension-reduction viewpoint. Under stationary settings, the inference is simple in the sense that both the number of factors and the factor loadings are…
We design a deterministic subexponential time algorithm that takes as input a multivariate polynomial $f$ computed by a constant-depth circuit over rational numbers, and outputs a list $L$ of circuits (of unbounded depth and possibly with…
Computational validation is vital for all large-scale quantum computers. One needs computers that are both fast and accurate. Here we apply precise, scalable, high order statistical tests to data from large Gaussian boson sampling (GBS)…
We reexamine a recent result within a nonrelativistic constituent quark model (NRCQM) which maintains that the uuds\bar s component in the proton has its uuds subsystem in P state, with its \bar s in S state (configuration I). When the…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
We propose a new unsupervised learning method for clustering a large number of time series based on a latent factor structure. Each cluster is characterized by its own cluster-specific factors in addition to some common factors which impact…