ترغب بنشر مسار تعليمي؟ اضغط هنا

Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian

132   0   0.0 ( 0 )
 نشر من قبل Sam McArdle
 تاريخ النشر 2021
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

Achieving an accurate description of fermionic systems typically requires considerably many more orbitals than fermions. Previous resource analyses of quantum chemistry simulation often failed to exploit this low fermionic number information in the implementation of Trotter-based approaches and overestimated the quantum-computer runtime as a result. They also depended on numerical procedures that are computationally too expensive to scale up to large systems of practical interest. Here we propose techniques that solve both problems by using various factorized decompositions of the electronic structure Hamiltonian. We showcase our techniques for the uniform electron gas, finding substantial (over 100x) improvements in Trotter error for low-filling fraction and pushing to much higher numbers of orbitals than is possible with existing methods. Finally, we calculate the T-count to perform phase-estimation on Jellium. In the low-filling regime, we observe improvements in gate complexity of over 10x compared to the best Trotter-based approach reported to date. We also report gate counts competitive with qubitization-based approaches for Wigner-Seitz values of physical interest.



قيم البحث

اقرأ أيضاً

65 - Qi Zhao , Xiao Yuan 2021
Quantum computing can efficiently simulate Hamiltonian dynamics of many-body quantum physics, a task that is generally intractable with classical computers. The hardness lies at the ubiquitous anti-commutative relations of quantum operators, in corre sponding with the notorious negative sign problem in classical simulation. Intuitively, Hamiltonians with more commutative terms are also easier to simulate on a quantum computer, and anti-commutative relations generally cause more errors, such as in the product formula method. Here, we theoretically explore the role of anti-commutative relation in Hamiltonian simulation. We find that, contrary to our intuition, anti-commutative relations could also reduce the hardness of Hamiltonian simulation. Specifically, Hamiltonians with mutually anti-commutative terms are easy to simulate, as what happens with ones consisting of mutually commutative terms. Such a property is further utilized to reduce the algorithmic error or the gate complexity in the truncated Taylor series quantum algorithm for general problems. Moreover, we propose two modified linear combinations of unitaries methods tailored for Hamiltonians with different degrees of anti-commutation. We numerically verify that the proposed methods exploiting anti-commutative relations could significantly improve the simulation accuracy of electronic Hamiltonians. Our work sheds light on the roles of commutative and anti-commutative relations in simulating quantum systems.
Quantum simulations of electronic structure with transformed ab initio Hamiltonians that include some electron correlation effects a priori are demonstrated. The transcorrelated Hamiltonians used in this work are efficiently constructed classically, at polynomial cost, by an approximate similarity transformation with an explicitly correlated two-body unitary operator; they are Hermitian, include up to two-particle interactions, and are free of electron-electron singularities. To investigate whether the use of such transformed Hamiltonians can reduce resource requirements for general quantum solvers for the Schrodinger equation, we explore the accuracy and the computational cost of the quantum variational eigensolver, based on the unitary coupled cluster with singles and doubles (q-UCCSD). Our results demonstrate that transcorrelated Hamiltonians, paired with extremely compact bases, produce explicitly correlated energies comparable to those from much larger bases. The use of transcorrelated Hamiltonians reduces the number of CNOT gates by up to two orders of magnitude, and the number of qubits by a factor of three.
In this work we investigate methods to improve the efficiency and scalability of quantum algorithms for quantum chemistry applications. We propose a transformation of the electronic structure Hamiltonian in the second quantization framework into the particle-hole (p/h) picture, which offers a better starting point for the expansion of the trial wavefunction. The state of the molecular system at study is parametrized in a way to efficiently explore the sector of the molecular Fock space that contains the desired solution. To this end, we explore several trial wavefunctions to identify the most efficient parameterization of the molecular ground state. Taking advantage of known post-Hartree Fock quantum chemistry approaches and heuristic Hilbert space search quantum algorithms, we propose a new family of quantum circuits based on exchange-type gates that enable accurate calculations while keeping the gate count (i.e., the circuit depth) low. The particle-hole implementation of the Unitary Coupled Cluster (UCC) method within the Variational Quantum Eigensolver approach gives rise to an efficient quantum algorithm, named q-UCC , with important advantages compared to the straightforward translation of the classical Coupled Cluster counterpart. In particular, we show how a single Trotter step can accurately and efficiently reproduce the ground state energies of simple molecular systems.
We present a technique that improves the signal-to-noise-ratio (SNR) of range-finding, sensing, and other light-detection applications. The technique filters out low photon numbers using photon-number-resolving detectors (PNRDs). This technique has n o classical analog and cannot be done with classical detectors. We investigate the properties of our technique and show under what conditions the scheme surpasses the classical SNR. Finally, we simulate the operation of a rangefinder, showing improvement with a low number of signal samplings and confirming the theory with a high number of signal samplings.
After providing a general formulation of Fermion flows within the context of Hudson-Parthasarathy quantum stochastic calculus, we consider the problem of determining the noise coefficients of the Hamiltonian associated with a Fermion flow so as to mi nimize a naturally associated quadratic performance functional. This extends to Fermion flows results of the authors previously obtained for Boson flows .
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا