1,721,061 research outputs found
Quantum and quantum-like machine learning: a note on differences and similarities
In the past few decades, researchers have extensively investigated the applications of quantum computation and quantum
information to machine learning with remarkable results. This, in turn, has led to the emergence of quantum machine learning
as a separate discipline, whose main goal is to transform standard machine learning algorithms into quantum algorithms
which can be implemented on quantum computers. One further research programme has involved using quantum information
to create new quantum-like algorithms for classical computers (Sergioli et al. in Int J Theor Phys 56(12):3880–3888, 2017;
PLoS ONE 14:e0216224, 2019. https://doi.org/10.1371/journal.pone.0216224; Int J Quantum Inf 16(8):1840011, 2018a;
Soft Comput 22(3):691–705, 2018b). This brief survey summarises and compares both approaches and also outlines the main
motivations behind them
Fallacie Argomentative
Questo lavoro prende in esame le più note fallacie argomentative che verranno introdotte
attraverso un ampio uso di esempi pratici, con lo scopo di mostrare al lettore come tali
fallacie siano largamente impiegate nei più svariati contesti comunicativi. L’analisi critica proposta
in questo lavoro metterà in luce come le fallacie abbiano il potere di rendere, talvolta, un
argomento ben più persuasivo rispetto ad un ragionamento del tutto impeccabile dal punto di
vista rigorosamente logico-argomentativo
La logica computazionale quantistica dei sistemi aperti
SOMMARIO. Esistono fenomeni fisici come la decoerenza, il rumore, la misura effettuata nel mezzo del processo computazionale, che difficilmente possono essere interpretati attraverso il paradigma quantistico standard. In un processo computazionale, una qualsiasi interazione del sistema con l’ambiente causa un’inevitabile perdita di informazione che rende il processo stesso irreversibile. Per tener conto di situazioni di questo tipo, la computazione quantistica ha recentemente adottato un nuovo approccio che si spinge oltre a quello standard. Lo scopo di questo articolo `e quello di riassumere in maniera descrittiva (evitando di entrare in dettagli tecnici) i caratteri principali di questo nuovo approccio e analizzarne qualche possibile applicazione.There are physical phenomena that can be hardly interpreted by standard quantum paradigm: decoherence,noise,measurementsinthemiddle of a computation - basically, any computational process that involves an interactionwiththeenvironment-callintoplayanunavoidablelossofinformation that renders the process itself irreversible. To conveniently describe such situations, alongside with the kind of processes that are dealt with by the standard approach, a new, more comprehensive perspective has been recently developed in quantum computation. The aim of this paper is to survey and to describe (without come into technical details) some original application soft his new approach
A Matrix Representation of Quantum Circuits over Non-Adjacent Qudits
Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an arbitrary dimensional input state. The model is also extended to the framework of quantum computation with qudits. An application in the context of the quantum computational logic is provided
A note on many valued quantum computational logics
The standard theory of quantum computation reliesontheideathatthebasicinformationquantityisrepresented by a superposition of elements of the canonical basis andthenotionofprobabilitynaturallyfollowsfromtheBorn rule.Inthisworkweconsiderthreevaluedquantumcomputationallogics.Morespecifically,wewillfocusontheHilbert spaceC3,wediscussextensionsofseveralgatestothisspace and,usingthenotionofeffectprobability,weprovideacharacterization of its states
Towards quantum computational logics
Quantum computational logics have recently stirred increasing attention (Cattaneoetal.inMath.Slovaca54:87–108,2004;Leddaetal.inStud.Log.82(2):245–270,2006; Giuntini et al. in Stud. Log. 87(1):99–128, 2007). In this paper we outline their motivations and report on the state of the art of the approach to the logic of quantum computation that has been recently taken up and developed by our research group
Fallacious Analogical Reasoning and the Metaphoric Fallacy to a Deductive Inference (MFDI)
Counting Steps: A Finitist Approach to Objective Probability in Physics
We propose a new interpretation of objective probability in statistical physics based on physical computational complexity. This notion applies to a single physical system (be it an experimental set-up in the lab, or a subsystem of the universe), and quantifies (1) the difficulty to realize a physical state given another, (2) the 'distance' (in terms of physical resources) between a physical state and another, and (3) the size of the set of time-complexity functions that are compatible with the physical resources required to reach a physical state from another. This view (a) exorcises 'ignorance' from statistical physics, and (b) underlies a new interpretation to non-relativistic quantum mechanics
Fuzzy approach to quantum Fredkin gate
In the framework of quantum computation with mixed states, we introduce a fuzzy approach to the quantum Fredkin gate. Under this perspective, we investigate the behaviour of the gate applied to factorized and non-factorized quantum states
- …
