Related papers: Succinct Fermion Data Structures
In gate-defined semiconductor spin qubits, the highly tunable Heisenberg exchange interaction is leveraged to implement fermionic two-qubit gates such as CZ and SWAP. However, the broader family of fermionic simulation (fSim) gates remains…
Quantum computers are expected to accelerate solving combinatorial optimization problems, including algorithms such as Grover adaptive search and quantum approximate optimization algorithm (QAOA). However, many combinatorial optimization…
We provide a systematic construction for local quantum circuits hosting free fermions in disguise, both with staircase and brickwork architectures. Similar to the original Hamiltonian model introduced by Fendley, these circuits are defined…
This paper introduces the Hamiltonian-Adaptive Ternary Tree (HATT) framework to compile optimized Fermion-to-qubit mapping for specific Fermionic Hamiltonians. In the simulation of Fermionic quantum systems, efficient Fermion-to-qubit…
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…
As the field of quantum computing grows, novel algorithms which take advantage of quantum phenomena need to be developed. As we are currently in the NISQ (noisy intermediate scale quantum) era, quantum algorithm researchers cannot reliably…
We analyze the efficiency of quantum simulations of fermionic and bosonic models in trapped ions. In particular, we study the optimal time of entangling gates and the required number of total elementary gates. Furthermore, we exemplify…
Quantum circuit simulation is paramount to the verification and optimization of quantum algorithms, and considerable research efforts have been made towards efficient simulators. While circuits often contain high-level gates such as oracles…
In our recent work, we have examined various fermion to qubit mappings in the context of quantum simulation including the original Bravyi-Kitaev Superfast encoding (OSE) as well as a generalized version (GSE). We return to OSE and compare…
Recent work has explored using the stabilizer formalism to classically simulate quantum circuits containing a few non-Clifford gates. The computational cost of such methods is directly related to the notion of stabilizer rank, which for a…
Quantum reservoir computing is a neuro-inspired machine learning approach harnessing the rich dynamics of quantum systems to solve temporal tasks. It has gathered attention for its suitability for NISQ devices, for easy and fast…
Simulation of quantum systems is expected to be one of the most important applications of quantum computing, with much of the theoretical work so far having focused on fermionic and spin-$\frac{1}{2}$ systems. Here, we instead consider…
Due to the significant progress made in the implementation of quantum hardware, efficient methods and tools to design corresponding algorithms become increasingly important. Many of these tools rely on functional representations of certain…
We present efficient quantum circuits for fermionic excitation operators tailored for ion trap quantum computers exhibiting the M{\o}lmer-S{\o}rensen (MS) gate. Such operators commonly arise in the study of static and dynamic properties in…
For quantum computing applications, the electronic Hamiltonian for the electronic structure problem needs to be unitarily transformed to a qubit form. We found that mean-field procedures on the original electronic Hamiltonian and on its…
Fermionic linear optics corresponds to the dynamics of free fermions, and is known to be efficiently simulable classically. We define fermionic anyon models by deforming the fermionic algebra of creation and annihilation operators, and…
Conservation of symmetries plays a crucial role in both classical and quantum simulations of many-body systems, enabling the tracking of states with specific symmetry properties and leading to substantial reductions in the number of…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
In order to evaluate, validate, and refine the design of new quantum algorithms or quantum computers, researchers and developers need methods to assess their correctness and fidelity. This requires the capabilities of quantum circuit…