Deterministic Storage of Quantum Information in the Genetic Code

• URL: http://arxiv.org/abs/2412.07504v1
• Date: Tue, 10 Dec 2024 13:36:31 GMT
• Title: Deterministic Storage of Quantum Information in the Genetic Code
• Authors: Roberto Rivelino,
• Abstract summary: DNA has been proposed as a chemical platform for computing and data storage. This paper explores DNA base pairs as elementary units for a scalable nuclear magnetic resonance quantum computer.
• Score: 0.0
• License:
• Abstract: DNA has been proposed as a chemical platform for computing and data storage, paving the way for building DNA-based computers. Recently, DNA has been hypothesized as an ideal quantum computer with the base pairs working as Josephson junctions. There are still major challenges to be overcome in these directions, but they do not prevent deviceful perspectives of the main problem. The present paper explores DNA base pairs as elementary units for a scalable nuclear magnetic resonance quantum computer (NMRQC). First, it presents an overview of the proton transfer (PT) mechanism during the prototropic tautomerism in the base pairs, scoring the current stage. Second, as a proof-of-principle, the paper examines these molecular structures as quantum processing units (QPUs) of a biochemical quantum device. For the model proposed here, it is theoretically demonstrated that the nuclear spins involved in the PT of base pairs can be deterministically prepared in a superposition of triplet states. Under appropriate conditions, the proton dynamics provides the minimal two-qubit entanglement required for quantum computing. The dynamics between the canonical and tautomeric quantum states (CQS and TQS, respectively) is determined from a thermally dependent Watson-Crick quantum superposition (WCQS); i.e., |WCQS> = a(T)|CQS> + b(T)|TQS> with |a(T)|^2 + |b(T)|^2 = 1. If the DNA structure is sufficiently protected to avoid environment-induced decoherence of the confined-proton quantum states, quantum information can be successfully encoded in several base pairs along the coiled double strand. As a potential applicability, a crystalline DNA device could be employed for quantum computing and cryptography controlled by a sequence of Ramsey pulses. Finally, this study critically evaluates these possibilities toward a proof-of-concept of a DNA-based quantum computer.

Related papers

• Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
  Quantum homogenization is a reservoir-based quantum state approximation protocol. We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation. We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
  arXiv  Detail & Related papers  (2024-12-19T05:50:54Z)
• Quantum-centric computation of molecular excited states with extended sample-based quantum diagonalization [0.0]
  The simulation of molecular electronic structure is an important application of quantum devices. We extend the sample-based quantum diagonalization (SQD) algorithm to determine low-lying molecular excited states.
  arXiv  Detail & Related papers  (2024-11-01T09:33:08Z)
• Characterizing conical intersections of nucleobases on quantum computers [3.938743052376337]
  We present the first quantum simulation of conical intersections (CIs) in a biomolecule, cytosine, using a superconducting quantum computer. We apply the Contracted Quantum Eigensolver (CQE) to compute the near-degenerate ground and excited states associated with the conical intersection.
  arXiv  Detail & Related papers  (2024-10-24T17:00:26Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• Chemistry Beyond Exact Solutions on a Quantum-Centric Supercomputer [2.562863293556441]
  A universal quantum computer can be used as a simulator capable of predicting properties of diverse quantum systems. Electronic structure problems in chemistry offer practical use cases around the hundredqubit mark. For pre-fault-tolerant quantum processors, the large number of measurements to estimate molecular energies leads to prohibitive runtimes.
  arXiv  Detail & Related papers  (2024-05-08T14:08:07Z)
• On the feasibility of performing quantum chemistry calculations on quantum computers [0.0]
  We propose two criteria for evaluating two leading quantum approaches for finding the ground state of molecules. The first criterion applies to the variational quantum eigensolver (VQE) algorithm. The second criterion applies to the quantum phase estimation (QPE) algorithm.
  arXiv  Detail & Related papers  (2023-06-05T06:41:22Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Computing molecular excited states on a D-Wave quantum annealer [52.5289706853773]
  We demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems. These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience.
  arXiv  Detail & Related papers  (2021-07-01T01:02:17Z)
• Probing Topological Spin Liquids on a Programmable Quantum Simulator [40.96261204117952]
  We use a 219-atom programmable quantum simulator to probe quantum spin liquid states. In our approach, arrays of atoms are placed on the links of a kagome lattice and evolution under Rydberg blockade creates frustrated quantum states. The onset of a quantum spin liquid phase of the paradigmatic toric code type is detected by evaluating topological string operators.
  arXiv  Detail & Related papers  (2021-04-09T00:18:12Z)
• Calculation of the ground-state Stark effect in small molecules using the variational quantum eigensolver [0.0]
  We study a quantum simulation for the hydrogen (H2) and lithium hydride (LiH) molecules, at an actual commercially available quantum computer, the IBM Q. Using the Variational Quantum Eigensolver (VQE) method, we study the molecule's ground state energy versus interatomic distance, under the action of stationary electric fields.
  arXiv  Detail & Related papers  (2021-03-22T11:49:42Z)

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.