Related papers: Tackling Feynman integrals with quantum minimizati…
This work focuses on quantum methods for cryptanalysis of schemes based on the integer factorization problem and the discrete logarithm problem. We demonstrate how to practically solve the largest instances of the factorization problem by…
We introduce an optimisation method for variational quantum algorithms and experimentally demonstrate a 100-fold improvement in efficiency compared to naive implementations. The effectiveness of our approach is shown by obtaining…
We address the challenge of multi-target quantum optimization, where the objective is to simultaneously optimize multiple cost functions defined over the same quantum search space. To accelerate optimization and reduce quantum resource…
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. However, due to the noise and the limited scale of current quantum…
A new approach to compute Feynman Integrals is presented. It relies on an integral representation of a given Feynman Integral in terms of simpler ones. Using this approach, we present, for the first time, results for a certain family of…
We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap…
To date, research in quantum computation promises potential for outperforming classical heuristics in combinatorial optimization. However, when aiming at provable optimality, one has to rely on classical exact methods like integer…
Implementing variational quantum algorithms with noisy intermediate-scale quantum machines of up to a hundred qubits is nowadays considered as one of the most promising routes towards achieving a quantum practical advantage. In multiqubit…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
We propose using variational quantum algorithms (VQAs) to simulate established quantum algorithms under realistic noise conditions, aiming to surpass the fidelity of theoretical circuits in noisy environments. Focusing on the Quantum…
Quantum computing is a promising paradigm that may overcome the current computational power bottlenecks. The increasing maturity of quantum processors provides more possibilities for the development and implementation of quantum algorithms.…
This work studies the variational quantum eigensolver algorithm, designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware. Methods of reducing the number of required qubit…
Recent demonstrations on specialized benchmarks have reignited excitement for quantum computers, yet whether they can deliver an advantage for practical real-world problems remains an open question. Here, we show that probabilistic…
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…
Building on the idea of numerically integrating differential equations satisfied by Feynman integrals, we propose a novel strategy for handling branch cuts within a numerical framework. We develop an integrator capable of evaluating a basis…
We show that direct Feynman-parametric loop integration is possible for a large class of planar multi-loop integrals. Much of this follows from the existence of manifestly dual-conformal Feynman-parametric representations of planar loop…
The spinor-helicity formalism has proven to be very efficient in the calculation of scattering amplitudes in quantum field theory, while the loop tree duality (LTD) representation of multi-loop integrals exhibits appealing and interesting…
Quantum computing hardware is affected by quantum noise that undermine the quality of results of an executed quantum program. Amongst other quantum noises, coherent error that caused by parameter drifting and miscalibration, remains…
Integration-by-parts reductions of Feynman integrals pose a frequent bottle-neck in state-of-the-art calculations in theoretical particle and gravitational-wave physics, and rely on heuristic approaches for selecting integration-by-parts…
A hybrid quantum-classical algorithm is a computational scheme in which quantum circuits are used to extract information that is then processed by a classical routine to guide subsequent quantum operations. These algorithms are especially…