Related papers: The Bonsai algorithm: grow your own fermion-to-qub…
Quantum simulations before fault tolerance suffer from the intrinsic noise present in quantum computers. In this regime, extracting meaningful results greatly benefits from stability against that noise. This stability, defined as an error…
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 analyze some aspects of quantum computing with super-qubits (squbits). We propose the analogue of a superfield formalism, and give a physical interpretation for the Grassmann coefficients in the squbit expansion as fermionic creation…
In classical and single-particle settings, non-trivial band topology always gives rise to robust boundary modes. For quantum many-body systems, however, multiple topological fermions are not always able to coexist, since Pauli exclusion…
Quadratically optimized polynomials are described which are useful in multi-bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions. Algorithms for the computation of the coefficients and roots of these…
Simulating fermionic lattice models with qubits requires mapping fermionic degrees of freedom to qubits. The simplest method for this task, the Jordan-Wigner transformation, yields strings of Pauli operators acting on an extensive number of…
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of $N$ spin-orbitals into an $N$-qubit system, but many of the fermionic…
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hubbard ground state for large instances may be beyond the…
This work is concerned with tree tensor network operators (TTNOs) for representing quantum Hamiltonians. We first establish a mathematical framework connecting tree topologies with state diagrams. Based on these, we devise an algorithm for…
Qubit allocation is a process to assign physical qubits to logical qubits in a quantum program. Since some quantum computers have connectivity constraints on applications of two-qubit operations, it is mainly concerned with finding an…
A mapping technique is used to derive in the context of constituent quark models effective Hamiltonians that involve explicit hadron degrees of freedom. The technique is based on the ideas of mapping between physical and ideal Fock spaces…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…
The advent of fault-tolerant quantum computers marks a significant milestone, yet the development of practical quantum algorithms remains a critical challenge. Effective quantum algorithms are essential for leveraging the power of quantum…
Quantum generative learning is a promising application of quantum computers, but faces several trainability challenges, including the difficulty in experimental gradient estimations. For certain structured quantum generative models,…
We present a quantum circuit implementation of the quantum hashing algorithm (quantum fingerprinting) for a quantum device with restrictions on the application of two-qubit gates by a qubit connectivity graph. We present an optimization…
Modeling low energy eigenstates of fermionic systems can provide insight into chemical reactions and material properties and is one of the most anticipated applications of quantum computing. We present three techniques for reducing the cost…
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.…
Quantum computing holds immense promise for simulating quantum systems, a critical task for advancing our understanding of complex quantum phenomena. One of the primary goals in this domain is to accurately approximate the ground state of…
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…