Towards solving the BCS Hamiltonian gap in Near-Term Quantum Computers
arXiv:2105.14936 · doi:10.1016/j.rinp.2022.106131
Abstract
In this work, using a NISQ framework, we obtain the gap of a BCS Hamiltonian. This could lead to interesting implications for superconductivity research. For such task, we choose to use the Variational Quantum Deflation and analyze the hardware restrictions that are needed to find the energy spectra on current quantum hardware. We also compare two different kinds of classical optimizers, Constrained Optimization BY Linear Approximations (COBYLA) and Simultaneous Perturbation Stochastic Approximation (SPSA), and study the effect of decoherence caused by the presence of noise when using simulations in real devices. We implement this method for a system with both 2 and 5 qubits. Furthermore, we show how to approximate the gap within one standard deviation, even with the presence of noise.
arXiv comment17 pages, 14 figures, Appendix
References in corpus (21)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Supervised learning with quantum enhanced feature spaces
- Barren plateaus in quantum neural network training landscapes
- A Quantum Approximate Optimization Algorithm
- Quantum computational chemistry
- Quantum fingerprinting
- Circuit-centric quantum classifiers
- Fermionic quantum computation
- Noise-Induced Barren Plateaus in Variational Quantum Algorithms
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Variational Quantum Computation of Excited States
- Robust determination of molecular spectra on a quantum processor
- Quantum-assisted quantum compiling
- Subspace-search variational quantum eigensolver for excited states
- Learning the quantum algorithm for state overlap
- Polynomial-Time Simulation of Pairing Models on a Quantum Computer
- Universal Variational Quantum Computation
- Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors