Related papers: Ultrafast Hybrid Fermion-to-Qubit mapping
Simulating fermionic systems on qubit hardware involves many nonlocal interactions, and efficient routing of these interactions is critical to the overall cost of fermionic simulation algorithms. Recent works reduce this Jordan-Wigner…
The ability to simulate a fermionic system on a quantum computer is expected to revolutionize chemical engineering, materials design, nuclear physics, to name a few. Thus, optimizing the simulation circuits is of significance in harnessing…
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…
A compelling application of quantum computers with thousands of qubits is quantum simulation. Simulating fermionic systems is both a problem with clear real-world applications and a computationally challenging task. In order to simulate a…
We perform an extended numerical search for practical fermion-to-qubit encodings with error correcting properties. Ideally, encodings should strike a balance between a number of the seemingly incompatible attributes, such as having a high…
Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits…
We propose a versatile and efficient algorithmic framework for optimizing fermion-to-qubit mappings by generalizing the idea of randomized block coordinate descent. Our greedy approach, termed Randomized Subsystem Descent, iteratively…
Due to the short decohorence time of qubits available in the NISQ-era, it is essential to pack (minimize the size and or the depth of) a logical quantum circuit as efficiently as possible given a sparsely coupled physical architecture. In…
The Jordan-Wigner transformation maps a one-dimensional spin-1/2 system onto a fermionic model without spin degree of freedom. A double chain of quantum bits with XX and ZZ couplings of neighboring qubits along and between the chains,…
Simulating computationally hard fermionic systems is a promising application of quantum computing. However, mapping nonlocal fermionic operators to qubits often produces deep circuits, rendering such simulations impractical on near-term…
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…
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…
The celebrated Jordan--Wigner transformation provides an efficient mapping between spin chains and fermionic systems in one dimension. Here we extend this spin-fermion mapping to arbitrary tree structures, which enables mapping between…
The future challenge of quantum communication are scalable quantum networks, which require coherent and reversible mapping of photonic qubits onto stationary atomic systems (quantum memories). A crucial requirement for realistic networks is…
Routing is the task of permuting qubits in such a way that quantum operations can be parallelized maximally, given constraints on the hardware geometry. When simulating fermions in the Jordan-Wigner encoding with qubits, a one-dimensional…
We study a proof-of-principle example of the recently proposed hybrid quantum-classical simulation of strongly correlated fermion models in the thermodynamic limit. In a "two-site" dynamical mean-field theory (DMFT) approach we reduce the…
We consider a hybrid digital-analog quantum computing approach, which allows implementing any quantum algorithm without standard two-qubit gates. This approach is based on the always-on interaction between qubits, which can provide an…
Efficient encoding of electronic operators into qubits is essential for quantum chemistry simulations. The majority of methods map single electron states to qubits, effectively handling electron interactions. Alternatively, pairs of…
Fermions are the building blocks of matter, forming atoms and nuclei, complex materials and neutron stars. Our understanding of many-fermion systems is however limited, as classical computers are often insufficient to handle the intricate…
Realizing the advantages of quantum computation requires access to the full Hilbert space of states of many quantum bits (qubits). Thus, large-scale quantum computation faces the challenge of efficiently generating entanglement between many…