State preparation of AGP on a quantum computer without number projection

• URL: http://arxiv.org/abs/2301.09586v2
• Date: Mon, 10 Apr 2023 18:23:40 GMT
• Title: State preparation of AGP on a quantum computer without number projection
• Authors: Armin Khamoshi and Rishab Dutta and Gustavo E. Scuseria
• Abstract summary: We show that the antisymmetrized geminal power (AGP) is equivalent to the number projected Bardeen-Schrieffer wavefunction. We also show that our circuit is equivalent to a disentangled unitary cluster coupled operator and a layer of unitary Jastrow operator acting on a single Slater.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The antisymmetrized geminal power (AGP) is equivalent to the number projected Bardeen-Cooper-Schrieffer (PBCS) wavefunction. It is also an elementary symmetric polynomial (ESP) state. We generalize previous research on deterministically implementing the Dicke state to a state preparation algorithm for an ESP state, or equivalently AGP, on a quantum computer. Our method is deterministic and has polynomial cost, and it does not rely on number symmetry breaking and restoration. We also show that our circuit is equivalent to a disentangled unitary paired coupled cluster operator and a layer of unitary Jastrow operator acting on a single Slater determinant. The method presented herein highlights the ability of disentangled unitary coupled cluster to capture non-trivial entanglement properties that are hardly accessible with traditional Hartree-Fock based electronic structure methods.

Related papers

• Projective Quantum Eigensolver with Generalized Operators [0.0]
  We develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples.
  arXiv  Detail & Related papers  (2024-10-21T15:40:22Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• 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)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Efficient classical algorithms for simulating symmetric quantum systems [4.416367445587541]
  We show that classical algorithms can efficiently emulate quantum counterparts given certain classical descriptions of the input. Specifically, we give classical algorithms that calculate ground states and time-evolved expectation values for permutation-invariantians specified in the symmetrized Pauli basis.
  arXiv  Detail & Related papers  (2022-11-30T13:53:16Z)
• AGP-based unitary coupled cluster theory for quantum computers [0.0]
  We develop a unitary coupled cluster method on the antisymmetrized geminal power (AGP) We demonstrate our method for the single-band Fermi--Hubbard Hamiltonian in one and two dimensions.
  arXiv  Detail & Related papers  (2022-05-26T15:17:44Z)
• $O(N^2)$ Universal Antisymmetry in Fermionic Neural Networks [107.86545461433616]
  We propose permutation-equivariant architectures, on which a determinant Slater is applied to induce antisymmetry. FermiNet is proved to have universal approximation capability with a single determinant, namely, it suffices to represent any antisymmetric function. We substitute the Slater with a pairwise antisymmetry construction, which is easy to implement and can reduce the computational cost to $O(N2)$.
  arXiv  Detail & Related papers  (2022-05-26T07:44:54Z)
• A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
  We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography. In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
  arXiv  Detail & Related papers  (2022-05-07T03:15:15Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Symmetry assisted preparation of entangled many-body states on a quantum computer [0.0]
  A method is proposed to construct entangled states that describe correlated many-body systems on quantum computers. Using operators for which the discrete set of eigenvalues is known, the QPE approach is followed by measurements that serve as projectors on the entangled states. These states can then be used as inputs for further quantum or hybrid quantum-classical processing.
  arXiv  Detail & Related papers  (2020-06-11T14:59:22Z)

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.