scholarly journals Conditional emergence of classical domain and branching of quantum histories

2020 ◽  
Vol 2 (4) ◽  
Author(s):  
Alexei V. Tkachenko
Keyword(s):  
Classical Domain ◽  
Quantum Histories

scholarly journals Quantum Computation and Arrows of Time

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 49
Author(s):  
Nathan Argaman
Keyword(s):  
Quantum Computation ◽  
Quantum Physics ◽  
Bell’S Theorem ◽  
Arrow Of Time ◽  
Bell's Theorem ◽  
Classical Domain ◽  
Further Development

Quantum physics is surprising in many ways. One surprise is the threat to locality implied by Bell’s Theorem. Another surprise is the capacity of quantum computation, which poses a threat to the complexity-theoretic Church-Turing thesis. In both cases, the surprise may be due to taking for granted a strict arrow-of-time assumption whose applicability may be limited to the classical domain. This possibility has been noted repeatedly in the context of Bell’s Theorem. The argument concerning quantum computation is described here. Further development of models which violate this strong arrow-of-time assumption, replacing it by a weaker arrow which is yet to be identified, is called for.

scholarly journals Comparing quantum hybrid reinforcement learning to classical methods

2021 ◽  
Author(s):  
Maximilian Moll ◽  
Leonhard Kunczik
Keyword(s):  
Reinforcement Learning ◽  
Quantum Circuits ◽  
Memory Usage ◽  
Computational Power ◽  
Classical Domain ◽  
Q Learning ◽  
Optimal Behavior ◽  
Computational Speed ◽  
Complex Decision ◽  
Hybrid Reinforcement

AbstractIn recent history, reinforcement learning (RL) proved its capability by solving complex decision problems by mastering several games. Increased computational power and the advances in approximation with neural networks (NN) paved the path to RL’s successful applications. Even though RL can tackle more complex problems nowadays, it still relies on computational power and runtime. Quantum computing promises to solve these issues by its capability to encode information and the potential quadratic speedup in runtime. We compare tabular Q-learning and Q-learning using either a quantum or a classical approximation architecture on the frozen lake problem. Furthermore, the three algorithms are analyzed in terms of iterations until convergence to the optimal behavior, memory usage, and runtime. Within the paper, NNs are utilized for approximation in the classical domain, while in the quantum domain variational quantum circuits, as a quantum hybrid approximation method, have been used. Our simulations show that a quantum approximator is beneficial in terms of memory usage and provides a better sample complexity than NNs; however, it still lacks the computational speed to be competitive.

Linear types and approximation

2000 ◽  
Vol 10 (6) ◽  
pp. 719-745 ◽  
Author(s):  
MICHAEL HUTH ◽  
ACHIM JUNG ◽  
KLAUS KEIMEL
Keyword(s):  
Full Subcategory ◽  
Linear Logic ◽  
Domain Theory ◽  
Classical Domain ◽  
Complete Distributivity ◽  
Linear Types ◽  
Continuous Lattices

We study continuous lattices with maps that preserve all suprema rather than only directed ones. We introduce the (full) subcategory of FS-lattices, which turns out to be *-autonomous, and in fact maximal with this property. FS-lattices are studied in the presence of distributivity and algebraicity. The theory is extremely rich with numerous connections to classical Domain Theory, complete distributivity, Topology and models of Linear Logic.

The Classical-to-Semiclassical Connection

2017 ◽  
Author(s):  
John A. Adam
Keyword(s):  
Electromagnetic Waves ◽  
Wave Radiation ◽  
Physical Optics ◽  
Incident Plane Wave ◽  
Potential Well ◽  
Intermediate Region ◽  
Symmetric Problem ◽  
Classical Domain ◽  
Incident Plane ◽  
Semiclassical Scattering

This chapter discusses the connection between the classical and semiclassical domains of scattering. Scattering phenomena may be described via three regimes: the scattering of waves by objects with small, large, or comparable sizes with the wavelength of the incident (plane wave) radiation. All three regions can be related to three domains: the classical domain (geometrical optics, particle and particle/ray-like trajectories); the wave domain (physical optics, acoustic and electromagnetic waves, quantum mechanics); and the semiclassical domain (the vast intermediate region between the first and second domain). The chapter first provides an overview of classical and semiclassical scattering domains before beginning with an analysis of the semiclassical formulation. It also considers the radial equation, scattering by a one-dimensional potential barrier, and the radially symmetric problem. Solutions for phase shifts and the potential well are presented.

scholarly journals Tertiary structure of tRNAPhe. A possible correlation between the structural functional unit of this tRNA and its exonic sequence

