scholarly journals Quantum Structure for Modelling Emotion Space of Robots

2019 ◽  
Vol 9 (16) ◽  
pp. 3351
Author(s):  
Fei Yan ◽  
Abdullah M. Iliyasu ◽  
Sihao Jiao ◽  
Huamin Yang
Keyword(s):  
Quantum Computing ◽  
Human Robot Interaction ◽  
Quantum Structure ◽  
Transition Matrices ◽  
Computing Paradigm ◽  
Mechanical Formulation ◽  
Unitary Transformations ◽  
Future Data ◽  
New Perspective ◽  
Emotion Space

Utilising the properties of quantum mechanics, i.e., entanglement, parallelism, etc., a quantum structure is proposed for representing and manipulating emotion space of robots. This quantum emotion space (QES) provides a mechanism to extend emotion interpretation to the quantum computing domain whereby fewer resources are required and, by using unitary transformations, it facilitates easier tracking of emotion transitions over different intervals in the emotion space. The QES is designed as an intuitive and graphical visualisation of the emotion state as a curve in a cuboid, so that an “emotion sensor” could be used to track the emotion transition as well as its manipulation. This ability to use transition matrices to convey manipulation of emotions suggests the feasibility and effectiveness of the proposed approach. Our study is primarily influenced by two developments. First, the massive amounts of data, complexity of control, planning and reasoning required for today’s sophisticated automation processes necessitates the need to equip robots with powerful sensors to enable them adapt and operate in all kinds of environments. Second, the renewed impetus and inevitable transition to the quantum computing paradigm suggests that quantum robots will have a role to play in future data processing and human-robot interaction either as standalone units or as part of larger hybrid systems. The QES proposed in this study provides a quantum mechanical formulation for quantum emotion as well as a platform to process, track, and manipulate instantaneous transitions in a robot’s emotion. The new perspective will open broad areas, such as applications in emotion recognition and emotional intelligence for quantum robots.

Sustainability of Public Key Cryptosystem in Quantum Computing Paradigm

2018 ◽  
pp. 563-588
Author(s):  
Krishna Asawa ◽  
Akanksha Bhardwaj
Keyword(s):  
Quantum Computing ◽  
Secure Communication ◽  
Prime Numbers ◽  
Cryptographic Protocols ◽  
Public Key ◽  
Quantum Computers ◽  
New Paradigm ◽  
Public Key Cryptosystems ◽  
Computing Paradigm ◽  
Diffie Hellman

With the emergence of technological revolution to host services over Internet, secure communication over World Wide Web becomes critical. Cryptographic protocols are being in practice to secure the data transmission over network. Researchers use complex mathematical problem, number theory, prime numbers etc. to develop such cryptographic protocols. RSA and Diffie Hellman public key crypto systems have proven to be secure due to the difficulty of factoring the product of two large primes or computing discrete logarithms respectively. With the advent of quantum computers a new paradigm shift on public key cryptography may be on horizon. Since superposition of the qubits and entanglement behavior exhibited by quantum computers could hold the potential to render most modern encryption useless. The aim of this chapter is to analyze the implications of quantum computing power on current public key cryptosystems and to show how these cryptosystems can be restructured to sustain in the new computing paradigm.

Sustainability of Public Key Cryptosystem in Quantum Computing Paradigm

2016 ◽  
pp. 664-688
Author(s):  
Krishna Asawa ◽  
Akanksha Bhardwaj
Keyword(s):  
Quantum Computing ◽  
Secure Communication ◽  
Prime Numbers ◽  
Cryptographic Protocols ◽  
Public Key ◽  
Quantum Computers ◽  
New Paradigm ◽  
Public Key Cryptosystems ◽  
Computing Paradigm ◽  
Diffie Hellman

With the emergence of technological revolution to host services over Internet, secure communication over World Wide Web becomes critical. Cryptographic protocols are being in practice to secure the data transmission over network. Researchers use complex mathematical problem, number theory, prime numbers etc. to develop such cryptographic protocols. RSA and Diffie Hellman public key crypto systems have proven to be secure due to the difficulty of factoring the product of two large primes or computing discrete logarithms respectively. With the advent of quantum computers a new paradigm shift on public key cryptography may be on horizon. Since superposition of the qubits and entanglement behavior exhibited by quantum computers could hold the potential to render most modern encryption useless. The aim of this chapter is to analyze the implications of quantum computing power on current public key cryptosystems and to show how these cryptosystems can be restructured to sustain in the new computing paradigm.

