Quantum Information Processing with Molecular Nanomagnets: an introduction

• URL: http://arxiv.org/abs/2405.21000v2
• Date: Thu, 22 Aug 2024 14:24:41 GMT
• Title: Quantum Information Processing with Molecular Nanomagnets: an introduction
• Authors: Alessandro Chiesa, Emilio Macaluso, Stefano Carretta,
• Abstract summary: 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.
• Score: 49.89725935672549
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Many problems intractable on classical devices could be solved by algorithms explicitly based on quantum mechanical laws, i.e. exploiting quantum information processing. As a result, increasing efforts from different fields are nowadays directed to the actual realization of quantum devices. Here we provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation, represented by molecular spin clusters known as Molecular Nanomagnets. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We then examine the most important sources of noise in this class of systems and then one of their most peculiar features, i.e. the possibility to exploit many (more than two) available states to encode information and to self-correct it from errors via proper design of quantum error correction codes. Finally, we present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• A Quantum Algorithm Based Heuristic to Hide Sensitive Itemsets [1.8419202109872088]
  We present a quantum approach to solve a well-studied problem in the context of data sharing. We present results on experiments involving small datasets to illustrate how the problem could be solved using quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-12T20:44:46Z)
• Randomly Monitored Quantum Codes [8.557392136621894]
  Recent studies have shown that quantum measurement itself can induce novel quantum phenomena. One example is a monitored random circuit, which can generate long-range entanglement faster than a random unitary circuit. In particular, we demonstrate that for a large class of quantum error-correcitng codes, it is impossible to destroy the encoded information through random single-qubit Pauli measurements.
  arXiv  Detail & Related papers  (2024-01-31T19:53:06Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Quantum-enhanced bosonic learning machine [0.0]
  We show a quantum-enhanced bosonic learning machine operating on quantum data with a system of trapped ions. We implement the unsupervised K-means algorithm to recognize a pattern in a set of high-dimensional quantum states. We use the discovered knowledge to classify unknown quantum states with the supervised k-NN algorithm.
  arXiv  Detail & Related papers  (2021-04-09T02:44:57Z)
• 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)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• Maximal entropy approach for quantum state tomography [3.6344381605841187]
  Current quantum computing devices are noisy intermediate-scale quantum $($NISQ$)$ devices. Quantum tomography tries to reconstruct a quantum system's density matrix by a complete set of observables. We propose an alternative approach to quantum tomography, based on the maximal information entropy, that can predict the values of unknown observables.
  arXiv  Detail & Related papers  (2020-09-02T04:39:45Z)

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.