Variational simulation of $d$-level systems on qubit-based quantum simulators

• URL: http://arxiv.org/abs/2405.05051v2
• Date: Tue, 25 Jun 2024 11:08:53 GMT
• Title: Variational simulation of $d$-level systems on qubit-based quantum simulators
• Authors: Chufan Lyu, Zuoheng Zou, Xusheng Xu, Man-Hong Yung, Abolfazl Bayat,
• Abstract summary: Many systems in nature are inherently $d$-level, including higher spins, bosons, vibrational modes, and electrons. To simulate $d$-level systems on qubit-based quantum simulators, an encoding method is required to map the $d$-level system onto a qubit basis. We develop a systematic method to address the illegitimate states in the Hilbert space.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Current quantum simulators are primarily qubit-based, making them naturally suitable for simulating 2-level quantum systems. However, many systems in nature are inherently $d$-level, including higher spins, bosons, vibrational modes, and itinerant electrons. To simulate $d$-level systems on qubit-based quantum simulators, an encoding method is required to map the $d$-level system onto a qubit basis. Such mapping may introduce illegitimate states in the Hilbert space which makes the simulation more sophisticated. In this paper, we develop a systematic method to address the illegitimate states. In addition, we compare two different mappings, namely binary and symmetry encoding methods, and compare their performance through variational simulation of the ground state and time evolution of various many-body systems. While binary encoding is very efficient with respect to the number of qubits it cannot easily incorporate the symmetries of the original Hamiltonian in its circuit design. On the other hand, the symmetry encoding facilitates the implementation of symmetries in the circuit design, though it comes with an overhead for the number of qubits. Our analysis shows that the symmetry encoding significantly outperforms the binary encoding, despite requiring extra qubits. Their advantage is indicated by requiring fewer two-qubit gates, converging faster, and being far more resilient to Barren plateaus. We have performed variational ground state simulations of spin-1, spin-3/2, and bosonic systems as well as variational time evolution of spin-1 systems. Our proposal can be implemented on existing quantum simulators and its potential is extendable to a broad class of physical models.

Related papers

• Simulating electronic structure on bosonic quantum computers [35.884125235274865]
  One of the most promising applications of quantum computing is the simulation of many-fermion problems. We show how an electronic structure Hamiltonian can be transformed into a system of qumodes through qubit-assisted fermion-to-qumode mapping.
  arXiv  Detail & Related papers  (2024-04-16T02:04:11Z)
• Classical Chaos in Quantum Computers [39.58317527488534]
  Current-day quantum processors, comprising 50-100 qubits, operate outside the range of quantum simulation on classical computers. We demonstrate that the simulation of classical limits can be a potent diagnostic tool potentially mitigating this problem. We find that classical and quantum simulations lead to similar stability metrics in systems with $mathcalO$ transmons.
  arXiv  Detail & Related papers  (2023-04-27T18:00:04Z)
• Efficient Quantum Simulation of Electron-Phonon Systems by Variational Basis State Encoder [12.497706003633391]
  Digital quantum simulation of electron-phonon systems requires truncating infinite phonon levels into $N$ basis states. We propose a variational basis state encoding algorithm that reduces the scaling of the number of qubits and quantum gates.
  arXiv  Detail & Related papers  (2023-01-04T04:23:53Z)
• Investigating Quantum Many-Body Systems with Tensor Networks, Machine Learning and Quantum Computers [0.0]
  We perform quantum simulation on classical and quantum computers. We map out phase diagrams of known and unknown quantum many-body systems in an unsupervised fashion.
  arXiv  Detail & Related papers  (2022-10-20T09:46:25Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Qubit-efficient encoding scheme for quantum simulations of electronic structure [5.16230883032882]
  Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. We propose a qubit-efficient encoding scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries. Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era.
  arXiv  Detail & Related papers  (2021-10-08T13:20:18Z)
• Supercomputer simulations of transmon quantum computers [0.0]
  We develop a simulator for quantum computers composed of superconducting transmon qubits. We present results for the simulation of up to 16 transmons and resonators. We also demonstrate the transition from an isolated system to an open quantum system governed by a Lindblad master equation.
  arXiv  Detail & Related papers  (2020-08-31T11:07:02Z)
• Bit-Slicing the Hilbert Space: Scaling Up Accurate Quantum Circuit Simulation to a New Level [10.765480856320018]
  We enhance quantum circuit simulation in two dimensions: accuracy and scalability. Experimental results demonstrate that our method can be superior to the state-of-the-art for various quantum circuits.
  arXiv  Detail & Related papers  (2020-07-18T01:26:40Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.