scholarly journals Locality and Conservation Laws: How, in the presence of symmetry, locality restricts realizable unitaries

2021 ◽  
Author(s):  
Iman Marvian
Keyword(s):  
Quantum Computing ◽  
Conservation Laws ◽  
Composite System ◽  
Local Energy ◽  
Quantum Thermodynamics ◽  
Short Term ◽  
Unitary Transformations ◽  
Long Time ◽  
Energy Conserving ◽  
Continuous Symmetries

Abstract According to an elementary result in quantum computing, any unitary transformation on a composite system can be generated using 2-local unitaries, i.e., those that act only on two subsystems. Beside its fundamental importance in quantum computing, this result can also be regarded as a statement about the dynamics of systems with local Hamiltonians: although locality puts various constraints on the short-term dynamics, it does not restrict the possible unitary evolutions that a composite system with a general local Hamiltonian can experience after a sufficiently long time. We ask if such universality remains valid in the presence of conservation laws and global symmetries. In particular, can k-local symmetric unitaries on a composite system generate all symmetric unitaries on that system? Surprisingly, it turns out that the answer is negative in the case of continuous symmetries, such as U(1) and SU(2): generic symmetric unitaries cannot be implemented, even approximately, using local symmetric unitaries. In the context of quantum thermodynamics this means that generic energy-conserving unitary transformations on a composite system cannot be implemented by applying local energy-conserving unitary transformations on the components. We also show how this no-go theorem can be circumvented via catalysis: any globally energy-conserving unitary can be implemented using a sequence of 2-local energy-conserving unitaries, provided that one can use a single ancillary qubit (catalyst).

scholarly journals A New Perspective on Robot Ethics through Investigating Human–Robot Interactions with Older Adults

2021 ◽  
Vol 11 (21) ◽  
pp. 10136
Author(s):  
Anouk van Maris ◽  
Nancy Zook ◽  
Sanja Dogramadzi ◽  
Matthew Studley ◽  
Alan Winfield ◽  
...  
Keyword(s):  
Older Adults ◽  
Negative Impact ◽  
Social Robots ◽  
Human Robot Interaction ◽  
Assessment Tools ◽  
Robot Ethics ◽  
Robot Interaction ◽  
Healthy Older Adults ◽  
Artificial Emotions ◽  
New Perspective

This work explored the use of human–robot interaction research to investigate robot ethics. A longitudinal human–robot interaction study was conducted with self-reported healthy older adults to determine whether expression of artificial emotions by a social robot could result in emotional deception and emotional attachment. The findings from this study have highlighted that currently there appears to be no adequate tools, or the means, to determine the ethical impact and concerns ensuing from long-term interactions between social robots and older adults. This raises the question whether we should continue the fundamental development of social robots if we cannot determine their potential negative impact and whether we should shift our focus to the development of human–robot interaction assessment tools that provide more objective measures of ethical impact.

scholarly journals Quantum Structure in Cognition: Human Language as a Boson Gas of Entangled Words

2019 ◽  
Vol 25 (3) ◽  
pp. 755-802
Author(s):  
Diederik Aerts ◽  
Lester Beltran
Keyword(s):  
Energy Levels ◽  
Physical Reality ◽  
Einstein Condensate ◽  
Human Language ◽  
Quantum Structure ◽  
Bose Einstein Condensate ◽  
Energy States ◽  
New Perspective ◽  
Bose Einstein ◽  
The Way

