Related papers: Parallelization techniques for quantum simulation …
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in…
Current quantum computing devices have different strengths and weaknesses depending on their architectures. This means that flexible approaches to circuit design are necessary. We address this task by introducing a novel space-efficient…
Simulating many-body fermionic systems in conventional qubit-based quantum computers poses significant challenges due to the overheads associated with the encoding of fermionic statistics in qubits, leading to the proposal of native…
This work shows that minimizing the depth of a quantum circuit composed of commuting operations reduces to a vertex coloring problem on an appropriately constructed graph, where gates correspond to vertices and edges encode…
Mappings between fermions and qubits are valuable constructions in physics. To date only a handful exist. In addition to revealing dualities between fermionic and spin systems, such mappings are indispensable in any quantum simulation of…
Near-term quantum simulators are mostly based on qubit-based architectures. However, their imperfect nature significantly limits their practical application. The situation is even worse for simulating fermionic systems, which underlie most…
In ab-initio electronic structure simulations, fermion-to-qubit mappings represent the initial encoding step of the fermionic problem into qubits. This work introduces a physically-inspired method for constructing mappings that…
Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics. Although qubit-based quantum computers can potentially tackle this…
Quantum simulation of fermionic systems is a promising application of quantum computers, but in order to program them, we need to map fermionic states and operators to qubit states and quantum gates. While quantum processors may be built as…
Current monolithic quantum computer architectures have limited scalability. One promising approach for scaling them up is to use a modular or multi-core architecture, in which different quantum processors (cores) are connected via quantum…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
Among the limitations of current quantum machines, the qubits count represents one of the most critical challenges for porting reasonably large computational problems, such as those coming from real-world applications, to the scale of the…
The problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temporal planning is an attractive approach for part of this…
Simulating the dynamics of electrons and other fermionic particles in quantum chemistry, materials science, and high-energy physics is one of the most promising applications of fault-tolerant quantum computers. However, the overhead in…
In this paper we study a combinatorial reconfiguration problem that involves finding an optimal sequence of swaps to move an initial configuration of tokens that are placed on the vertices of a graph to a final desired one. This problem…
To treat a problem with a Quantum Processing Unit (QPU), it must be transformed into a sequence of quantum operations, or gates: this is the quantum description of the problem. These operations are either packed into a query (i.e. quantum…
We discuss encodings of fermionic many-body systems by qubits in the presence of symmetries. Such encodings eliminate redundant degrees of freedom in a way that preserves a simple structure of the system Hamiltonian enabling quantum…
Simulation of fermionic systems is one of the most promising applications of quantum computers. It spans problems in quantum chemistry, high-energy physics and condensed matter. Underpinning the core steps of any quantum simulation…
Many-body fermionic systems can be simulated in a hardware-efficient manner using a fermionic quantum processor. Neutral atoms trapped in optical potentials can realize such processors, where non-local fermionic statistics are guaranteed at…
Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The…