Quantum Information Processing: An Essential Primer
- URL: http://arxiv.org/abs/2006.15979v2
- Date: Thu, 13 Aug 2020 16:29:54 GMT
- Title: Quantum Information Processing: An Essential Primer
- Authors: Emina Soljanin
- Abstract summary: How is quantum information represented?
How is classical information extracted from quantum states?
Secure communications and error correction.
No prior knowledge of quantum mechanics is assumed.
- Score: 9.569049935824227
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum information science is an exciting, wide, rapidly progressing,
cross-disciplinary field, and that very nature makes it both attractive and
hard to enter. In this primer, we first provide answers to the three essential
questions that any newcomer needs to know: How is quantum information
represented? How is quantum information processed? How is classical information
extracted from quantum states? We then introduce the most basic quantum
information theoretic notions concerning entropy, sources, and channels, as
well as secure communications and error correction. We conclude with examples
that illustrate the power of quantum correlations. No prior knowledge of
quantum mechanics is assumed.
Related papers
- Identification and Mitigating Bias in Quantum Machine Learning [1.5442389863546546]
This research includes work on identification, diagnosis, and response to biases in Quantum Machine Learning.
This paper aims to provide an overview of three key topics: How does bias unique to Quantum Machine Learning look?
What can and should be done about it?
arXiv Detail & Related papers (2024-09-23T21:31:16Z) - 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) - Foundations of Quantum Information for Physical Chemistry [0.0]
We review some basic, but sometimes misunderstood, concepts of quantum information based on the mathematical formulation of quantum mechanics.
We cover topics including qubits and their density matrix formalism, quantum measurement as a quantum operation, information theory, and entanglement.
We aim to clarify the rigorous definition of these concepts, and then indicate some examples in physical chemistry.
arXiv Detail & Related papers (2023-11-20T23:29:04Z) - 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) - Hello Quantum World! A rigorous but accessible first-year university
course in quantum information science [0.0]
Hello Quantum World! introduces a broad range of fundamental quantum information and computation concepts.
Some of the topics covered include superposition, entanglement, quantum gates, teleportation, quantum algorithms, and quantum error correction.
arXiv Detail & Related papers (2022-09-25T18:59:47Z) - Quantum information and beyond -- with quantum candies [0.0]
We investigate, extend, and greatly expand here "quantum candies" (invented by Jacobs)
"quantum" candies describe some basic concepts in quantum information, including quantum bits, complementarity, the no-cloning principle, and entanglement.
These demonstrations are done in an approachable manner, that can be explained to high-school students, without using the hard-to-grasp concept of superpositions and its mathematics.
arXiv Detail & Related papers (2021-09-30T16:05:33Z) - Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise.
Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
arXiv Detail & Related papers (2021-03-31T02:41:36Z) - 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 walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Quantum Candies and Quantum Cryptography [0.0]
We investigate, extend, and much expand here "quantum candies" (invented by Jacobs), a pedagogical model for intuitively describing some basic concepts in quantum information.
We explicitly demonstrate various additional quantum cryptography protocols using quantum candies in an approachable manner.
arXiv Detail & Related papers (2020-11-03T21:01:08Z) - 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)
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.