AbstractWe model a piece of text of human language telling a story by means of the quantum structure describing a Bose gas in a state close to a Bose–Einstein condensate near absolute zero temperature. For this we introduce energy levels for the words (concepts) used in the story and we also introduce the new notion of ‘cogniton’ as the quantum of human thought. Words (concepts) are then cognitons in different energy states as it is the case for photons in different energy states, or states of different radiative frequency, when the considered boson gas is that of the quanta of the electromagnetic field. We show that Bose–Einstein statistics delivers a very good model for these pieces of texts telling stories, both for short stories and for long stories of the size of novels. We analyze an unexpected connection with Zipf’s law in human language, the Zipf ranking relating to the energy levels of the words, and the Bose–Einstein graph coinciding with the Zipf graph. We investigate the issue of ‘identity and indistinguishability’ from this new perspective and conjecture that the way one can easily understand how two of ‘the same concepts’ are ‘absolutely identical and indistinguishable’ in human language is also the way in which quantum particles are absolutely identical and indistinguishable in physical reality, providing in this way new evidence for our conceptuality interpretation of quantum theory.

scholarly journals Graphene Quantum Dots for Quantum GPU architectures.

2019 ◽  
Author(s):  
Anil Kumar Bheemaiah
Keyword(s):  
Quantum Dots ◽  
Quantum Computing ◽  
Reconfigurable Computing ◽  
Graphene Quantum Dots ◽  
Input Stream ◽  
Computing Paradigm ◽  
Quantum Architecture ◽  
Gpu Architectures

This paper is on a quantum architecture using the Display Computing paradigm, for a Quantum GPU design. It builds on my previous work on quantum reconfigurable computing. The design builds on a generalized 10 qubit architecture that can be reconfigured to provide display stream and input stream transformation using quantum computing.

Grid-Based Nuclear Physics Applications

2009 ◽  
pp. 195-205
Author(s):  
Frans Arickx ◽  
Jan Broeckhove ◽  
Peter Hellinckx ◽  
David Dewolfs ◽  
Kurt Vanmechelen
Keyword(s):  
Grid Computing ◽  
Nuclear Physics ◽  
Cluster Computing ◽  
Linear Problem ◽  
Time Frame ◽  
Quantum Structure ◽  
Desktop Grid ◽  
Computing Paradigm ◽  
Grid Based ◽  
Comparable Time

Quantum structure or scattering calculations often belong to a class of computational problems involving the aggregation of a set of matrices representing a linear problem to be solved. The authors discuss a number of approaches based on cluster and grid computing, and discuss the implementations and the respective merits and shortcomings. The authors consider MPI-based cluster computing in a self-scheduling paradigm, CoBRA (a cpu-harvesting desktop grid) in a farmer-worker paradigm, and a batch-computing paradigm on BEGrid (the Belgian research grid facility). It is observed that for all paradigms an efficient implementation is possible, yielding results within a comparable time frame.

scholarly journals Prospects for quantum computing: Extremely doubtful

2014 ◽  
Vol 33 ◽  
pp. 1460357 ◽  
Author(s):  
M. I. Dyakonov
Keyword(s):  
Quantum Computing ◽  
Large Scale ◽  
Quantum Computer ◽  
Chaotic Behavior ◽  
Physical World ◽  
The State ◽  
Strongly Nonlinear ◽  
Unitary Transformations ◽  
Strongly Nonlinear System ◽  
Limited Precision

The quantum computer is supposed to process information by applying unitary transformations to 2N complex amplitudes defining the state of N qubits. A useful machine needing N~103 or more, the number of continuous parameters describing the state of a quantum computer at any given moment is at least 21000 ~10300 which is much greater than the number of protons in the Universe. However, the theorists believe that the feasibility of large-scale quantum computing has been proved via the “threshold theorem”. Like for any theorem, the proof is based on a number of assumptions considered as axioms. However, in the physical world none of these assumptions can be fulfilled exactly. Any assumption can be only approached with some limited precision. So, the rather meaningless “error per qubit per gate” threshold must be supplemented by a list of the precisions with which all assumptions behind the threshold theorem should hold. Such a list still does not exist. The theory also seems to ignore the undesired free evolution of the quantum computer caused by the energy differences of quantum states entering any given superposition. Another important point is that the hypothetical quantum computer will be a system of 103 –106 qubits PLUS an extremely complex and monstrously sophisticated classical apparatus. This huge and strongly nonlinear system will generally exhibit instabilities and chaotic behavior.

Sign in / Sign up

Export Citation Format

Share Document