Quantum simulation of oscillating neutrinos

• URL: http://arxiv.org/abs/2010.06458v2
• Date: Sun, 25 Oct 2020 07:56:20 GMT
• Title: Quantum simulation of oscillating neutrinos
• Authors: Abhishek Kumar Jha, Akshay Chatla and Bindu A. Bambah
• Abstract summary: The two and three flavor neutrinos are mapped to qubit states used in quantum information theory. We show the implementation of entanglement in the two neutrino system on the IBM quantum processor.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Two and three flavor oscillating neutrinos are shown to exhibit the properties bipartite and tripartite quantum entanglement. The two and three flavor neutrinos are mapped to qubit states used in quantum information theory. Such quantum bits of the neutrino state can be encoded on a IBMQ computer using quantum computing as a tool. We show the implementation of entanglement in the two neutrino system on the IBM quantum processor.

Related papers

• Qutrit and Qubit Circuits for Three-Flavor Collective Neutrino Oscillations [0.0]
  We explore the utility of qutrits and qubits for simulating the flavor dynamics of dense neutrino systems. We present new quantum circuits for simulating three-flavor neutrino systems on qutrit- and qubit-based platforms.
  arXiv  Detail & Related papers  (2024-07-18T21:56:31Z)
• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• Proof-of-concept Quantum Simulator based on Molecular Spin Qudits [39.28601213393797]
  We show the first prototype quantum simulator based on an ensemble of molecular qudits and a radiofrequency broadband spectrometer. Results represent an important step towards the actual use of molecular spin qudits in quantum technologies.
  arXiv  Detail & Related papers  (2023-09-11T16:33:02Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations [55.41644538483948]
  We study strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. We find that the gate complexity using second order Trotter- Suzuki formulae scales better with system size than with other decomposition methods such as Quantum Signal Processing.
  arXiv  Detail & Related papers  (2022-07-07T09:39:40Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Experimental realization of quantum teleportation of arbitrary single and two-qubit states via hypergraph states [0.0]
  We process the schemes for quantum teleportation of single-qubit and two-qubit arbitrary states via three-uniform three-qubit and four-qubit hypergraph states respectively. We present the results obtained by both the simulator and real devices such as "ibmq_qasm_simulator" and "ibmq_16_melbourne" and calculate the fidelity.
  arXiv  Detail & Related papers  (2022-01-15T11:38:03Z)
• Scalable Qubit Representations of Neutrino Mixing Matrices [0.0]
  We introduce algorithms to encode mixing and oscillation of any number of flavor-mixed neutrinos, both with and without CP-violation. Examples encoded for an IBM-Q quantum computer are shown to converge to analytic predictions both with and without CP-violation.
  arXiv  Detail & Related papers  (2021-11-09T20:16:05Z)
• Experimenting quantum phenomena on NISQ computers using high level quantum programming [0.0]
  We execute the quantum eraser, the Elitzur-Vaidman bomb, and the Hardy's paradox experiment using high-level programming language. The results align with theoretical predictions of quantum mechanics to high confidence on circuits using up to 3 qubits.
  arXiv  Detail & Related papers  (2021-11-02T15:52:49Z)
• SU(2) hadrons on a quantum computer [0.0]
  We realize a non-Abelian gauge theory with both gauge and matter fields on a quantum computer. This enables the observation of hadrons and the calculation of their associated masses.
  arXiv  Detail & Related papers  (2021-02-17T18:23:34Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.