Related papers: Solving the Insoluble: A New Rule for Quantization
We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both…
While recent progress in quantum hardware open the door for significant speedup in certain key areas (cryptography, biology, chemistry, optimization, machine learning, etc), quantum algorithms are still hard to implement right, and the…
The method of differential equations has been proven to be a powerful tool for the computation of multi-loop Feynman integrals appearing in quantum field theory. It has been observed that in many instances a canonical basis can be chosen,…
The present work proposes an alternative approach to the problem of the emergence of classicality. Typical approaches developed in the literature derive the classical behaviour of a quantum system from conditions that concern the value of…
A new attempt is demonstrated that QFTs can be UV finite if they are viewed as the low energy effective theories of a fundamental underlying theory (that is complete and well-defined in all respects) according to the modern standard point…
We study emerging notions of quantum correlations in compound systems. Based on different definitions of quantumness in individual subsystems, we investigate how they extend to the joint description of a composite system. Especially, we…
We discuss classical and quantum algorithms for solvability testing and finding integer solutions x,y of equations of the form af^x + bg^y = c over finite fields GF(q). A quantum algorithm with time complexity q^(3/8) (log q)^O(1) is…
Various topics concerning the entanglement of composite quantum systems are considered with particular emphasis concerning the strict relations of such a problem with the one of attributing objective properties to the constituents. Most of…
Classical programming languages cannot model essential elements of complex systems such as true random number generation. This paper develops a formal programming language called the lambda-q calculus that addresses the fundamental…
A general quantum algorithm for solving a problem is discussed. The number of steps required to solve a problem using this method is independent of the number of cases that has to be considered classically. Hence, it is more efficient than…
In this paper, a new approximate syllogistic reasoning schema is described that expands some of the approaches expounded in the literature into two ways: (i) a number of different types of quantifiers (logical, absolute, proportional,…
Classical optimization algorithms in machine learning often take a long time to compute when applied to a multi-dimensional problem and require a huge amount of CPU and GPU resource. Quantum parallelism has a potential to speed up machine…
The canonical partition function approach was designed to avoid the overlap problem that affects the lattice simulations of nuclear matter at high density. The method employs the projections of the quark determinant on a fix quark number…
The quantum superposition principle has been extensively utilized in the quantum mechanical description of the bonding phenomenon. It explains the emergence of delocalized molecular orbitals and provides a recipe for the construction of…
We apply the quantization scheme introduced in [arXiv:1204.2870] to a particle on a circle. We find that the quantum action functional restricted to appropriate coherent states can be expressed as the classical action plus…
We argue that recent developments in discretizations of classical and quantum gravity imply a new paradigm for doing research in these areas. The paradigm consists in discretizing the theory in such a way that the resulting discrete theory…
Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum…
Classical machine learning theory and theory of quantum computations are among of the most rapidly developing scientific areas in our days. In recent years, researchers investigated if quantum computing can help to improve classical machine…
Three elementary canonical transformations are shown both to have quantum implementations as finite transformations and to generate, classically and infinitesimally, the full canonical algebra. A general canonical transformation can, in…
We point out a general framework that encompasses most cases in which quantum effects enable an increase in precision when estimating a parameter (quantum metrology). The typical quantum precision-enhancement is of the order of the square…