Quantum computation of nuclear observables involving linear combination of unitary operators

• URL: http://arxiv.org/abs/2206.08510v1
• Date: Fri, 17 Jun 2022 02:04:56 GMT
• Title: Quantum computation of nuclear observables involving linear combination of unitary operators
• Authors: Pooja Siwach and P. Arumugam
• Abstract summary: We present the quantum computation of nuclear observables where the operators of interest are first decomposed in terms of the linear combination of unitaries. We apply these methods to calculate the electric quadrupole moment of deuteron.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present the quantum computation of nuclear observables where the operators of interest are first decomposed in terms of the linear combination of unitaries. Then we utilise the Hadamard test and the linear combination of unitaries (LCU) based methods to compute the expectation values. We apply these methods to calculate the electric quadrupole moment of deuteron. The results are compared for the Jordan-Wigner transformation and Gray code encoding. We discuss the versatility of our approach that can be utilized in general to calculate several observables on a quantum computer.

Related papers

• Simulating NMR Spectra with a Quantum Computer [49.1574468325115]
  This paper provides a formalization of the complete procedure of the simulation of a spin system's NMR spectrum. We also explain how to diagonalize the Hamiltonian matrix with a quantum computer, thus enhancing the overall process's performance.
  arXiv  Detail & Related papers  (2024-10-28T08:43:40Z)
• An efficient finite-resource formulation of non-Abelian lattice gauge theories beyond one dimension [0.0]
  We propose a resource-efficient method to compute the running of the coupling in non-Abelian gauge theories beyond one spatial dimension. Our method enables computations at arbitrary values of the bare coupling and lattice spacing with current quantum computers, simulators and tensor-network calculations.
  arXiv  Detail & Related papers  (2024-09-06T17:59:24Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantization of Large Language Models with an Overdetermined Basis [73.79368761182998]
  We introduce an algorithm for data quantization based on the principles of Kashin representation. Our findings demonstrate that Kashin Quantization achieves competitive or superior quality in model performance.
  arXiv  Detail & Related papers  (2024-04-15T12:38:46Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Bootstrap methods for digitized scalar field theory [0.0]
  General positivity constraints linking various powers of observables in energy eigenstates can be used to locate acceptable regions for the energy eigenvalues. Recursive methods are derived by looking at the commutation relations of the observables with the Hamiltonian. We discuss how this self-consistent (bootstrap) approach can be applied to the study of digitized scalar field theory in the harmonic basis.
  arXiv  Detail & Related papers  (2023-12-16T23:17:58Z)
• Generalised Coupling and An Elementary Algorithm for the Quantum Schur Transform [0.0]
  We present a transparent algorithm for implementing the qubit quantum Schur transform. We study the associated Schur states, which consist of qubits coupled via Clebsch-Gordan coefficients. It is shown that Wigner 6-j symbols and SU(N) Clebsch-Gordan coefficients naturally fit our framework.
  arXiv  Detail & Related papers  (2023-05-06T15:19:52Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Quantum machine learning with adaptive linear optics [0.0]
  We study supervised learning algorithms in which a quantum device is used to perform a computational subroutine. We design implementations of these quantum subroutines using Boson Sampling architectures in linear optics, supplemented by adaptive measurements.
  arXiv  Detail & Related papers  (2021-02-08T23:56:49Z)
• Quantum Algorithms for Estimating Physical Quantities using Block-Encodings [0.30458514384586405]
  We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. All algorithms are based on block-encodings - a technique for the manipulation of arbitrary non-unitary combinations on a quantum computer.
  arXiv  Detail & Related papers  (2020-04-14T23:15:39Z)

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.