Understanding and predicting the properties of solid-state materials from first principles has been a great challenge for decades. Owing to the recent advances in quantum technologies, quantum computations offer a promising way to achieve this goal. Here, we demonstrate the first-principles calculation of a quasiparticle band structure on actual quantum computers. This is achieved by hybrid quantum-classical algorithms in conjunction with qubit-reduction and error-mitigation techniques. Our demonstration will pave the way to practical applications of quantum computers. Published by the American Physical Society 2024
Understanding and predicting the properties of solid-state materials from first principles has been a great challenge for decades. Owing to the recent advances in quantum technologies, quantum computations offer a promising way to achieve this goal. Here, we demonstrate the first-principles calculation of a quasiparticle band structure on actual quantum computers. This is achieved by hybrid quantum-classical algorithms in conjunction with qubit-reduction and error-mitigation techniques. Our demonstration will pave the way to practical applications of quantum computers. Published by the American Physical Society 2024
Development of quantum architectures during the last decade has inspired hybrid classical-quantum algorithms in physics and quantum chemistry that promise simulations of fermionic systems beyond the capability of modern classical computers, even before the era of quantum computing fully arrives. Strong research efforts have been recently made to obtain minimal depth quantum circuits which could accurately represent chemical systems. Here, we show that unprecedented methods used in quantum chemistry, designed to simulate molecules on quantum processors, can be extended to calculate properties of periodic solids. In particular, we present minimal depth circuits implementing the variational quantum eigensolver algorithm and successfully use it to compute the band structure of silicon on a quantum machine for the first time. We are convinced that the presented quantum experiments performed on cloud-based platforms will stimulate more intense studies towards scalable electronic structure computation of advanced quantum materials.
Quasiparticle band structures are fundamental for understanding strongly correlated electron systems. While solving these structures accurately on classical computers is challenging, quantum computing offers a promising alternative. Specifically, the quantum subspace expansion (QSE) method, combined with the variational quantum eigensolver (VQE), provides a quantum algorithm for calculating quasiparticle band structures. However, optimizing the variational parameters in VQE becomes increasingly difficult as the system size grows, due to device noise, statistical noise, and the barren plateau problem. To address these challenges, we propose a hybrid approach that combines QSE with the quantum-selected configuration interaction (QSCI) method for calculating quasiparticle band structures. QSCI may leverage the VQE ansatz as an input state but, unlike the standard VQE, it does not require full optimization of the variational parameters, making it more scalable for larger quantum systems. Based on this approach, we demonstrate the quantum computation of the quasiparticle band structure of a silicon using 16 qubits on an IBM quantum processor.
Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates these two methods, inheriting their distinct features in efficient representation and manipulation of quantum states and overcoming their limitations. We first introduce non-stoquasticity indicators (NSIs) and their upper bounds, which measure the sign problem, the most notable limitation of QMC. We show that our algorithm could greatly mitigate the sign problem, which decreases NSIs with the assistance of quantum computing. Meanwhile, the use of quantum Monte Carlo also increases the expressivity of shallow quantum circuits, allowing more accurate computation that is conventionally achievable only with much deeper circuits. We numerically test and verify the method for the N2 molecule (12 qubits) and the Hubbard model (16 qubits). Our work paves the way to solving practical problems with intermediate-scale and early-fault tolerant quantum computers, with potential applications in chemistry, condensed matter physics, materials, high energy physics, etc.
Abstract: Quantum computing is a new type of computing that uses the principles of quantum physics to perform calculations in ways that are not possible with traditional computers. Unlike classical computers, which process information using bits that are either 0 or 1, quantum computers use quantum bits (qubits) that can exist in multiple states at the same time. This ability allows quantum systems to solve certain complex problems much faster than classical machines. This paper presents a simple and human-centered explanation of quantum computing, focusing on how it works, why it matters, and how it can be applied in real-world situations. The study discusses key concepts such as superposition, entanglement, and quantum gates using easy-to-understand language. It also explores practical applications including cryptography, optimization, drug discovery, and material simulation. In addition, this paper examines the current challenges in quantum computing, such as hardware instability, error correction, limited qubit scalability, and high implementation cost. A conceptual hybrid classical–quantum system model is proposed to show how quantum and classical computers can work together to solve complex problems more efficiently. The goal of this research is to make quantum computing more understandable to students, educators, and decision-makers, and to encourage early awareness and responsible development of this powerful technology. Keywords — quantum computing, qubit, superposition, entanglement, quantum gate, error correction, hybrid computing
Abstract Quantum computers hold promise to enable efficient simulations of the properties of molecules and materials; however, at present they only permit ab initio calculations of a few atoms, due to a limited number of qubits. In order to harness the power of near-term quantum computers for simulations of larger systems, it is desirable to develop hybrid quantum-classical methods where the quantum computation is restricted to a small portion of the system. This is of particular relevance for molecules and solids where an active region requires a higher level of theoretical accuracy than its environment. Here, we present a quantum embedding theory for the calculation of strongly-correlated electronic states of active regions, with the rest of the system described within density functional theory. We demonstrate the accuracy and effectiveness of the approach by investigating several defect quantum bits in semiconductors that are of great interest for quantum information technologies. We perform calculations on quantum computers and show that they yield results in agreement with those obtained with exact diagonalization on classical architectures, paving the way to simulations of realistic materials on near-term quantum computers.