Application of fermionic marginal constraints to hybrid quantum algorithms
From MaRDI portal
Publication:6549789
DOI10.1088/1367-2630/AAB919zbMATH Open1545.81054MaRDI QIDQ6549789
Ryan Babbush, Jarrod R. McClean, Nicholas C. Rubin
Publication date: 4 June 2024
Published in: New Journal of Physics (Search for Journal in Brave)
Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Quantum state spaces, operational and probabilistic concepts (81P16) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Title not available (Why is that?)
- Computing the nearest correlation matrix--a problem from finance
- A boundary point method to solve semidefinite programs
- Computing a nearest symmetric positive semidefinite matrix
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Reduced density matrices. Coulson's challenge
- Local minima and convergence in low-rank semidefinite programming
- Universal Quantum Simulators
- Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer
- Consistency of Local Density Matrices Is QMA-Complete
- Mapping local Hamiltonians of fermions to local Hamiltonians of spins
- Bounding the costs of quantum simulation of many-body physics in real space
- Lower bounds for ground states of condensed matter systems
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Faster quantum chemistry simulation on fault-tolerant quantum computers
- Reduction of the N-Particle Variational Problem
- The theory of variational hybrid quantum-classical algorithms
- Exponentially more precise quantum simulation of fermions in second quantization
Related Items (1)
This page was built for publication: Application of fermionic marginal constraints to hybrid quantum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549789)
