Related papers: Parallelization techniques for quantum simulation …
Quantum symmetrization is the task of transforming a non-strictly increasing list of $n$ integers into an equal superposition of all permutations of the list (or more generally, performing this operation coherently on a superposition of…
Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent activities, aborting and…
Quantum simulation of fermionic systems is a leading application of quantum computers. One promising approach is to represent fermions with qubits via fermion-to-qubit mappings. In this work, we present high-distance fermion-to-qubit…
This paper proposes a general formulation for temporal parallelisation of dynamic programming for optimal control problems. We derive the elements and associative operators to be able to use parallel scans to solve these problems with…
Motivated from the theory of quantum error correcting codes, we investigate a combinatorial problem that involves a symmetric $n$-vertices colourable graph and a group of operations (colouring rules) on the graph: find the minimum sequence…
Efficient simulation of interacting fermionic systems is a key application of near-term quantum computers, but is hindered by the overhead required to encode fermionic operators on qubit hardware. Here, we consider models with $N$ fermionic…
In the era of Noisy Intermediate Scale Quantum (NISQ) computing, available quantum resources are limited. Many NP-hard problems can be efficiently addressed using hybrid classical and quantum computational methods. This paper proposes a…
Simulation of interacting fermionic Hamiltonians is one of the most promising applications of quantum computers. However, the feasibility of analysing fermionic systems with a quantum computer hinges on the efficiency of fermion-to-qubit…
Performing large-scale, accurate quantum simulations of many-fermion systems is a central challenge in quantum science, with applications in chemistry, materials, and high-energy physics. Despite significant progress, realizing generic…
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…
Supersymmetric models are grounded in the intriguing concept of a hypothetical symmetry that relates bosonic and fermionic particles. This symmetry has profound implications, offering valuable extensions to the Standard Model of particle…
Number-conserved subspace encoding reduces resources needed for quantum simulations, but scalable complexity trade-off bounds for $M$ modes and $N$ particles with $\mathcal{O}(N\log M)$ qubits have remained unknown. We study…
A quantum compiler is a critical piece in the quantum computing pipeline since it allows an abstract quantum circuit to be run on a physical quantum computer. One extremely important subproblem in quantum compilation is the generation of a…
A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by their application in computing clique partitions of…
This paper introduces Fermihedral, a compiler framework focusing on discovering the optimal Fermion-to-qubit encoding for targeted Fermionic Hamiltonians. Fermion-to-qubit encoding is a crucial step in harnessing quantum computing for…
Variational optimization of neural-network representations of quantum states has been successfully applied to solve interacting fermionic problems. Despite rapid developments, significant scalability challenges arise when considering…
The quantum approximate optimization algorithm (QAOA) has been introduced as a heuristic digital quantum computing scheme to find approximate solutions of combinatorial problems with shallow circuits. We present a scheme to parallelize this…
Quantum computers are expected to give major speed-ups for the simulation of quantum systems. In these conference proceedings, we discuss quantum algorithms for the simulation of perturbative Quantum Chromodynamics (QCD) processes. In…
The simulation of quantum many-body systems, relevant for quantum chemistry and condensed matter physics, is one of the most promising applications of near-term quantum computers before fault-tolerance. However, since the vast majority of…
Quantum computers are expected to scale in size to close the gap that currently exists between quantum algorithms and quantum hardware. To this end, quantum compilation techniques must scale along with the hardware constraints, shifting the…