Related papers: Virtual and real processes, the K\"all\'en functio…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…
Lines and circles pose significant scalability challenges in synthetic geometry. A line with $n$ points implies ${n \choose 3}$ collinearity atoms, or alternatively, when lines are represented as functions, equality among ${n \choose 2}$…
A previously established correspondence between definite-parity real functions and inner analytic functions is generalized to real functions without definite parity properties. The set of inner analytic functions that corresponds to the set…
Suppose an oracle is known to hold one of a given set of D two-valued functions. To successfully identify which function the oracle holds with k classical queries, it must be the case that D is at most 2^k. In this paper we derive a bound…
A diagrammatic technique is derived for calculating processes involving the production of large numbers of particles. As an example, the amplitude of three particles scattering into $n$ particles at the kinematical threshold in…
The recent debate on hypercomputation has arisen new questions both on the computational abilities of quantum systems and the Church-Turing Thesis role in Physics. We propose here the idea of "effective physical process" as the essentially…
Operator $k$-tone functions on an open interval of the real line, which are higher order extensions of operator monotone and convex functions, are characterized via certain inequalities for the real and imaginary parts of analytic…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Differential logical relations are a method to measure distances between higher-order programs. They differ from standard methods based on program metrics in that differences between functional programs are themselves functions, relating…
We describe the construction of quantum gates (unitary operators) from boolean functions and give a number of applications. Both non-reversible and reversible boolean functions are considered. The construction of the Hamilton operator for a…
Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this…
A C# implementation of a generalized k-means variant called relational k-means is described here. Relational k-means is a generalization of the well-known k-means clustering method which works for non-Euclidean scenarios as well. The input…
Quantum entanglement obscures the notion of local operations; there exist quantum states for which all local actions on one subsystem can be equivalently realized by actions on another. We characterize the states for which this fundamental…
We describe an algorithm for using a quantum computer to calculate mean values of observables and the partition function of a quantum system. Our algorithm includes two sub-algorithms. The first sub-algorithm is for calculating, with…
While spatial quantum correlations have been studied in great detail, much less is known about the genuine quantum correlations that can be exhibited by temporal processes. Employing the quantum comb formalism, processes in time can be…
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…
By means of a thought-experiment, consisting of an interference experiment with two interfering beams, it is shown that it can be demonstrated experimentally that with one single particle a wave can be associated which propagates in space…
In this introductory review, we focus on applications of quantum computation to problems of interest in physics and chemistry. We describe quantum simulation algorithms that have been developed for electronic-structure problems,…
We describe a general methods to localize any sort of k-separability and therefore also the corresponding partial entanglement in genuinely multipartite mixed quantum states. Our methods are based exclusively on the known twopartite methods…