Related papers: FeynmanDD: Quantum Circuit Analysis with Classical…
For the calculation of multi-loop Feynman integrals, a novel numerical method, the Direct Computation Method (DCM) is developed. It is a combination of a numerical integration and a series extrapolation. In principle, DCM can handle…
In this paper we show how Feynman diagrams, which are used as a tool to implement perturbation theory in quantum field theory, can be very useful also in classical mechanics, provided we introduce also at the classical level concepts like…
Loading classical data into quantum registers is one of the most important primitives of quantum computing. While the complexity of preparing a generic quantum state is exponential in the number of qubits, in many practical tasks the state…
Simulating a quantum circuit with a classical computer requires exponentially growing resources. Decision diagrams exploit the redundancies in quantum circuit representation to efficiently represent and simulate quantum circuits. But for…
Quantum computing is a hotspot technology for its potential to accelerate specific applications by exploiting quantum parallelism. However, current physical quantum computers are limited to a relatively small scale, simulators based on…
A diagram approach to classical nonlinear stochastic field theory is introduced. This approach is intended to serve as a link between quantum and classical field theories, resulting in an independent constructive characterisation of the…
We show that recent experiments in hybrid qubit-oscillator devices that measure the phase-space characteristic function of the oscillator via the qubit can be seen through the lens of functional calculus and path integrals, drawing a clear…
The Feynman path integral has revolutionized modern approaches to quantum physics. Although the path integral formalism has proven very successful and spawned several approximation schemes, the direct evaluation of real-time path integrals…
Quantum corrections significantly influence the quantities observed in modern particle physics. The corresponding theoretical computations are usually quite lengthy which makes their automation mandatory. This review reports on the current…
Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical…
Diagrammatic expansions are a paradigmatic and powerful tool of quantum many-body theory. Their evaluation to high order, e.g., by the Diagrammatic Monte Carlo technique, can provide unbiased results in strongly correlated and challenging…
The simulation of quantum circuits on classical computers is an important problem in quantum computing. Such simulation requires representations of distributions over very large sets of basis vectors, and recent work has used symbolic…
Recent technological advancements show promise in leveraging quantum mechanical phenomena for computation. This brings substantial speed-ups to problems that are once considered to be intractable in the classical world. However, the…
New algebraic approach to analytical calculations of D-dimensional integrals for multi-loop Feynman diagrams is proposed. We show that the known analytical methods of evaluation of multi-loop Feynman integrals, such as integration by parts…
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
Complete Feynman diagram automatic computation systems are now coming of age after many years of development. They are made available to the high energy physics community through user-friendly interfaces. Theorists and experimentalists can…
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…
The evaluation of quantum corrections in the theory of the electroweak and strong interactions via higher-order Feynman diagrams requires complicated and laborious calculations, which however can be structured in a strictly algorithmic way.…
Diagrammatic representations of quantum algorithms and circuits offer novel approaches to their design and analysis. In this work, we describe extensions of the ZX-calculus especially suitable for parameterized quantum circuits, in…
One of the challenges currently facing the quantum computing community is the design of quantum circuits which can efficiently run on near-term quantum computers, known as the quantum compiling problem. Algorithms such as the Variational…