1984 ◽  
Vol 219 (1) ◽  
pp. 341-344
Author(s):  
R Malathi ◽  
N Yathindra
Keyword(s):  
Tertiary Structure ◽  
Functional Unit ◽  
Classical Domain ◽  
Structural Units ◽  
Close Inspection ◽  
Ribonucleic Acids ◽  
Domain Structures ◽  
Shape Structure ◽  
Trna Species ◽  
Exonic Sequence

It has been shown recently [Go (1981) Nature (London) 291, 90-92; Blake (1983) Trends Biochem Sci. 8, 11-13] that the exonic regions of the genes of proteins haemoglobin, lysozyme and immunoglobin correspond closely to the compactly folded structural units. Despite the absence of classical domain structures in tRNA compared with those found in several proteins, close inspection of certain features in the distance maps obtained for yeast tRNAPhe using the conformationally equivalent heminucleotide scheme reveals that a similar situation might also be present in ribonucleic acids such as tRNA species and the exonic sequences of their genes. Also it seems possible that certain segments of yeast tRNAPhe may be characterized as possessing a domain-like character, and this seems to provide stereochemical support for possible conservation of L-shape structure for tRNA species lacking the entire dihydrouridine arm such as those found in mitochondria.

scholarly journals Speech Encryption Algorithm Based on Nonorthogonal Quantum State with Hyperchaotic Keystreams

2020 ◽  
Vol 2020 ◽  
pp. 1-12 ◽  
Author(s):  
F. J. Farsana ◽  
K. Gopakumar
Keyword(s):  
Quantum State ◽  
Initial Conditions ◽  
Encryption Algorithm ◽  
Hadamard Transform ◽  
Hyperchaotic System ◽  
Classical Domain ◽  
Quantum Domain ◽  
Novel Approach ◽  
Speech Encryption ◽  
Shared Networks

With the advancement in modern computational technologies like cloud computing, there has been tremendous growth in the field of data processing and encryption technologies. In this contest there is an increasing demand for successful storage of the data in the encrypted domain to avoid the possibility of data breach in shared networks. In this paper, a novel approach for speech encryption algorithm based on quantum chaotic system is designed. In the proposed method, classical bits of the speech samples are initially encoded in nonorthogonal quantum state by the secret polarizing angle. In the quantum domain, encoded speech samples are subjected to bit-flip operation according to the Controlled–NOT gate followed by Hadamard transform. Complete superposition of the quantum state in both Hadamard and standard basis is achieved through Hadamard transform. Control bits for C-NOT gate as well as Hadamard gate are generated with a modified Lu˙-hyperchaotic system. Secret nonorthogonal rotation angles and initial conditions of the hyperchaotic system are the keys used to ensure the security of the proposed algorithm. The computational complexity of the proposed algorithm has been analysed both in quantum domain and classical domain. Numerical simulation carried out based on the above principle showed that the proposed speech encryption algorithm has wider keyspace, higher key sensitivity and robust against various differential and statistical cryptographic attacks.

The observable that is positive in classical domain and negative in quantum one

2001 ◽  
Vol 285 (5-6) ◽  
pp. 251-255 ◽  
Author(s):  
Yu.I. Vorontsov ◽  
Yu.A. Rembovsky
Keyword(s):  
Classical Domain

scholarly journals Enhancing vehicle suspension system control performance based on the improved extension control

2018 ◽  
Vol 10 (7) ◽  
pp. 168781401877386 ◽  
Author(s):  
Hongbo Wang
Keyword(s):  
Fuzzy Control ◽  
System Performance ◽  
Ride Comfort ◽  
Control Method ◽  
Domain Boundary ◽  
Suspension System ◽  
Vehicle Suspension ◽  
Classical Domain ◽  
Vehicle Suspension System ◽  
Takagi Sugeno

Vehicle suspension system is the key part in vehicle chassis, which has influence on the vehicle ride comfort, handling stability, and security. The extension control, which is not constrained by common control method, could further improve the suspension system performance. The 7 degree-of-freedom suspension model is built. The extension controller is designed according to the function differences. In different extension set domains according to the correlation function, the corresponding control strategy is designed to ensure the suspension system obtains optimal performance in the classical domain and expands the controllable range outside the classical domain as large as possible. By adopting game theory, the domain is optimally divided, and the domain boundary control jump is smoothed by introducing Takagi–Sugeno–Kang fuzzy control into the extension control. Through the simulation and results comparison, it is demonstrated that the extension control could further improve the vehicle ride comfort than the optimal control and the extension control ability can be further promoted through domain game and Takagi–Sugeno–Kang fuzzy control. The analysis of the influence of the extension controller parameter varieties on suspension system performance shows that the error-weighted coefficient and control coefficient have significant effect to the suspension system performance.

Sign in / Sign up

Export Citation Format

Share Document