Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Apple Academic Press eBooks

OVERVIEW OF QUANTUM COMPUTATION

H.E. Caicedo-Ortiz, Elizabeth Santiago-Cortes

Published Oct 22, 2014• 1 citation
Publisher
DOI
10.1201/b17629-6

Related papers

QUANTUM COMPUTATION

John P. Preskill

General Relativity and Gravitation•Nov 1, 2005•24 citations

Quantum Computation: Overview

Mahn‐Soo Choi

Springer eBooks•Jan 1, 2022•0 citations

COGNITIVE SYSTEMS AND QUANTUM COMPUTATION

Deniz Türkpençe

This review presents an overview of cognitive systems, quantum phenomena and possible connections between them. The focus will be the artificial cognitive systems and briefly touch the discussion of possible benefits from quantum counterparts. The nonclassical features of Quantum Theory introduced as quantum resources which enables possible speed ups or advantages over classical computational tasks. Quantum computation is introduced as a powerful computational tool over its classical counterparts by also covering possible applications of cognitive phenomena in the framework of quantum cognition. Also different attempts in order to implement decision making processes for cognitive purposes mentioned.

The Journal of Cognitive Systems•Jun 15, 2017•0 citations

DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES

Yael Tauman Kalai

Efficient verification of computation, also known as delegation of computation , is one of the most fundamental notions in computer science, and in particular it lies at the heart of the P vs. NP question. This article contains a high level overview of the evolution of proofs in computer science, and shows how this evolution is instrumental to solving the problem of delegating computation. We highlight a curious connection between the problem of delegating computation and the notion of no-signaling strategies from quantum physics.

International Congress of Mathematicians (ICM)•May 1, 2019•0 citations

Basics of quantum computation

Vlatko Vedral, Martin Bodo Plenio

arXiv:quant-ph/9802065•Progress in Quantum Electronics•Jan 1, 1998•160 citations

OVERVIEW OF QUANTUM COMPUTATION

H.E. Caicedo-Ortiz, Elizabeth Santiago-Cortes

Computation and quantum information [1] are an extension of the information process concept, and they are used for the effects of quantum mechanic [2]. This new scheme provides a work scene that is not restricted to only two operations; on the contrary, this can gain multiple intermediate states as a result of these two ways of superposition. By performing this operation, the system can evaluate all possibilities in only one step by making a parallel computation; meanwhile, in the classic way, this evaluation is carried out independently of each other, and in different steps. The quantum parallelism can be defined as a reduction in time and an increase in the fast of information process. In this chapter, the fundamental elements that make possible to use the mechanical-quantum phenomena as a tool in the process information are presented.

Apple Academic Press eBooks•Oct 22, 2014•1 citation
This review presents an overview of cognitive systems, quantum phenomena and possible connections between them. The focus will be the artificial cognitive systems and briefly touch the discussion of possible benefits from quantum counterparts. The nonclassical features of Quantum Theory introduced as quantum resources which enables possible speed ups or advantages over classical computational tasks. Quantum computation is introduced as a powerful computational tool over its classical counterparts by also covering possible applications of cognitive phenomena in the framework of quantum cognition. Also different attempts in order to implement decision making processes for cognitive purposes mentioned.
Efficient verification of computation, also known as delegation of computation , is one of the most fundamental notions in computer science, and in particular it lies at the heart of the P vs. NP question. This article contains a high level overview of the evolution of proofs in computer science, and shows how this evolution is instrumental to solving the problem of delegating computation. We highlight a curious connection between the problem of delegating computation and the notion of no-signaling strategies from quantum physics.
Computation and quantum information [1] are an extension of the information process concept, and they are used for the effects of quantum mechanic [2]. This new scheme provides a work scene that is not restricted to only two operations; on the contrary, this can gain multiple intermediate states as a result of these two ways of superposition. By performing this operation, the system can evaluate all possibilities in only one step by making a parallel computation; meanwhile, in the classic way, this evaluation is carried out independently of each other, and in different steps. The quantum parallelism can be defined as a reduction in time and an increase in the fast of information process. In this chapter, the fundamental elements that make possible to use the mechanical-quantum phenomena as a tool in the process information are presented.