Fermion determinants on a quantum computer
- URL: http://arxiv.org/abs/2407.13080v1
- Date: Thu, 18 Jul 2024 01:00:28 GMT
- Title: Fermion determinants on a quantum computer
- Authors: George T. Fleming, Prasanth Shyamsundar, Judah Unmuth-Yockey,
- Abstract summary: The algorithm uses the quantum eigenvalue transform, and quantum mean estimation, giving a query complexity that scales like $O(Vlog(V))$ in the matrix dimension $V$.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We present a quantum algorithm to compute the logarithm of the determinant of the fermion matrix, assuming access to a classical lattice gauge field configuration. The algorithm uses the quantum eigenvalue transform, and quantum mean estimation, giving a query complexity that scales like $O(V\log(V))$ in the matrix dimension $V$.
Related papers
- Polynomial-depth quantum algorithm for computing matrix determinant [46.13392585104221]
We propose an algorithm for calculating the determinant of a square matrix, and construct a quantum circuit realizing it.
Each row of the matrix is encoded as a pure state of some quantum system.
The admitted matrix is therefore arbitrary up to the normalization of quantum states of those systems.
arXiv Detail & Related papers (2024-01-29T23:23:27Z) - A hybrid quantum-classical algorithm for multichannel quantum scattering
of atoms and molecules [62.997667081978825]
We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions.
The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix.
We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
arXiv Detail & Related papers (2023-04-12T18:10:47Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra [3.4137115855910767]
We propose a class of randomized quantum algorithms for the task of sampling from matrix functions.
Our use of qubits is purely algorithmic, and no additional qubits are required for quantum data structures.
arXiv Detail & Related papers (2023-02-03T17:22:49Z) - Demonstrating quantum computing with the quark model [0.0]
The use of quantum computing to solve a problem in quantum mechanics is illustrated, step by step, by calculating energies and transition amplitudes in a nonrelativistic quark model.
arXiv Detail & Related papers (2023-01-25T21:04:24Z) - Quantum representation of finite groups [0.0]
The concept of quantum representation of finite groups (QRFG) has been a fundamental aspect of quantum computing for quite some time.
We provide a formal definition of this concept using both group theory and differential geometry.
Our work proves the existence of a quantum representation for any finite group and outlines two methods for translating each generator of the group into a quantum circuit.
arXiv Detail & Related papers (2022-09-29T18:01:03Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system.
The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
arXiv Detail & Related papers (2021-08-30T16:30:33Z) - Quantum $\mathcal{R}$-matrices as universal qubit gates [0.9137554315375922]
We use quantum $mathcalR$-matrices as universal quantum gates and study the approximations of some one-qubit operations.
We make some modifications to the known Solovay-Kitaev algorithm suitable for our problem.
arXiv Detail & Related papers (2020-04-16T16:59:04Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.