Related papers: From Feynman integrals to quantum algorithms: the …
Evaluation of a wide variety of Feynman diagrams with multi-loop integrals and physical parameters and its comparison with high energy experiments are expected to investigate new physics beyond the Standard Model. We have been developing a…
Quantum simulation, the simulation of quantum processes on quantum computers, suggests a path forward for the efficient simulation of problems in condensed-matter physics, quantum chemistry, and materials science. While the majority of…
Identifying computational tasks suitable for (future) quantum computers is an active field of research. Here we explore utilizing quantum computers for the purpose of solving differential equations. We consider two approaches: (i) basis…
We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes…
Modern particle physics is increasingly becoming a precision science that relies on advanced theoretical predictions for the analysis and interpretation of experimental results. The planned physics program at the LHC and future colliders…
Quantum LDPC codes have attracted intense interest due to their advantageous properties for realizing efficient fault-tolerant quantum computing. In particular, sheaf codes represent a novel framework that encompasses all well-known good…
This work proposes double-bracket iterations as a framework for obtaining diagonalizing quantum circuits. Their implementation on a quantum computer consists of interlacing evolutions generated by the input Hamiltonian with diagonal…
We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the…
We propose a new framework to represent the perturbative S-matrix which is well-defined for all quantum field theories of massless particles, constructed from tree-level amplitudes and integrable term-by-term. This representation is derived…
The work that we present in this thesis tries to be at the crossover of quantum information science, quantum many-body physics, and quantum field theory. We use tools from these three fields to analyze problems that arise in the…
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root.…
We introduce two possible ways of defining effective constraints of quantum systems and applied this effective constraint method to models of WDW Quantum Cosmology and Loop Quantum Cosmology. We analyze effective Hamiltonian constraint on…
Dimensionality reduction (DR) of data is a crucial issue for many machine learning tasks, such as pattern recognition and data classification. In this paper, we present a quantum algorithm and a quantum circuit to efficiently perform linear…
Starting from two-loops, there are Feynman integrals with higher powers of the propagators. They arise from self-energy insertions on internal lines. Within the loop-tree duality approach or within methods based on numerical unitarity one…
We study a set of two-loop non-planar master integrals needed for the NNLO QCD corrections to diphoton and dijet production at hadron colliders. The top-sector topology contains an internal massive fermion loop and is known to contain…
Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore's law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world…
Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is…
We introduce a novel, systematic method for the complete symbolic reduction of multi-loop Feynman integrals, leveraging the power of generating functions. The differential equations governing these generating functions naturally yield…
We present a novel framework for computing differential cross-sections in quantum field theory using the optical theorem and loop amplitudes, circumventing the traditional method of squaring scattering amplitudes. This approach addresses…
Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step…