ﻻ يوجد ملخص باللغة العربية
The exact evaluation of the molecular ground state in quantum chemistry requires an exponential increasing computational cost. Quantum computation is a promising way to overcome the exponential problem using polynomial-time quantum algorithms. A quantum-classical hybrid optimization scheme known as the variational quantum eigensolver (VQE) is preferred for this task for noisy intermediate-scale quantum devices. However, the circuit depth becomes one of the bottlenecks of its application to large molecules of more than 20 qubits. In this work, we propose a new strategy by employing the point group symmetry to reduce the number of operators in constructing ansatz to achieve a more compact quantum circuit. We illustrate this methodology with a series of molecules ranging from LiH (12 qubits) to C2H4 (28 qubits). A significant reduction of up to 82% of the operator numbers is reached on C2H4, which enables the largest molecule ever simulated by VQE to the best of our knowledge.
A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence time. A way to stay within the limits of coherence
Simulating molecules is believed to be one of the early-stage applications for quantum computers. Current state-of-the-art quantum computers are limited in size and coherence, therefore optimizing resources to execute quantum algorithms is crucial. I
We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accom
In astrophysical scenarios with large neutrino density, like supernovae and the early universe, the presence of neutrino-neutrino interactions can give rise to collective flavor oscillations in the out-of-equilibrium collective dynamics of a neutrino
Quantum Monte Carlo and quantum simulation are both important tools for understanding quantum many-body systems. As a classical algorithm, quantum Monte Carlo suffers from the sign problem, preventing its applications to most fermion systems and real