Related papers: Geometrical causality: casting Feynman integrals i…
As argued previously, amplitudes of quantum field theories on noncommutative space and time cannot be computed using naive path integral Feynman rules. One of the proposals is to use the Gell-Mann--Low formula with time-ordering applied…
We present an implementation of Grover's algorithm in the framework of Feynman's cursor model of a quantum computer. The cursor degrees of freedom act as a quantum clocking mechanism, and allow Grover's algorithm to be performed using a…
The two point integrals contributing to the self energy of a particle in a three dimensional quantum field theory are calculated to two loop order in perturbation theory as well as the vacuum ones contributing to the effective potential to…
Quantum gravity corrections to the behavior of matter, such as Higgs bosons and fermions, are notoriously difficult to calculate. The standard tools of quantum field theory often break down, producing infinite results that spoil our…
We extend the Worldline Monte Carlo approach to computationally simulating the Feynman path integral of non-relativistic multi-particle quantum-mechanical systems. We show how to generate an arbitrary number of worldlines distributed…
The classical notions of continuity and mechanical causality are left in order to refor- mulate the Quantum Theory starting from two principles: I) the intrinsic randomness of quantum process at microphysical level, II) the projective…
We present a systematic study of one-loop quantum corrections in scalar effective field theories from a geometric viewpoint, emphasizing the role of field-space curvature and its renormalisation. By treating the scalar fields as coordinates…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
Conformal field theories have been extremely useful in our quest to understand physical phenomena in many different branches of physics, starting from condensed matter all the way up to high energy. Here we discuss applications of…
We discuss how to use the recent progress in understanding of the $x$-$y$ duality and symplectic duality in the theory of topological recursion and its generalizations in order to efficiently compute the quantum spectral curve operators for…
In the very near future the first data from LHC will be available. The searches for the Higgs boson and for new physics will require precise predictions both for the signal and the background processes. Tree level calculations typically…
In this article we study two related models of quantum geometry: generic random trees and two-dimensional causal triangulations. The Hausdorff and spectral dimensions that arise in these models are calculated and their relationship with the…
Quantum algorithms have been developed for efficiently solving linear algebra tasks. However, they generally require deep circuits and hence universal fault-tolerant quantum computers. In this work, we propose variational algorithms for…
High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers but require efficient generation of non-local, many-body entanglement. We provide a linear-optical architecture with these properties,…
Quantum computing has recently been emerging in theoretical chemistry as a realistic avenue meant to offer computational speedup to challenging eigenproblems in the context of strongly-correlated molecular systems or extended materials.…
It is postulated that quantum gravity is a sum over causal structures coupled to matter via scale evolution. Quantized causal structures can be described by studying simple matrix models where matrices are replaced by an algebra of quantum…
Nielsen, et al. [1, 2] proposed a view of quantum computation where determining optimal algorithms is equivalent to extremizing a geodesic length or cost functional. This view of optimization is highly suggestive of an action principle of…
Inspired by the work of Feynman, Deutsch, We formally propose the theory of physical computability and accordingly, the physical complexity theory. To achieve this, a framework that can evaluate almost all forms of computation using various…
Modern machine learning (ML) methods typically fail to adequately capture causal information. Consequently, such models do not handle data distributional shifts, are vulnerable to adversarial examples, and often learn spurious correlations.…
In this talk we discuss Feynman integrals which are related to elliptic curves. We show with the help of an explicit example that in the set of master integrals more than one elliptic curve may occur. The technique of maximal cuts is a…