Related papers: Ghost factors in Gauss-sum factorization with tran…
Noise is a major challenge for building practical quantum computing systems. Precise characterization of quantum noise is crucial for developing effective error mitigation and correction schemes. However, state preparation and measurement…
To identify the robust settings of the control factors, it is very important to understand how they interact with the noise factors. In this article, we propose space-filling designs for computer experiments that are more capable of…
Constant-factor differences are frequently ignored when analyzing the complexity of algorithms and implementations, as they appear to be insignificant in practice. In this paper, we demonstrate that this assumption can in fact have far more…
Mutation analysis has long been used in classical software testing and has recently been adopted for assessing the robustness of quantum software testing techniques. However, existing studies assume ideal, noiseless execution, overlooking…
Boost factors of dark matter annihilation into antiprotons and electrons/positrons due to the clumpiness of dark matter distribution are studied in detail in this work, taking the Sommerfeld effect into account. It has been thought that the…
In the context of a ghost free $f(R,\mathcal{G})$ model, an extended matter bounce scenario is studied where the form of the scale factor is given by $a(t) = (a_0t^2 + 1)^n$. The ghost free character of the model is ensured by the presence…
Gaussian boson sampling (GBS) is a promising protocol for demonstrating quantum computational advantage. One of the key steps for proving classical hardness of GBS is the so-called ``hiding conjecture'', which asserts that one can ``hide''…
We present a Bayesian non-negative tensor factorization model for count-valued tensor data, and develop scalable inference algorithms (both batch and online) for dealing with massive tensors. Our generative model can handle overdispersed…
Many modern asymmetric encryption methods rely on prime numbers, as they have distinctive properties. For instance, the security of RSA cryptosystem relies on the computational difficulty of factoring a large composite number in its prime…
We present the first application of the maximum-entropy freeze-out prescription to calculate factorial cumulants of proton multiplicities near the conjectured QCD critical point in thermal equilibrium. We map the Gibbs free energy of the 3D…
Signal processing in non-Gaussian noise environment is addressed in this paper. For many real-life situations, the additive noise process present in the system is found to be dominantly non-Gaussian. The problem of detection and estimation…
Within the Hamiltonian approach to Yang-Mills theory 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…
The two interferometric LIGO gravitational-wave observatories provide the most sensitive data to date to study the gravitational-wave Universe. As part of a global network, they have just completed their third observing run in which they…
Fluctuations of the qubit frequencies are one of the major problems to overcome on the way to scalable quantum computers. Of particular importance are fluctuations with the correlation time that exceeds the decoherence time due to decay and…
Fermionic Gaussian circuits can be simulated efficiently on a classical computer, but become universal when supplemented with non-Gaussian operations. Similar to stabilizer circuits augmented with non-stabilizer resources, these…
A Quantum Computer is a new type of computer which can solve problems such as factoring and database search very efficiently. The usefulness of a quantum computer is limited by the effect of two different types of errors, decoherence and…
The k-regular sequences exhibit a self-similar behaviour between powers of k. One way to study this self-similarity is to attempt to describe the limiting shape of the sequence using measures, which results in an object which we call the…
The master equation is quantized. This is an example of quantization of a gauge theory with nilpotent generators. No ghosts are needed for a generation of the gauge algebra. The point about the nilpotent generators is that one can't write…
We report on the current state of factoring integers on both digital and analog quantum computers. For digital quantum computers, we study the effect of errors for which one can formally prove that Shor's factoring algorithm fails. For…
Magic is a non-classical resource whose efficient manipulation is fundamental to advancing efficient and scalable fault-tolerant quantum computing. Quantum advantage is possible only if both magic and entanglement are present. Of particular…