Adaptive variational ground state preparation for spin-1 models on qubit-based architectures

• URL: http://arxiv.org/abs/2310.03705v1
• Date: Thu, 5 Oct 2023 17:30:47 GMT
• Title: Adaptive variational ground state preparation for spin-1 models on qubit-based architectures
• Authors: Jo\~ao C. Getelina, Cai-Zhuang Wang, Thomas Iadecola, Yong-Xin Yao, Peter P. Orth
• Abstract summary: We apply the adaptive variational quantum imaginary time evolution (AVQITE) method to prepare ground states of one-dimensional spin $S=1$ models. We compare different spin-to-qubit encodings with regard to the performance and quantum resource cost of the algorithm.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We apply the adaptive variational quantum imaginary time evolution (AVQITE) method to prepare ground states of one-dimensional spin $S=1$ models. We compare different spin-to-qubit encodings (standard binary, Gray, unary, and multiplet) with regard to the performance and quantum resource cost of the algorithm. Using statevector simulations we study two well-known spin-1 models: the Blume-Capel model of transverse-field Ising spins with single-ion anisotropy, and the XXZ model with single-ion anisotropy. We consider system sizes of up to $20$ qubits, which corresponds to spin-$1$ chains up to length $10$. We determine the dependence of the number of CNOT gates in the AVQITE state preparation circuit on the encoding, the initial state, and the choice of operator pool in the adaptive method. Independent on the choice of encoding, we find that the CNOT gate count scales cubically with the number of spins for the Blume-Capel model and quartically for the anistropic XXZ model. However, the multiplet and Gray encodings present smaller prefactors in the scaling relations. These results provide useful insights for the implementation of AVQITE on quantum hardware.

Related papers

• Unveiling Induction Heads: Provable Training Dynamics and Feature Learning in Transformers [54.20763128054692]
  We study how a two-attention-layer transformer is trained to perform ICL on $n$-gram Markov chain data. We prove that the gradient flow with respect to a cross-entropy ICL loss converges to a limiting model.
  arXiv  Detail & Related papers  (2024-09-09T18:10:26Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Sachdev-Ye-Kitaev model on a noisy quantum computer [1.0377683220196874]
  We study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. We compute return probability after time $t$ and out-of-time order correlators (OTOC) which is a standard observable of quantifying the chaotic nature of quantum systems.
  arXiv  Detail & Related papers  (2023-11-29T19:00:00Z)
• Cellular automata in $d$ dimensions and ground states of spin models in $(d+1)$ dimensions [0.0]
  We show how the trajectories of $d$-dimensional cellular automata (CA) can be used to determine the ground states of $(d+1)$-dimensional classical spin models.
  arXiv  Detail & Related papers  (2023-09-14T23:03:14Z)
• Transformers as Support Vector Machines [54.642793677472724]
  We establish a formal equivalence between the optimization geometry of self-attention and a hard-margin SVM problem. We characterize the implicit bias of 1-layer transformers optimized with gradient descent. We believe these findings inspire the interpretation of transformers as a hierarchy of SVMs that separates and selects optimal tokens.
  arXiv  Detail & Related papers  (2023-08-31T17:57:50Z)
• Variational Quantum Eigensolver Ansatz for the $J_1$-$J_2$-model [0.0]
  We propose an ansatz for the Variational Quantum Eigensolver (VQE) to approximate the ground state of an antiferromagnetic $J_J$-ian. We demonstrate that this ansatz can work without the need for gates along the diagonal next-nearest neighbor interactions.
  arXiv  Detail & Related papers  (2022-05-23T11:08:54Z)
• Dynamical quantum phase transitions in spin-$S$ $\mathrm{U}(1)$ quantum link models [0.0]
  Dynamical quantum phase transitions (DQPTs) are a powerful concept of probing far-from-equilibrium criticality in quantum many-body systems. We use infinite matrix product state techniques to study DQPTs in spin-$S$ $mathrmU(1)$ quantum link models. Our findings indicate that DQPTs are fundamentally different between the Wilson--Kogut--Susskind limit and its representation through the quantum link formalism.
  arXiv  Detail & Related papers  (2022-03-02T19:00:02Z)
• Scaling Structured Inference with Randomization [64.18063627155128]
  We propose a family of dynamic programming (RDP) randomized for scaling structured models to tens of thousands of latent states. Our method is widely applicable to classical DP-based inference. It is also compatible with automatic differentiation so can be integrated with neural networks seamlessly.
  arXiv  Detail & Related papers  (2021-12-07T11:26:41Z)
• Prospects for Simulating a Qudit Based Model of (1+1)d Scalar QED [0.0]
  We provide a construction of the Trotter operator in terms of a universal qudit-gate set. We show that a simple initial state could be simulated on current qutrit based hardware using noisy simulations for two different native gate set.
  arXiv  Detail & Related papers  (2021-04-20T17:27:35Z)
• Learning to Encode Position for Transformer with Continuous Dynamical Model [88.69870971415591]
  We introduce a new way of learning to encode position information for non-recurrent models, such as Transformer models. We model the evolution of encoded results along position index by such a dynamical system.
  arXiv  Detail & Related papers  (2020-03-13T00:41:41Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.