相关论文: And free lunch for all...
Inspired by Andrews' and Newman's work on the minimal excludant or "mex" of partitions, we define four new classes of minimal excludants for overpartitions and establish relations to certain functions due to Ramanujan.
This thesis consists of two parts. The first part is about how quantum theory can be recovered from first principles, while the second part is about the application of diagrammatic reasoning, specifically the ZX-calculus, to practical…
Recently, quantum neural networks or quantum-classical neural networks (qcNN) have been actively studied, as a possible alternative to the conventional classical neural network (cNN), but their practical and theoretically-guaranteed…
This monograph attempts a theory of every 'thing' that can be distinguished from other things in a statistical sense. The ensuing statistical independencies, mediated by Markov blankets, speak to a recursive composition of ensembles (of…
By the early eighties, Fredkin, Feynman, Minsky and others were exploring the notion that the laws of physics could be simulated with computers. Feynman's particular contribution was to bring quantum mechanics into the discussion and his…
"Theorems for Free!" (Wadler, FPCA 1989) is a slogan for a technique that allows to derive statements about functions just from their types. So far, the statements considered have always had a purely extensional flavor: statements relating…
Review of the two volume set "The Quantum Theory of Fields" by S. Weinberg is presented.
S. Ramanujan introduced a technique in 1913 for providing analytic expressions for certain Mellin-type integrals which is now known as Ramanujan's Master Theorem. This technique was communicated through his "Quarterly Reports" and has a…
The No-Free-Lunch (NFL) theorem, which quantifies problem- and data-independent generalization errors regardless of the optimization process, provides a foundational framework for comprehending diverse learning protocols' potential. Despite…
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a…
In the reductionistic approach, mechanisms are divided into simpler parts interconnected in some standard way (e.g. by a mechanical transmission). We explore the possibility of porting reductionism in quantum operations. Conceptually, first…
An Everett (`Many Worlds') interpretation of quantum mechanics due to Saunders and Zurek is presented in detail. This is used to give a physical description of the process of a quantum computation. Objections to such an understanding are…
No-Free-Lunch Theorems state, roughly speaking, that the performance of all search algorithms is the same when averaged over all possible objective functions. This fact was precisely formulated for the first time in a now famous paper by…
The aim of this book is to develop "from the ground up" many of the major, exciting, pre- and post-millenium developments in the general area of study known as quantum Shannon theory. As such, we spend a significant amount of time on…
Project of an undergraduate student in physics (4th year) about the concept of quantum computers (QC) and its social impact. After a thourough theoretical introduction (chap. 2), the recent debate about NMR-based QC is dealt with in detail…
While quantum computing provides an exponential advantage in solving system of linear equations, there is little work to solve system of nonlinear equations with quantum computing. We propose quantum Newton's method (QNM) for solving…
Quantum Random Access Memory (QRAM) has the potential to revolutionize the area of quantum computing. QRAM uses quantum computing principles to store and modify quantum or classical data efficiently, greatly accelerating a wide range of…
Quantum theory on manifolds with boundaries have been studied extensively through von Neumann analysis of self adjoint operators. We approach the issues through introduction of singular $\delta$ and $\delta'$ potentials. The advantages of…
We consider an example of a quantum algorithm from the point of view of the de Broglie-Bohm formulation of quantum mechanics. For concreteness we look at two particular implementations: one using spin-1/2 particles as described by a simple…
The existence of universal quantum computers has been theoretically well established. However, building up a real quantum computer system not only relies on the theory of universality, but also needs methods to satisfy requirements on other…