Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGutzwiller wave function on a digital quantum computer
107
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The determination of the ground state of quantum many-body systems via digital quantum computers rests upon the initialization of a sufficiently educated guess. This requirement becomes more stringent the greater the system. Preparing physically-motivated ans{a}tze on quantum hardware is therefore important to achieve quantum advantage in the simulation of correlated electrons. In this spirit, we introduce the Gutzwiller Wave Function (GWF) within the context of the digital quantum simulation of the Fermi-Hubbard model. We present a quantum routine to initialize the GWF that comprises two parts. In the first, the noninteracting state associated with the $U = 0$ limit of the model is prepared. In the second, the non-unitary Gutzwiller projection that selectively removes states with doubly-occupied sites from the wave function is performed by adding to every lattice site an ancilla qubit, the measurement of which in the $|0rangle$ state confirms the projection was made. Due to its non-deterministic nature, we estimate the success rate of the algorithm in generating the GWF as a function of the lattice size and the interaction strength $U/t$. The scaling of the quantum circuit metrics and its integration in general quantum simulation algorithms are also discussed.
rate research
Read More
For variational algorithms on the near term quantum computing hardware, it is highly desirable to use very accurate ansatze with low implementation cost. Recent studies have shown that the antisymmetrized geminal power (AGP) wavefunction can be an excellent starting point for ansatze describing systems with strong pairing correlations, as those occurring in superconductors. In this work, we show how AGP can be efficiently implemented on a quantum computer with circuit depth, number of CNOTs, and number of measurements being linear in system size. Using AGP as the initial reference, we propose and implement a unitary correlator on AGP and benchmark it on the ground state of the pairing Hamiltonian. The results show highly accurate ground state energies in all correlation regimes of this model Hamiltonian.
We present an algorithm that extends existing quantum algorithms for simulating fermion systems in quantum chemistry and condensed matter physics to include bosons in general and phonons in particular. We introduce a qubit representation for the low-energy subspace of phonons which allows an efficient simulation of the evolution operator of the electron-phonon systems. As a consequence of the Nyquist-Shannon sampling theorem, the phonons are represented with exponential accuracy on a discretized Hilbert space with a size that increases linearly with the cutoff of the maximum phonon number. The additional number of qubits required by the presence of phonons scales linearly with the size of the system. The additional circuit depth is constant for systems with finite-range electron-phonon and phonon-phonon interactions and linear for long-range electron-phonon interactions. Our algorithm for a Holstein polaron problem was implemented on an Atos Quantum Learning Machine (QLM) quantum simulator employing the Quantum Phase Estimation method. The energy and the phonon number distribution of the polaron state agree with exact diagonalization results for weak, intermediate and strong electron-phonon coupling regimes.
The ferromagnetic state of an Ising chain can represent a two-fold degenerate subspace or equivalently a logical qubit which is protected from excitations by an energy gap. We study a a braiding-like exchange operation through the movement of the state in the qubit subspace which resembles that of the localized edge modes in a Kitaev chain. The system consists of two Ising chains in a 1D geometry where the operation is simulated through the adiabatic time evolution of the ground state. The time evolution is implemented via the Suzuki-Trotter expansion on basic single- and two-qubit quantum gates using IBMs Aer QASM simulator. The fidelity of the system is investigated as a function of the evolution and system parameters to obtain optimum efficiency and accuracy for different system sizes. Various aspects of the implementation including the circuit depth, Trotterization error, and quantum gate errors pertaining to the Noisy Intermediate-Scale Quantum (NISQ) hardware are discussed as well. We show that the quantum gate errors, i.e. bit-flip, phase errors, are the dominating factor in determining the fidelity of the system as the Trotter error and the adiabatic condition are less restrictive even for modest values of Trotter time steps. We reach an optimum fidelity $>99%$ on systems of up to $11$ sites per Ising chain and find that the most efficient implementation of a single braiding-like operation for a fidelity above $90%$ requires a circuit depth of the order of $sim 10^{3}$ restricting the individual gate errors to be less than $sim 10^{-6}$ which is prohibited in current NISQ hardware.
We develop a workflow to use current quantum computing hardware for solving quantum many-body problems, using the example of the fermionic Hubbard model. Concretely, we study a four-site Hubbard ring that exhibits a transition from a product state to an intrinsically interacting ground state as hopping amplitudes are changed. We locate this transition and solve for the ground state energy with high quantitative accuracy using a variational quantum algorithm executed on an IBM quantum computer. Our results are enabled by a variational ansatz that takes full advantage of the maximal set of commuting $mathbb{Z}_2$ symmetries of the problem and a Lanczos-inspired error mitigation algorithm. They are a benchmark on the way to exploiting near term quantum simulators for quantum many-body problems.
Domains are homogeneous areas of discrete symmetry, created in nonequilibrium phase transitions. They are separated by domain walls, topological objects which prevent them from fusing together. Domains may reconfigure by thermally-driven microscopic processes, and in quantum systems, by macroscopic quantum tunnelling. The underlying microscopic physics that defines the systems energy landscape for tunnelling is of interest in many different systems, from cosmology and other quantum domain systems, and more generally to nuclear physics, matter waves, magnetism, and biology. A unique opportunity to investigate the dynamics of microscopic correlations leading to emergent behaviour, such as quantum domain dynamics is offered by quantum materials. Here, as a direct realization of Feynmans idea of using a quantum computer to simulate a quantum system, we report an investigation of quantum electron reconfiguration dynamics and domain melting in two matching embodiments: a prototypical two-dimensionally electronically ordered solid-state quantum material and a simulation on a latest-generation quantum simulator. We use scanning tunnelling microscopy to measure the time-evolution of electronic domain reconfiguration dynamics and compare this with the time evolution of domains in an ensemble of entangled correlated electrons in simulated quantum domain melting. The domain reconfiguration is found to proceed by tunnelling in an emergent, self-configuring energy landscape, with characteristic step-like time evolution and temperature-dependences observed macroscopically. The remarkable correspondence in the dynamics of a quantum material and a quantum simulation opens the way to an understanding of emergent behaviour in diverse interacting many-body quantum systems at the microscopic level.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
