Comparison of encoding schemes for quantum computing of $S > 1/2$ spin chains

• URL: http://arxiv.org/abs/2502.18838v1
• Date: Wed, 26 Feb 2025 05:26:49 GMT
• Title: Comparison of encoding schemes for quantum computing of $S > 1/2$ spin chains
• Authors: Erik Lötstedt, Kaoru Yamanouchi,
• Abstract summary: We compare four different encoding schemes for the quantum computing of spin chains with a spin quantum number $S>1/2$.<n>The three different qubit encoding schemes are assessed by conducting Hamiltonian simulation for $1/2 le S le 5/2$ using a trapped-ion quantum computer.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We compare four different encoding schemes for the quantum computing of spin chains with a spin quantum number $S>1/2$: a compact mapping, a direct (or one-hot) mapping, a Dicke mapping, and a qudit mapping. The three different qubit encoding schemes are assessed by conducting Hamiltonian simulation for $1/2 \le S \le 5/2$ using a trapped-ion quantum computer. The qudit mapping is tested by running simulations with a simple noise model. The Dicke mapping, in which the spin states are encoded as superpositions of multi-qubit states, is found to be the most efficient because of the small number of terms in the qubit Hamiltonian. We also investigate the $S$-dependence of the time step length $\Delta\tau$ in the Suzuki-Trotter approximation and find that, in order to obtain the same accuracy for all $S$, $\Delta\tau$ should be inversely proportional to $S$.

Related papers

• Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched Execution [47.60253809426628]
  We present the Pre-Trajectory Sampling technique, increasing efficiency and utility of trajectory simulations by tailoring error types. We generate massive datasets of one trillion and one million shots, respectively.
  arXiv  Detail & Related papers  (2025-04-22T22:36:18Z)
• Scalable simulation of random quantum circuits using projected entangled-pair states [0.0]
  We use the simple update of projected entangled-pair states (PEPSs) in the Vidal gauge to simulate the states of random quantum circuits (RQCs) We find the universal scaling behaviors of the state fidelity by performing large-scale simulations for $n leq 104$ or $chi leq 128$ on a conventional CPU.
  arXiv  Detail & Related papers  (2025-04-07T06:47:48Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Towards multiqudit quantum processor based on a $^{171}$Yb$^{+}$ ion string: Realizing basic quantum algorithms [29.67699443799741]
  We demonstrate a quantum processor based on a 3D linear Paul trap that uses $171$Yb$+$ ions with 8 individually controllable four-level qudits (ququarts) The design of the developed ion trap provides high secular, low heating rate, which, together with individual addressing and readout optical systems, allows executing quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-05T15:48:43Z)
• The role of shared randomness in quantum state certification with unentangled measurements [36.19846254657676]
  We study quantum state certification using unentangled quantum measurements. $Theta(d2/varepsilon2)$ copies are necessary and sufficient for state certification. We develop a unified lower bound framework for both fixed and randomized measurements.
  arXiv  Detail & Related papers  (2024-01-17T23:44:52Z)
• 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)
• Quantum Metropolis-Hastings algorithm with the target distribution calculated by quantum Monte Carlo integration [0.0]
  Quantum algorithms for MCMC have been proposed, yielding the quadratic speedup with respect to the spectral gap $Delta$ compered to classical counterparts. We consider not only state generation but also finding a credible interval for a parameter, a common task in Bayesian inference. In the proposed method for credible interval calculation, the number of queries to the quantum circuit to compute $ell$ scales on $Delta$, the required accuracy $epsilon$ and the standard deviation $sigma$ of $ell$ as $tildeO(sigma/epsilon
  arXiv  Detail & Related papers  (2023-03-10T01:05:16Z)
• 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)
• On quantum algorithms for the Schr\"odinger equation in the semi-classical regime [27.175719898694073]
  We consider Schr"odinger's equation in the semi-classical regime. Such a Schr"odinger equation finds many applications, including in Born-Oppenheimer molecular dynamics and Ehrenfest dynamics.
  arXiv  Detail & Related papers  (2021-12-25T20:01:54Z)
• How to simulate quantum measurement without computing marginals [3.222802562733787]
  We describe and analyze algorithms for classically computation measurement of an $n$-qubit quantum state $psi$ in the standard basis. Our algorithms reduce the sampling task to computing poly(n)$ amplitudes of $n$-qubit states.
  arXiv  Detail & Related papers  (2021-12-15T21:44:05Z)
• Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm [0.0]
  Algorithm is up to $2$ orders of magnitudes faster than Sch$ddottexto$dinger-Feynman algorithm. We simulate larger random quantum circuits up to $104$ qubits, showing that this algorithm is an ideal tool to verify relatively shallow quantum circuits on near-term quantum computers.
  arXiv  Detail & Related papers  (2020-11-05T02:20:56Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• 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.