The rapid advancements and the merging of hybrid quantum-classical computing, artificial intelligence (AI), machine learning (ML), and deep learning (DL) pose a potentially unseen and significant threat to encryption that may impact Post-Quantum Cryptography (PQC) transition timelines. There is a direct hybrid quantum-classical computing threat on cryptography, and there is also a direct threat AI/ML on cryptography. However, the synergistic combination of these technologies presents known and unknown threats that need attention, focus action, and research. This paper reviews Grover's Adaptive Search (GAS), which combines Grover's Algorithm with adaptive techniques to optimize search further, potentially making it even more efficient for attacking encryption. This work also examines the quantum-accelerated Harrow-Hassidim-Lloyd (HHL) Algorithm, designed to solve systems of linear equations exponentially faster than classical algorithms in certain conditions. The HHL algorithm can solve some lattice-based problems, which have implications for lattice-based encryption. This technological confluence and its potential impact on cryptography and encryption necessitate a proactive and coordinated approach to developing and implementing quantum-resistant AI/ML cryptographic solutions. This paper reviews the technological confluence and its potential implications for classical cryptography and PQC transition timelines and calls for further research.

In recent years, advancements in brain science and neuroscience have significantly influenced the field of computer science, particularly in the domain of reinforcement learning (RL). Drawing insights from neurobiology and neuropsychology, researchers have leveraged these findings to develop novel mechanisms for understanding intelligent decision-making processes in the brain. Concurrently, the emergence of quantum computing has opened new frontiers in artificial intelligence, leading to the development of quantum machine learning (QML). This study introduces a novel model that integrates Quantum Spiking Neural Networks (QSNN) and Quantum Long Short-Term Memory (QLSTM) architectures, inspired by the complex workings of the human brain. Specifically designed for reinforcement learning tasks in energy-efficient environments, our approach progresses through two distinct stages mirroring sensory and memory systems. In the initial stage, analogous to the brain’s hypothalamus, low-level information is extracted to emulate sensory data processing patterns. Subsequently, resembling the hippocampus, this information is processed at a higher level, capturing and memorizing correlated patterns. We conduct a comparative analysis of our model against existing quantum models such as Quantum Neural Networks and their classical counterparts, elucidating its unique contributions. Through empirical results, we aim to underscore the effectiveness of our approach in optimizing energy consumption in practical scenarios.

Tremendous progress has been witnessed in artificial intelligence within the domain of neural network backed deep learning systems and its applications. As we approach the post Moore’s Law era, the limit of semiconductor fabrication technology along with a rapid increase in data generation rates have lead to an impending growing challenge of tackling newer and more modern machine learning problems. In parallel, quantum computing has exhibited rapid development in recent years. Due to the potential of a quantum speedup, quantum based learning applications have become an area of significant interest, in hopes that we can leverage quantum systems to solve classical problems. In this work, we propose a quantum deep learning architecture; we demonstrate our quantum neural network architecture on tasks ranging from binary and multi-class classification to generative modelling. Powered by a modified quantum differentiation function along with a hybrid quantum-classic design, our architecture encodes the data with a reduced number of qubits and generates a quantum circuit, loading it onto a quantum platform where the model learns the optimal states iteratively. We conduct intensive experiments on both the local computing environment and IBM-Q quantum platform. The evaluation results demonstrate that our architecture is able to outperform Tensorflow-Quantum by up to 12.51% and 11.71% for a comparable classic deep neural network on the task of classification trained with the same network settings. Furthermore, our GAN architecture runs the discriminator and the generator purely on quantum hardware and utilizes the swap test on qubits to calculate the values of loss functions. In comparing our quantum GAN, we note our architecture is able to achieve similar performance with 98.5% reduction on the parameter set when compared to classical GANs. With the same number of parameters, additionally, QuGAN outperforms other quantum based GANs in the literature for up to 125.0% in terms of similarity between generated distributions and original data sets.

Hybrid Classical-Quantum computing has already arrived at several commercial quantum computers, offered to researchers and businesses. Here, application is made to a classical-quantum model of human neocortex, Statistical Mechanics of Neocortical Interactions (SMNI), which has had its applications published in many papers since 1981. However, this project only uses Classical (super-)computers. Since 2015, a path-integral algorithm, PATHINT, used previously to accurately describe several systems in several disciplines, has been generalized from 1 dimension to N dimensions, and from classical to quantum systems, qPATHINT. Published papers have described the use of qPATHINT to neocortical interactions and financial options. The classical space described by SMNI applies nonlinear nonequilibrium multivariate statistical mechanics to synaptic neuronal interactions, while the quantum space described by qPATHINT applies synaptic contributions from Ca2+ waves generated by astrocytes at tripartite neuron-astrocyte-neuron sites. Previous SMNI publications since 2013 have calculated the astrocyte Ca2+ wave synaptic interactions from a closed-form (analytic) expression derived by the author. However, more realistic random shocks to the Ca2+ waves from ions entering and leaving these wave packets should be included using qPATHINT between electroencephalographic (EEG) measurements which decohere the quantum wave packets. This current project extends calculations to multiple scales of interaction between classical events and expectations over the Ca2+ quantum processes to include these random shocks in previous codes used to fit EEG data to the SMNI model, that included the analytic forms for the quantum processes but now replaced by qPATHINT. The author's Adaptive Simulated Annealing (ASA) importance-sampling optimization code is used for fitting the combined classical-quantum system. Gaussian Quadratures is used for numerical calculation of momenta expectations of the astrocyte processes that contribute to SMNI synaptic interactions. This project thereby demonstrates how some hybrid classical-quantum systems may be calculated quite well using only classical (super-)computers.

Hybrid Classical-Quantum computing has already arrived at several commercial quantum computers, offered to researchers and businesses. Here, applications are made to a model of financial options, Statistical Mechanics of Financial Markets (SMFM). These applications were published in many papers since the 1980's. This project only uses Classical (super-)computers to include quantum features of these models. Since 1989, an optimization code, Adaptive Simulated Annealing (ASA), has been to fit parameters in such models. Since 2015, a path-integral algorithm, PATHINT, used previously to accurately describe several systems in several disciplines, has been generalized from 1 dimension to N dimensions, and from classical to quantum systems, qPATHINT. Published papers have described the use of qPATHINT to neocortical interactions and financial options. The classical space by SMFM applies nonlinear nonequilibrium multivariate statistical mechanics to fit parameters in conditional short-time probability distributions, while the quantum space described by qPATHINT deals specifically with quantum systems, e.g., quantum money. This project thereby demonstrates how some hybrid classical-quantum systems may be calculated quite well using only classical (super-)computers.

Cryptography has been used from time immemorial for preserving the confidentiality of data/information in storage or in transit. Thus, cryptography research has also been evolving from the classical Caesar cipher to the modern cryptosystems based on modular arithmetic to the contemporary cryptosystems based on quantum computing. The emergence of quantum computing imposes a major threat on the modern cryptosystems based on modular arithmetic whereby, even the computationally hard problems which constitute for the strength of the modular arithmetic ciphers could be solved in deterministic time. This threat triggered post-quantum cryptography research in order to design and develop post-quantum algorithms that can withstand quantum computing attacks. This paper provides a review of the various post-quantum cryptography and, in specific, code-based cryptography research dimensions. The research directions that are yet to be explored in code-based cryptography research is another key contribution of this paper.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems, we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we look at quantum speedup ratios of HHL Algorithm for different scenarios of linear programming. In a first scenario we look quantum speedup ratio (S(N)) as a function of phase transition and the ratio (κ) between the greatest and smallest eigenvalues of the matrix in linear equation system. As a second scenario, we investigate the changes in S(N) as a function of κ and s, which is the coefficient for defining the matrix as s-sparse.

Image synthesis poses a challenging problem that researchers in computer vision and machine learning have been grappling with for several decades. Numerous machine learning techniques have emerged and proven effective in generating high-fidelity artificial images. This study breaks new ground by exploring image synthesis through generative learning using the D-Wave 2000Q quantum annealer, marking the first attempt to address the issue of generative image synthesis on a Quantum Processing Unit (QPU). Alongside executing image synthesis on the quantum annealer, this research also compares its performance with existing classical models and delves into resolving the Generative Learning Trilemma.

The reversible computation paradigm aims to provide a new foundation for general classical digital computing that is capable of circumventing the thermodynamic limits to the energy efficiency of the conventional, non-reversible paradigm. However, to date, the essential rationale for and analysis of classical reversible computing (RC) has not yet been expressed in terms that leverage the modern formal methods of non-equilibrium quantum thermodynamics (NEQT). In this paper, we begin developing an NEQT-based foundation for the physics of reversible computing. We use the framework of Gorini-Kossakowski-Sudarshan-Lindblad dynamics (a.k.a. Lindbladians) with multiple asymptotic states, incorporating recent results from resource theory, full counting statistics, and stochastic thermodynamics. Important conclusions include that, as expected: (1) Landauer's Principle indeed sets a strict lower bound on entropy generation in traditional non-reversible architectures for deterministic computing machines when we account for the loss of correlations; and (2) implementations of the alternative reversible computation paradigm can potentially avoid such losses, and thereby circumvent the Landauer limit, potentially allowing the efficiency of future digital computing technologies to continue improving indefinitely. We also outline a research plan for identifying the fundamental minimum energy dissipation of reversible computing machines as a function of speed.

In this article, we investigate the applicability of quantum machine learning for classification tasks using two quantum classifiers from the Qiskit Python environment: the Variational Quantum Classifier (VQC) and the Quantum Kernel Estimator (QKE). We evaluate the performance of these classifiers on six widely known and publicly available benchmark datasets and analyze how their performance varies with the number of samples on two artificially generated test classification datasets. As quantum machine learning is based on unitary transformations, this paper explores data structures and application fields that could be particularly suitable for quantum advantages. Hereby, we developed a data set based on concepts from quantum mechanics using the exponential map of a Lie algebra. This dataset will be made publicly available and contributes a novel contribution to the empirical evaluation of quantum supremacy. We further compared the performance of VQC and QKE on six widely applicable datasets to contextualize our results.\\ Our results demonstrate that the VQC and QKE perform better than basic machine learning algorithms such as advanced linear regression models (Ridge and Lasso). They do not match the accuracy and runtime performance of sophisticated modern boosting classifiers like XGBoost, LightGBM, or CatBoost. Therefore, we conclude that while quantum machine learning algorithms have the potential to surpass classical machine learning methods in the future, especially when physical quantum infrastructure becomes widely available, they currently lag behind classical approaches. Our investigations also show that classical machine learning approaches have superior performance classifying datasets based on group structures, compared to quantum approaches that particularly use unitary processes.\\ Furthermore, our findings highlight the significant impact of different quantum simulators, feature maps, and quantum circuits on the performance of the employed quantum estimators. This observation emphasizes the need for researchers to provide detailed explanations of their hyperparameter choices for quantum machine learning algorithms, as this aspect is currently overlooked in many studies within the field.\\ To facilitate further research in this area and ensure the transparency of our study, we have made the complete code available in a linked GitHub repository.

The potential of quantum computing for scientific and industrial breakthroughs is immense, however, we are still in the Noisy Intermediate-Scale Quantum (NISQ) era, where the currently available quantum devices contain small numbers of qubits, are very sensitive to environmental conditions and prone to quantum decoherence. Even so, existing NISQ computers have already been shown to outperform conventional computers on specific problems and the key question is how to make use of today’s NISQ devices to achieve quantum advantage in the field of computational science and engineering (CSE). In this direction, this work proposes a hybrid computing formulation by combining quantum computing with machine learning for accelerating the solution of parameterized linear systems in NISQ devices. In particular, it focuses on the Variational Quantum Linear Solver (VQLS), which is a hybrid quantum- classical algorithm for solving linear systems of equations. VQLS employs a short-depth quantum circuit to efficiently evaluate a cost function related to the system solution. The algorithm’s circuit consists of a quantum gate sequence (unitary operators) that involves a set of tunable parameters. Then, well-established classical optimizers are utilized to tune the parameters of the sequence in order to minimize the cost function, which is equivalent to finding the system solution at an acceptable level of accuracy. In this work, it is demonstrated that machine learning tools such as feed-forward neural networks and nearest-neighbor interpolation techniques can be successfully employed to accelerate the convergence of the VQLS algorithm towards the optimal values for the circuit parameters when applied to parameterized linear systems that need to be solved for multiple parameter instances.

Quantum image representation is a widely researched area of quantum computing. Currently developed methods use angle parameter of the rotation gate (e.g., the FRQI method), sequences of qubits (ex. NEQR method) or phase shift (ex. LPIQE method) for storing color information of pixels. All of those methods are affected by decoherence and other classical and quantum noise, which is an inseparable part of quantum computing in a NISQ (Noisy Intermediate Scale Quantum) era. These all phenomenons influence the measurements, its probability distribution over the measurement basis and, as the result, makes the extracted images not even similar to those, which was stored in quantum computers. Since this process is, in its foundation, quantum as well, the computational reversal of this process is possible. There are a lot of methods for error correction, mitigation and reduction, but all of them use quantum computer time, or additional qubits to achieve desired result. We report a successful use of the Generative Adversarial Network tuned for image-to-image translation in conjunction with PDU method, for error reduction in images encoded using LIPQE (Local Phase Image Quantum Encoding) method.

In this paper we use quantum machine learning to detect and classify ocular diseases across age related macular degradation, cataract, diabetic, glaucoma, hypertension, and patological myopia categories versus a control group. We analyze fundus imagery from 1000 patients. Early findings indicate there may be benefit in terms of accuracy and loss function minimization of 2.07% and 1.979x respectively compared to a similar method implemented using traditional computers.

The drug discovery process is a rigorous and time-consuming endeavor, typically requiring several years of extensive research and development. Although classical machine learning (ML) has proven successful in this field, its computational demands in terms of speed and resources are significant. In recent years, researchers have sought to explore the potential benefits of quantum computing (QC) in the context of ML, leading to the emergence of Quantum Machine Learning (QML) as a distinct research field. The objective of the current study is twofold: first, to present a review of the proposed QML algorithms for application in the drug discovery pipeline, and second, to compare QML algorithms with their classical and hybrid counterparts in terms of their efficiency. A query-based search of various databases took place, and five different categories of algorithms were identified in which QML was implemented. The majority of QML applications in drug discovery are primarily focused on the initial stages of the drug discovery pipeline, particularly with regard to the identification of novel drug-like molecules. Comparison results revealed that QML algorithms are strong rivals against the classical ones and a hybrid solution is the recommended approach at present.

The rapid development of quantum computing devices promises powerful machines with capabilities that solve a wide range of problems that traditional computers cannot. Therefore, quantum computers generate new threats at unprecedented speed and scale and specifically pose an enormous threat to encryption. Lattice-based cryptography is considered to be the rival to a quantum computer attack and the future of post-quantum cryptography. So, cryptographic protocols based on lattices have a variety of benefits, like security, efficiency, lower energy consumption, and speed. In this work, we study the most well-known lattice-based cryptosystems while a systematic evaluation and comparison is presented also, and focuses on their strengths and weaknesses.

Continuous-variable quantum key distribution (CV-QKD) shows potential for the rapid development of an information-theoretic secure global communications network; however, the complexities of CV-QKD implementation remain a restrictive factor. Machine learning (ML) has recently shown promise in alleviating these complexities. ML has been applied to almost every stage of CV-QKD protocols, including ML-assisted phase error estimation, excess noise estimation, state discrimination, parameter estimation and optimization, key sifting, information reconciliation, and key rate estimation. This survey provides a comprehensive analysis of the current literature on ML-assisted CV-QKD. In addition, the survey compares the ML algorithms assisting CV-QKD with the traditional algorithms they aim to augment, as well as providing recommendations for future directions for ML-assisted CV-QKD research.

Lattice and code cryptography can replace existing schemes such as Elliptic Curve Cryptography because of their resistance to quantum computers. In support of public key infrastructures, the distribution, validation and storage of the cryptographic keys is then more complex to handle longer keys. This paper describes practical ways to generate keys from physical unclonable functions, for both lattice and code based cryptography. Handshakes between client devices containing the PUFs and a server are used to select sets of addressable positions in the PUFs, from which streams of bits called seeds are generated on demand. The public and private cryptographic key pairs are computed from these seeds together with additional streams of random numbers. The method allows the server to independently validate the public key generated by the PUF, and act as a certificate authority in the network. Technologies such as High performance computing, and graphic processing units can further enhance security by preventing attackers to make this independent validation when only equipped with less powerful computers.

This is a short introductory review on quantum-like modeling of cognition with applications to decision making and rationality. The aim of the review is twofold: a) to present briefly the apparatus of quantum information and probability theory useful for such modeling; b) to motivate applications of this apparatus in cognitive studies and artifical intelligence, psychology, decision making, social and political sciences. We define quantum rationality as decision making that is based on quantum information processing. Quantumly and classically rational agents behaves differently. A quantum-like agent can violate the Savage Sure Thing Principle, the Aumann theorem on impossibility of agreeing to disagree.Such an agent violates the basic laws of classical probability, e.g., the law of total probability and the Bayesian probability inference. In some contexts, ``irrational behavior'' (from the viewpoint of classical theory of rationality) can be profitable, especially for agents who are overloaded by a variety of information flows. Quantumly rational agents can save a lot of information processing resources. At the same time, this sort of rationality is the basis for quantum-like socio-political engineering, e.g., social laser. This rationality plays the important role in the process of decision making not only by biosystems, but even by AI-systems. The latter equipped with quantum(-like) information processors would behave irrationally, from the classical viewpoint. As for biosystems, quantum rational behavior of AI-systems has its advantages and disadvantages. Finally, we point out that quantum-like information processing in AI-systems can be based on classical physical devices, e.g., classical digital or analog computers.

Several commerical quantum computers are now available that offer Hybrid Classical-Quantum computing. Application is made to a classical-quantum model of human neocortex, Statistical Mechanics of Neocortical Interactions (SMNI), which has had its applications published in many papers since 1981. However, this project only uses Classical (super-)computers. Since 2015, PATHINT, has been used as a numerical algorithm for folding path-integrals. Applications in several systems in several disciplines has generalized been from 1 dimension to N dimensions, and from classical to quantum systems, qPATHINT. Papers have applied qPATHINT to neocortical interactions and financial options. The classical space described by SMNI applies nonlinear nonequilibrium multivariate statistical mechanics to synaptic neuronal interactions, while the quantum space described by qPATHINT applies synaptic contributions from Ca2+ waves generated by astrocytes at tripartite neuron-astrocyte-neuron sites. Previous SMNI publications since 2013 have calculated the astrocyte Ca2+ wave synaptic interactions from a closed-form (analytic) expression derived by the author. However, more realistic random shocks to the Ca2+ waves from ions entering and leaving these wave packets should be included using qPATHINT between electroencephalographic (EEG) measurements which decohere the quantum wave packets. This current project extends calculations to multiple scales of interaction between classical events and expectations over the Ca2+ quantum processes to include these random shocks to fit EEG data to the SMNI model, with previous analytic forms for the quantum processes replaced by qPATHINT. The classical-quantum system is fit using the author's Adaptive Simulated Annealing (ASA) importance-sampling optimization code. Gaussian Quadratures are used for numerical calculation of momenta expectations of the astrocyte processes that contribute to SMNI synaptic interactions. This project demonstrates how some hybrid classical-quantum systems may be calculated using only classical (super-)computers. Recent calculations also are reported using the closed-form expression, with and without shocks.

Deep learning is improving by leaps and bounds in remote sensing images (RSIs) analysis, pre-trained convolutional neural networks (CNNs) have shown remarkable performance in remote sensing image scene classification (RSISC). Nonetheless, pre-trained CNNs require massive annotated data as samples for data training. When labeled samples are not sufficient, the most common solution is to the pre-trained CNNs using a great deal of natural image dataset (e.g. ImageNet). However, these pre-trained CNNs require a large quantity of labelled data for training, which is often not feasible in RSISC, especially when the target RSIs have different imaging mechanisms from RGB natural images. In this paper, we proposed an improved hybrid classical-quantum transfer learning CNNs composed of classical and quantum elements to classify open-source RSI dataset. The classical part of the model is made up of a ResNet network which extracts useful features from RSI datasets. To further refine the network performance, a tensor quantum circuit is subsequently employed by tuning parameters on near-term quantum processors. We tested our models on open-source RSI dataset. In our comparative study, we have concluded that the hybrid classical-quantum transferring CNN has achieved better performance than other pre-trained CNNs based RSISC methods with small training samples. Moreover, it has been proved that the proposed algorithm improves the classification accuracy while greatly decreasing sum of model parameters and sum of training data.

Information security plays a major role in the dynamics of today’s interconnected world. Despite the successful implementation and effectiveness of modern cryptographic techniques, their inherent limitations can be exploited by quantum computers. In this article we discuss Grover’s quantum searching algorithm and its impact on the security of modern symmetric ciphers. More specifically, we present its formal description and give an implementation of the algorithm using IBM’s Qiskit framework, which allows us to simulate and run the program on a real device. The developed program is modular and scalable, managing to properly run on any input state. We compare the performance of the algorithm running on the local simulator against its execution on a quantum processor from IBM’s lineup, noting the discrepancies between the results due to physical characteristics of the chip.

Moore’s law will cease to be relevant once transistors are the size of electrons. Once this occurs, we will no longer be able to use silicon for technological advancement. However, breakthroughs will continue in the form of a sixth paradigm: a 3D molecular computing model such as quantum comput- ing. Some of the promising areas of quantum computing researched in this study are (i) algorithmic advancements - such as Shor’s, Grover’s, error correction, fault tolerance and other new algorithms; (ii) hardware - such as the quantum system architecture, circuit models, entanglement, superposition and no-cloning qubits; (iii) market segments - such as finance, healthcare, and chemistry; (iv) the supremacy established over classical computing; and (v) areas of applicability. Significant progress has been made in these areas in recent decades, and they have garnered immense interest, attention and the funding required to make good progress.

Quantum computing represents a paradigm shift in computational power, promising exponential speedups for solving certain classes of problems. However, harnessing the full potential of quantum computers requires effective utilization of data science techniques. In this review paper, we explore the intersection of data science and quantum computing, focusing on the role of data analytics in advancing quantum computing applications. We begin with an overview of quantum computing fundamentals, including quantum mechanics principles and quantum algorithms. We then delve into topics such as quantum data representation, manipulation, and machine learning algorithms tailored for quantum computing environments. Additionally, we discuss quantum error correction and noise mitigation strategies essential for reliable quantum computation. Furthermore, we survey the landscape of quantum software development tools and frameworks, highlighting their importance in facilitating quantum algorithm design and optimization. Through case studies and examples, we demonstrate the practical applications of data science techniques in quantum computing, including quantum cryptography and quantum-enhanced data analysis. Finally, we identify future research directions and challenges in the field, emphasizing the need for interdisciplinary collaboration between the data science and quantum computing communities to unlock the full potential of quantum data science.

Quantum computing arrives. Preceded by Mādhava of Sangamagrāma and other Hindu mathematicians, around 1,500 CE, and our previous work, we show at least 4 quantum properties that are indeed universal in some number systems; here we use them to enable quantum computing. Using the sets B={0,1}, B^n, N, Z, Q, and Q*, one has +4 quantum properties that one can trust, as archetypes of easy communication to friends and foes, to ignoranti or cognoscenti, and for quantum consciousness. Therefore, this work applies to computer calculations, apps in cell phones, algebra, atoms, mathematics, physics, and the human mind.

The study of the human psyche has elucidated a bipartite structure of logic reflecting the quantum--classical nature of the world. Accordingly, we posited an approach toward studying the brain by means of the quantum--classical dynamics of a mixed Weyl symbol. The mixed Weyl symbol can be used to describe brain processes at the microscopic level and, when averaged over an appropriate ensemble, can provide a link to the results of measurements made at the meso and macro scale. Within this approach, quantum variables (such as, for example, nuclear and electron spins, dipole momenta of particles or molecules, tunneling degrees of freedom, and so on) can be represented by spinors, whereas the electromagnetic fields and phonon modes can be treated either classically or semi-classically in phase space by also considering quantum zero-point fluctuations. Quantum zero-point effects can be incorporated into numerical simulations by controlling the temperature of each field mode via coupling to a dedicated Nos\'e-Hoover chain thermostat. The temperature of each thermostat was chosen in order to reproduce quantum statistics in the canonical ensemble. In this first paper, we introduce a general quantum--classical Hamiltonian model that can be tailored to study physical processes at the interface between the quantum and the classical world in the brain. While the approach is discussed in detail, numerical calculations are not reported in the present paper, but they are planned for future work. Our theory of brain dynamics subsumes some compatible aspects of three well-known quantum approaches to brain dynamics, namely the electromagnetic field theory approach, the orchestrated objective reduction theory, and the dissipative quantum model of the brain. All three models are reviewed.

The shortage of quantum computers, and their current state of development, constraints research in many fields that could benefit from quantum computing. Although the work of a quantum computer can be simulated with classical computing, personal computers take so long to run quantum experiments that they are not very useful for the progress of research. This manuscript presents an open quantum computing simulation platform that enables quantum computing researchers to have access to high performance simulations. This platform, called QUTE, relies on a supercomputer powerful enough to simulate general purpose quantum circuits of up to 38 qubits, and even more under particular simulations. This manuscript describes in-depth the characteristics of the QUTE platform and the results achieved in certain classical experiments in this field, which would give readers an accurate idea of the system capabilities.

Recent advances in quantum computing systems attract tremendous attention. Commercial companies, such as IBM, Amazon, and IonQ, have started to provide access to noisy intermediate-scale quantum computers. Researchers and entrepreneurs attempt to deploy their applications that aim to achieve a quantum speedup. Grover’s algorithm and quantum phase estimation are the foundations of many applications with the potential for such a speedup. While these algorithms, in theory, obtain marvelous performance, deploying them on existing quantum devices is a challenging task. For example, quantum phase estimation requires extra qubits and a large number of controlled operations, which are impractical due to low-qubit and noisy hardware. To fully utilize the limited onboard qubits, we develop a distributed application with a key-value data structure based on Grover’s algorithm called IQuCS . Consider a database with duplicates. By encoding each element to a binary type with a unique key and forming a key-value pair, we can count the number of occurrences of each element in the database based on quantum computing. We have optimized the operation process by filtering data points to make it more efficient. To determine the effect of this optimization, we evaluate it with datasets of different sizes and with different numbers of duplicates. With the assistance of classical computers, IQuCS can reduce the problem set for each query. Due to this reduction, IQuCS requires fewer qubits. Through the iterative management, IQuCS achieves a reduction of qubit virtualized consumption, up to 66.2%, with reasonable accuracy.

We study the performance of a classical and quantum magnetic Otto cycle with a quantum dot as a working substance using the Fock-Darwin model with the inclusion of the Zeeman interaction. Modulating an external/perpendicular magnetic field, we found in the classical approach an oscillating behavior in the total work that is not perceptible under the quantum formulation. Also, we compare the work and efficiency of this system for different regions of the Entropy, $S(T,B)$, diagram where we found that the quantum version of this engine always shows a reduced performance in comparison to his classical counterpart.

In the past 100 years, quantum theory has achieved remarkable achievements and formed a relatively mature system, but at the same time there are still some incomplete places. For example: What is the origin of quantum? What is the origin of quantum entanglement? What is the origin of quantum mechanical wave-particle duality? This is still a problem that the existing quantum theory has not solved. Therefore, this paper attempts to seek a classic interpretation of quantum mechanics to make up for the shortcomings of existing quantum theory. In the latest research, this paper finds a classic interpretation of blackbody radiation, which can explain the discontinuity of light energy from the perspective of classical mechanics. Based on this discovery, this paper successfully explains the origin of quantum, quantum entanglement and wave-particle duality, and eliminates the confusion of quantum mechanical probability waves.

Quantum cryptography revolutionizes secure information transfer, providing defense against both quantum and classical computational attacks. The primary challenge in extending the reach of quantum communication comes from the exponential decay of signals over long distances. Addressing this challenge, we have developed Quantum-protected Control-based Key Distribution (QCKD), overcoming transmission range limitations by monitoring signal leakages and rendering leaked quantum states significantly non-orthogonal. This paper reports on the experiments with the QCKD, conducted over a 1,707 km fiber line. We demonstrate advancements in critical components of the protocol, showing its remarkable scalability and adaptability for extended distances and multi-user configurations.

The Newton-Hooke duality and its generalization to arbitrary power laws in classical, semiclassical and quantum mechanics are discussed. We pursue a view that the power-law duality is a symmetry of the action under a set of duality operations. The power dual symmetry is defined by invariance and reciprocity of the action in the form of Hamilton’s characteristic function. We find that the power-law duality is basically a classical notion and breaks down at the level of angular quantization. We propose an ad hoc procedure to preserve the dual symmetry in quantum mechanics. The energy-coupling exchange maps required as part of the duality operations that take one system to another lead to an energy formula that relates the new energy to the old energy. The transformation property of Green function satisfying the radial Schrödinger equation yields a formula that relates the new Green function to the old one. The energy spectrum of the linear motion in a fractional power potential is semiclassically evaluated. We find a way to show the Coulomb-Hooke duality in the supersymmetric semiclassical action. We also study the confinement potential problem with the help of the dual structure of a two-term power potential.

In this study, we address the formidable challenge of solving large-scale Max-Cut problems (MCP). We introduce a rapid computational procedure utilizing a hybrid 1-flip/r-flip local search heuristic. This innovative strategy significantly reduces the computational time required for MCP problems while consistently generating solutions of exceptional quality. The paper presents substantial computational insights, showcasing the effectiveness of our approach on very-large-scale Max-Cut instances with varying densities. Our proposed heuristic is rigorously evaluated by comparing its performance against a quantum annealing solver, leveraging a multi-start Tabu Search framework. The results underscore the potency of this unique combination as an efficient and effective solution for large-scale QUBO problems. Notably, our hybrid heuristic consistently delivers high-quality solutions within the stringent CPU time limits of 600 seconds, demonstrating its efficacy across Max-Cut instances ranging from 10,000 to 40,000 variables. This research contributes to advancing the state-of-the-art in large-scale QUBO problem-solving, offering a powerful and time-efficient approach with broad applicability.

n our previous paper, we showed that the so-called quantum entanglement also exists in classical mechanics. The inability to measure this classical entanglement was rationalized with the definition of a classical observer which collapses all entanglement into distinguishable states. It was shown that evidence for this primary coherence is Newton’s third law. However, in reformulating a "classical entanglement theory" we assumed the existence of Newton’s second law as an operator form where a force operator was introduced through a Hilbert space of force states. In this paper, we derive all related physical quantities and laws from basic quantum principles. We not only define a force operator but also derive the classical mechanic's laws and prove the necessity of entanglement to obtain Newton’s third law.

Artificial intelligence and Quantum science supports path-breaking technologies for main technological change. The investigation goal of this study is to examine their scientific and technological development to explain drivers of these disruptive technologies. Analyses of data, based on publications and patents in quantum science and artificial intelligence, with a technometric model show that that quantum science and technology has a growth rate of 1.07, artificial Intelligence ha a rate of growth of 1.37, whereas the interaction of quantum science and artificial intelligence generates a convergent technological trajectory that has an accelerated rate of growth of 1.58, higher than trends of these technologies taken individually. These findings here clarify one of the fundamental determinants of the evolution of path-breaking technologies that can support decision making of policymakers, technology analysts and R&D managers to direct R&D investments towards fruitful inter-relationships between radical technologies that foster scientific and technological change in knowledge economies.

Inferring algorithmic structure in data is essential for discovering causal generative models. In this research, we present a quantum computing framework using the circuit model, for estimating algorithmic information metrics. The canonical computation model of the Turing machine is restricted in time and space resources, to make the target metrics computable under realistic assumptions. The universal prior distribution for the automata is obtained as a quantum superposition, which is further conditioned to estimate the metrics. Specific cases are explored where the quantum implementation offers polynomial advantage, in contrast to an indispensable exhaustive enumeration in the corresponding classical case. The unstructured output data and the computational irreducibility of Turing machines make this algorithm impossible to approximate using heuristics. Thus, exploring the space of program-output relations is one of the most promising problems for demonstrating quantum supremacy using Grover search that cannot be dequantized. Experimental use cases for quantum acceleration are developed for self-replicating programs and algorithmic complexity of short strings. With quantum computing hardware rapidly attaining technological maturity, we discuss how this framework will have significant advantage for various genomics applications in meta-biology, phylogenetic tree analysis, protein-protein interaction mapping and synthetic biology. This is the first time experimental algorithmic information theory is implemented using quantum computation. Our implementation on the Qiskit quantum programming platform is copy-left and can be found on https://github.com/Advanced-Research-Centre/QPULBA

On the basis of a limited number of reasonable axioms, we discuss the classification of all the possible universality classes of diffeomorphisms invariant metric theories of quantum gravity. We use the language of the renormalization group and adopt several ideas which originate in the context of statistical mechanics and quantum field theory. Our discussion leads to several ideas that could affect the status of the asymptotic safety conjecture of quantum gravity and give universal arguments towards its proof.

A single qubit may be represented on the Bloch sphere or similarly on the 3-sphere S3. Our goal is to dress this correspondence by converting the language of universal quantum computing (UQC) to that of 3-manifolds. A magic state and the Pauli group acting on it define a model of UQC as a positive operator-valued measure (POVM) that one recognizes to be a 3-manifold M3. More precisely, the d-dimensional POVMs defined from subgroups of finite index of the modular group PSL(2, Z) correspond to d-fold M3- coverings over the trefoil knot. In this paper, one also investigates quantum information on a few ‘universal’ knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on the software SnapPy. Further connections between POVMs based UQC and M3’s obtained from Dehn fillings are explored.

A single qubit may be represented on the Bloch sphere or similarly on the $3$-sphere $S^3$. Our goal is to dress this correspondence by converting the language of universal quantum computing (uqc) to that of $3$-manifolds. A magic state and the Pauli group acting on it define a model of uqc as a POVM that one recognizes to be a $3$-manifold $M^3$. E. g., the $d$-dimensional POVMs defined from subgroups of finite index of the modular group $PSL(2,\mathbb{Z})$ correspond to $d$-fold $M^3$- coverings over the trefoil knot. In this paper, one also investigates quantum information on a few \lq universal' knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on SnapPy. Further connections between POVMs based uqc and $M^3$'s obtained from Dehn fillings are explored.

In this paper major machine learning (ML) tools and the most important applications developed elsewhere for numerical weather and climate modeling systems (NWCMS) are reviewed. NWCMSs are briefly introduced. The most important papers published in this field in recent years are reviewed. The advantages and limitations of the ML approach in applications to NWCMS are briefly discussed. Currently, this field is experiencing explosive growth. Several important papers are published every week. Thus, this paper should be considered a simple introduction to the problem.

A challenge in building large-scale superconducting quantum processors is the precise control and manipulation of the qubit state. However, the crosstalk between the microwave control lines impedes the parallel execution of high-fidelity digital and analog quantum operations. Here, we propose and demonstrate a universal compensation protocol for calibrating the microwave signal crosstalk. We also introduce amplified error sequences to optimize the accuracy. Furthermore, we show a definitive improvement in parallel gate operations with crosstalk cancellation, demonstrating the technique's effectiveness. This work paves the way for superconducting hardware that features automated calibration of microwave crosstalk, leading to enhanced fidelities in multiqubit circuits.

This paper explores an event-based version of quantum mechanics which differs from the commonly accepted one, even though the usual elements of quantum formalism, e.g., the Hilbert space, are maintained. This version introduces as primary element the occurrence of micro-events induced by usual physical (mechanical, electromagnetic and so on) interactions. These micro-events correspond to state reductions and are identified with quantum jumps, already introduced by Bohr in his atomic model and experimentally well established today. Macroscopic bodies are defined as clusters of jumps; the emergence of classicality thus becomes understandable and time honoured paradoxes can be solved. In particular, we discuss the cat paradox in this context. Quantum jumps are described as temporal localizations of physical quantities; if the information associated with these localizations has to be finite, two time scales spontaneously appear: an upper cosmological scale and a lower scale of elementary "particles''. This allows the interpretation of the Bekenstein limit like a particular informational constraint on the manifestation of a micro-event in the cosmos it belongs. The topic appears relevant in relation to recent discussions on possible spatiotemporal constraints on quantum computing.

This study presents the B92 Quantum Key Distribution scheme and its optimization and implementation considerations. Simulation software was developed to model and analyze the B92 protocol under varying conditions. Another contribution of this work is investigating how this protocol runs on real quantum computing hardware. New eavesdropping schemes were proposed and modeled.

Despite multiple classical outcomes arising from the quantum Rayleigh conversions of photons underlying the propagation of optical waves through dielectric media and the ensuing light-matter interactions, this quantum process has been largely ignored. Several of its outcomes are considered in this article from a physical perspective, e.g., inter-quadrature coupling of photons, phase-dependent amplification in optical directional couplers and related polarization rotation, phase-shifting of weak signals in the optically linear regime, location-dependent coupling coefficient for refractive index gratings, etc. A correct identification of these effects will enable useful design and operation of integrated photonic functional devices.

We investigate the extent to which a two-level quantum system subjected to an external time-dependent drive can be characterized by supervised learning. We apply this approach to the case of bang-bang control and the estimation of the offset and the final distance to a given target state. The estimate is global in the sense that no a priori knowledge is required on the parameters to be determined. Different neural network algorithms are tested on a series of data sets. We point out the limits of the estimation procedure with respect to the properties of the mapping to be interpolated. We discuss the physical relevance of the different results.

Chemistry has been viewed as one of the most fruitful near-term applications to science of quantum computing. Recent work in transitioning classical algorithms to a quantum computer has led to great strides in improving quantum algorithms and illustrating their quantum advantage. Much less effort has been placed on how one finishes these calculations by using the results from the quantum computer (on the active region of the molecule) and embeds them back into the remainder of the molecule in order to determine the properties of the entire molecule. Such strategies are critical if one wants to expand the focus to biochemical molecules that contain active regions that cannot be properly explained with classical algorithms on classical computers. While we do not solve this problem here, we provide an overview of where the field is going to enable such problems to be tackled in the future.

This paper uncovers that quantum uncertain principle makes the single particle with global property have no certain path, and then wave of quantum particle can simultaneously do pass the double slits. The two subwaves after passing Young’s double slits are entanglement, they may form interference of subwaves. Consequently, we find a kind of quantum probabilistic entanglements with Wheeler's delayed choice. Quantum particles such as photons, electrons, neutrons, protons etc mean that wave of the quantum particle can simultaneously do pass through Young's double slits, rather than individual quantum particle may pass through Young's double slits at the same time. When considering wave property, we cannot consider particle property (Just as in the photoelectric effect, considering the particle nature of the system, people cannot consider wave property, otherwise the photoelectric effect cannot appear). Therefore, this paper discovers that the ability of single photon to hit electrons out in photoelectric effect is complementarily equivalent to the ability of wave of the single photon to simultaneously pass through Young's double slits in wave-particle duality. Objective criteria for distinguishing classical and quantum particles are discovered and objectively give the applicable realm of quantum mechanics for the first time. The crisis of the single particle’s simultaneously passing through Young's double slits, which has been plaguing physicists in the whole world up to now for decades, is solved, in which the studies are classified as classical and quantum particles, the classical particle and quantum particle wave cannot and can pass the Young’s slits, respectively. This paper discovers both the new physics mechanism of passing the double slits of the wave with the amplitude of 4-dimensional momentum representation wave function reflecting particle nature and the principle of self-adaptive emergence of wave-particle duality, and then using the principle, this paper gives both direct explanations to the current experiments and new predictions of new some experiments for wave-particle duality. All the deduced results here are consistent with all relevant physics experiments.

Two opposed p–n diodes are connected with another junction that causes cancellation of the electric field in the depletion layer of each diode by the field of the other diode. This derived quantum diode is called the A system. Another dual diode, constructed by the same process but with the p- and n-types positioned as duality, called the B system. When a bias voltage is applied between the A and B systems, Lorentz conservation imparts a momentum (i.e., a wave number) to the carriers in the absence of any internal voltage. Thus, a superconducting bias current density appears without the need for cooling. The reappearances of electron–hole pairs on the junction surfaces are assumed to be described by entire wavefunctions normalized by the band gap. Based on the bias superconducting current, NOT and NAND gates were constructed from the quantum diode systems. Numerical calculations revealed that the constant phases of the entire wavefunctions of the p-and n-types converged. Accordingly, it was clarified that Bose–Einstein condensation and the Meissner effect (described by the London equation) occurred in the quantum diode systems. Moreover, the systems exhibited rectification characteristics and a switching speed of the order of 10^-14 s. Combining this switching property with the large bias superconducting current (of the order of several V), we developed NOT and NAND gates with direct quantum correlations among many qubits, which are unaffected by random and thermal noises. These gates have memorization and initialization properties and are compatible with existing and accumulating programing algorithms. Moreover, when harvesting a divergent current output from these systems, the bias superconducting current and memorization property preserve the formed quantum correlations.

In this paper we try to demonstrate that the classical model of certainty factos for dealing with innacurate knowledge can be efficiently implemented in a quantum environment. For this, we assume that certainty factors are strongly correlated with the quantum probability. We first explore the certainty factors approach for inexact reasoning from a classical point of view. Next, we introduce some basic aspects of quantum computing, and we pay special attention to quantum rule-based systems. We then build a use case: an inferential network to be implemented in both, the classical approach and the corresponding quantum circuit. Both implementations have been used to compare the behavior of the classical and the quantum approaches when confronted with the same hypothetical case. We analyze three different situations: (1) Only Imprecision (which refers to inaccuracy in declarative knowledge or facts) is present in the use case, (2) Only Uncertainty (which refers to inaccuracy in procedural knowledge or rules) is present in the use case, and (3) Both Imprecision and Uncertainty are present in the use case. Finally, we analyze the results to reach a conclusion about the eventually intrinsic probabilistic nature of the certainty factors model and to pave the way for future quantum implementations of this method for handling inaccurate knowledge.

Human decision-making is increasingly supported by artificial intelligence (AI) systems. From medical imaging analysis to self-driving vehicles, AI systems are becoming organically embedded in a host of different technologies. However, incorporating such advice into decision-making entails a human rationalization of AI outputs for supporting beneficial outcomes. Recent research suggests intermediate judgments in the first stage of a decision process can interfere with decisions in subsequent stages. For this reason, we extend this research to AI-supported decision-making to investigate how intermediate judgments on AI-provided advice may influence subsequent decisions. In an online experiment (N=192), we found a consistent bolstering effect in trust for those who made intermediate judgments and over those who did not. Furthermore, violations of total probability were observed at all timing intervals throughout the study. We further analyzed the results by demonstrating how quantum probability theory can model these types of behaviors in human-AI decision-making and ameliorate the understanding the interaction dynamics at the confluence of human factors and information features.

It is shown that the representation theory of some finitely presented groups thanks to their $SL_2(\mathbb{C})$ character variety is related to algebraic surfaces. We make use of the Enriques-Kodaira classification of algebraic surfaces and the related topological tools to make such surfaces explicit. We study the connection of $SL_2(\mathbb{C})$ character varieties to topological quantum computing (TQC) as an alternative to the concept of anyons. The Hopf link $H$, whose character variety is a Del Pezzo surface $f_H$ (the trace of the commutator), is the kernel of our view of TQC. Qutrit and two-qubit magic state computing, derived from the trefoil knot in our previous work, may be seen as TQC from the Hopf link. The character variety of some two-generator Bianchi groups as well as that of the fundamental group for the singular fibers $\tilde{E}_6$ and $\tilde{D}_4$ contain $f_H$. A surface birationally equivalent to a $K_3$ surface is another compound of their character varieties.

In the ever-evolving landscape of higher education, the shift to hybrid teaching approaches has introduced novel challenges and opportunities for both educators and students. This qualitative study, grounded in a robust theoretical framework, combines in-depth literature reviews, informal interviews, observations, and thematic analysis to explore the multifaceted dynamics of hybrid language learning within a College of Arts and Sciences. By investigating the experiences of twenty students (referred to as 'S-Part 1' to 'S-Part 20'), the research delves into the core theme of 'Teacher-Student Interaction in Higher Education Institutions' and unpacks nine additional themes: 'Adaptability and Resilience,' 'Flexibility and Autonomy,' 'Connectivity Challenges,' 'Feelings of Isolation,' 'Technology Competence,' 'Personalized Learning,' 'Resource Accessibility,' 'Support Mechanisms,' and 'Positive Learning Experiences.' In this study, these themes encapsulate the diverse experiences and challenges encountered by teachers and college students as they navigate the evolving educational landscape. The insights derived from the study are underpinned by a robust theoretical framework and complemented by existing scholarly literature. As we delve into these themes, it becomes evident that they shed light on not only the intricacies of hybrid language learning but also the broader educational context, offering valuable guidance for educators, institutions, students, and researchers. Based on the ample results, recommendations are presented for school administrators, teachers, students, and future researchers to enhance the quality of hybrid teaching and learning, aligning it with the demands of the post-academic era. Overall, this study contributes to the ongoing dialogue on innovative pedagogical strategies and responsive educational environments, underlining the significance of teacher-student interaction in the new normal of higher education.

This study provides an in-depth exploration and analysis of the complex aspects of Public Key Cryptography, focusing on the vulnerabilities, potential attack vectors, and the consequential impacts of key compromises. The discussion extends beyond the conventional technical paradigms, offering a holistic perspective that intertwines theoretical insights with practical implications, thereby contributing to a more comprehensive understanding of cryptographic security. The paper delves into the intricacies of brute-force attacks, elucidating the significance of key sizes, encryption algorithms, and the inherent resilience of cryptographic systems against such attacks. It further examines the ramifications of key compromises in Public Key Cryptography, highlighting the repercussions on confidentiality, integrity, trust, and legal and reputational standing. The study underscores the importance of maintaining the security and integrity of cryptographic keys and provides practical recommendations to mitigate the risks associated with key compromises. These include enhanced awareness and education, stringent protection of sensitive information, proactive risk management, strict compliance with regulations and standards, and the promotion of a security-centric culture. The insights gleaned from this study are pivotal in informing future research, policy development, cryptographic implementations, and the cultivation of secure practices, fostering a more secure, resilient, and ethical digital environment in the face of an evolving threat landscape. The contributions of this study are instrumental in advancing the field of cryptography and enhancing the overall understanding of the challenges and considerations inherent in implementing robust cryptographic practices.

The work proposes a new approach for evolutionary global optimization which, in simple terms, may be described as a fusion of quantum and simulated annealing. This becomes possible by using basic concepts from Homotopy Theory, conjugated to the already existing Fuzzy Adaptive Simulated Annealing paradigm and other components. In this fashion, it occurs a temporal and nonlinear superposition of the two types of annealing, provoking interesting effects in runtime, including the so-called quantum tunneling, when there is a sudden transition between attraction basins of different minima without "climbing" potential barriers. In addition, the proposal includes a generalization of the "deformation" of Hamiltonians used in quantum annealing by suggesting the use of general homotopies between the surface corresponding to the cost function under processing and another specific landscape, being this possible because of the ability of Fuzzy ASA of handling time-varying objective functions. The proposed paradigm shows that it is possible and beneficial to superpose the two types of annealing, displaying amazing numerical results and suggesting a kind of interlacing or synergic behavior - perhaps we could call it an "annealing entanglement". Finally, given the fast advances in commercial quantum annealing processors, it seems sensible to expect that an implementation of the proposed approach using such devices may occur very soon. In order to demonstrate the efficacy of the proposed algorithm, some significant and detailed examples are included in the text, so as to illustrate and clarify the presented ideas.

Phase transitions- both in the classical and in the quantum version- are the perfect playground for appreciating universality at work. Indeed, the fine details become unimportant and a classification in very few universality classes is possible. Very recently, a striking deviation from this picture has been discovered: some antiferromagnetic spin chains with competing interactions show a different set of phase transitions depending on the parity of number of spins in the chain. The aim of this article is to demonstrate that the same behavior also characterizes the most simple quantum spin chain: the Ising model in a transverse field. By means of an exact solution based on a Wigner-Jordan transformation, we show that a first order quantum phase transition appears at zero applied field in the odd spin case, while it is not present in the even case. A hint of a possible physical interpretation is given by the combination of two fact: at the point of the phase transition, the degeneracy of the ground state in the even and the odd case substantially differ, being respectively 2 and 2N, with N the number of spins; the spin of the most favorable kink states changes at that point.

The paper considers the symmetries of a bit of information corresponding to one, two or three qubits of quantum information and identifiable as the three basic symmetries of the Standard model, U(1), SU(2), and SU(3) accordingly. They refer to “empty qubits” (or the free variable of quantum information), i.e. those in which no point is chosen (recorded). The choice of a certain point violates those symmetries. It can be represented furthermore as the choice of a privileged reference frame (e.g. that of the Big Bang), which can be described exhaustively by means of 16 numbers (4 for position, 4 for velocity, and 8 for acceleration) independently of time, but in space-time continuum, and still one, 17th number is necessary for the mass of rest of the observer in it. The same 17 numbers describing exhaustively a privileged reference frame thus granted to be “zero”, respectively a certain violation of all the three symmetries of the Standard model or the “record” in a qubit in general, can be represented as 17 elementary wave functions (or classes of wave functions) after the bijection of natural and transfinite natural (ordinal) numbers in Hilbert arithmetic and further identified as those corresponding to the 17 elementary of particles of the Standard model. Two generalizations of the relevant concepts of general relativity are introduced: (1) “discrete reference frame” to the class of all arbitrarily accelerated reference frame constituting a smooth manifold; (2) a still more general principle of relativity to the general principle of relativity, and meaning the conservation of quantum information as to all discrete reference frames as to the smooth manifold of all reference frames of general relativity. Then, the bijective transition from an accelerated reference frame to the 17 elementary wave functions of the Standard model can be interpreted by the still more general principle of relativity as the equivalent redescription of a privileged reference frame: smooth into a discrete one. The conservation of quantum information related to the generalization of the concept of reference frame can be interpreted as restoring the concept of the ether, an absolutely immovable medium and reference frame in Newtonian mechanics, to which the relative motion can be interpreted as an absolute one, or logically: the relations, as properties. The new ether is to consist of qubits (or quantum information). One can track the conceptual pathway of the “ether” from Newtonian mechanics via special relativity, via general relativity, via quantum mechanics to the theory of quantum information (or “quantum mechanics and information”). The identification of entanglement and gravity can be considered also as a ‘byproduct” implied by the transition from the smooth “ether of special and general relativity’ to the “flat” ether of quantum mechanics and information. The qubit ether is out of the “temporal screen” in general and is depicted on it as both matter and energy, both dark and visible.

Harnessing Quantum Energy States for Unprecedented Computing Capabilities In this proposal, we advocate for the use of energy states as fundamental units of quantum computer programming. Each unit of programming is conceptualized as an energy state, manifested as an essence-unit. An essence-unit, defined as the minimal form encapsulating complete uniqueness or specificity, serves as the cornerstone of this paradigm. This approach enables the recording of various forms of matter on quantum computers in essence-units, portraying their energy states. The recording of energy states is achieved through the creation of four distinct coherent potentials, facilitated by quantum dots or crystals. Crucially, these energy states embodied in essence-units resist subdivision. The study explores the intricate relationship among similarity, fractals, and uniqueness in quantum dot operations, revealing their profound implications for information transfer efficiency. Normalized entropy characterizes charge localized in quantum dot impurities in systems that have distortions. Through the utilization of N-level recording and entropy-fractal dimension equivalence, the paper elucidates the potential of quantum dots in reducing transmission time and modeling complex systems. The proposed methodology signifies a paradigm shift in quantum computing, presenting unparalleled possibilities for tackling hitherto insurmountable challenges.

Inspired by amazing result obtained by Semay [1], this study revisits generalised Kepler's third law of an n-body system from the perspective of dimension analysis. To be compatible with Semay's quantum n-body result, this letter reports a conjecture which had not be included in author's early publication [2] but formulated in the author's research memo. The new conjecture for quantum N-body system is proposed as follows: Tq|Eq|^3/2 = πG/√2[(Σ^N_i=1 Σ^N_j=i+1 m_im_j)³/(Σ^N_k=1 m_k)]^1/2. This formulae is, of course, consistent with the Kepler's third law of 2-body system, and exact same as Semay's quantum result for identical bodies.

General Variable Neighborhood Search (GVNS) is a well known and widely used metaheuristic for efficiently solving many NP-hard combinatorial optimization problems. Quantum General Variable Neighborhood Search (qGVNS) is a novel, quantum inspired extension of the conventional GVNS. Its quantum nature derives from the fact that it takes advantage and incorporates tools and techniques from the field of quantum computation. Travelling Salesman Problem (TSP) is a well known NP-Hard problem which has broadly been used for modelling many real life routing cases. As a consequence, TSP can be used as a basis for modelling and finding routes for Geographical Systems (GPS). In this paper, we examine the potential use of this method for the GPS system of garbage trucks. Specifically, we provide a thorough presentation of our method accompanied with extensive computational results. The experimental data accumulated on a plethora of symmetric TSP instances (symmetric in order to faithfully simulate GPS problems), which are shown in a series of figures and tables, allow us to conclude that the novel qGVNS algorithm can provide an efficient solution for this type of geographical problems.

By utilizing a generalized version of the Madelung quantum-hydrodynamic framework that incorporates noise, we derive a solution using the path integral method to investigate how a quantum superposition of states evolves over time. This exploration seeks to comprehend the process through which a stable quantum state ultimately emerges in the presence of fluctuations induced by the noisy gravitational background. The model defines the conditions that give rise to a limited range of interaction for the quantum potential, allowing for the existence of coarse-grained classical descriptions at a macroscopic level. The theory uncovers the smallest attainable level of uncertainty in an open quantum system and examines its consistency with the localized behavior observed in large-scale classical systems. The research delves into connections and similarities with decoherence theory and the Copenhagen interpretation of quantum mechanics. Additionally, it assesses the potential consequences of wave function decay on the measurement of photon entanglement. To validate the proposed theory, an experiment involving entangled photons transmitted between detectors on the Moon and Mars is discussed. Finally, the findings of the theory are applied to the creation of larger Q-bits systems at elevated temperatures.

Social media has become the most influential battleground for political and societal debate. The reach, the speed, and the fact that everybody can participate make this medium very popular but also highly manipulative, subject to biases and extremely precious to control. Misinformation spreads in an unforeseeable way. Sometimes it just follows usual non-malicious social interaction patterns, but often a targeted and designed-for-purpose manner. In this paper, we propose a novel method to identify the most effective opportunities to moderate the social media debate at a large scale using the properties of social signed graphs, such as structural balance. After building the topic universe for a particular political debate in a given time frame, we extract the most active and influential users and mine their position regarding the topic based on their interactions with other users. The result is a signed graph where each edge represents either support or challenge between a pair of users in the context of the topic. This graph can be modelled as an Ising model, with the goal of minimizing its energy state by using the advantages of Adiabatic Quantum Computing. Applying this principle, we use a Quantum Annealing implementation to solve the problem of finding the edges violating the structural balance of this graph, which in classic computing is known to be an NP-hard problem. We then provide a non-intrusive moderation technique for those violations to mitigate or increase the structural imbalance, depending on the desired strategy. The methodology is shown in the context of the COVID-19 skeptics’ debate in Twitter and implemented using a D-Wave 2000Q-6 quantum annealer.

It is claimed that classical mechanics (CM) in terms of its equivalent Koopman-von Neumann formulation (KvN) is indeed a ’real’ quantum theory since the formalism of quantum mechanics (FQM) does not, nor need it, exclude it as a such. This claim is made manifest by suggesting a common structure of which both KvN and ordinary quantum mechanics (OQM) correspond to unitary representations of, although unitarily inequivalent such. It is shown that OQM is obtained by enforcing the extra physical condition of quantized energy levels, which by itself does not constitute the ’quantum mystery’. It is furthermore shown that KvN in a physically realizable sense contain the hallmark quantum behavior of quantum interference. It is hence concluded that both CM and OQM are subjected to the same foundational issues. As the central part of both KvN and OQM is the introduction of probabilities via FQM it is suggested that the foundational issues regarding FQM are less about FQM itself and more about the concept of probability.

In the Aharonov-Bohm setup, a double-slit experiment, coherent beams of electrons passing through two slits form an interference pattern on the observing screen. However, when a long but thin solenoid of current is introduced behind the slits between the two electron beams, an extra phase difference between them appears, as shown by a shift in the interference pattern. This happens even though there is no magnetic field outside the solenoid, at the location of the beams. This is known as Aharonov-Bohm effect, though the idea was mooted apparently a decade earlier, and the effect sometimes is called Ehrenberg-Siday-Aharonov-Bohm effect. This mysterious effect, purportedly arises owing to an electromagnetic momentum, attributed to the presence at the location of either beam, a vector potential due to the solenoid of current even when there exists no magnetic field outside the solenoid. The first experimental confirmation came soon and It has since been amply verified using clever experimental setups, leaving hardly any doubts that the observed effect is real. However, on the theoretical side the picture is not so clear and a satisfactory physical explanation of the existence of momentum, at least under the aegis of classical electromagnetism, is still missing since inception of the idea more than half a century back. It has remained a puzzle, how just potential, thought to be a mere mathematical tools for calculating electromagnetic field, can give rise to an electromagnetic momentum in a system, in lieu of field itself. We here show that a subtle momentum can be seen to lie in the product of the drift velocities of the current carrying charges and the mass equivalent of their non-localized potential energies in the electric field of the interfering electrons, which manifests, from a classical point of view, a linear momentum in the system. It is this hard-to-pinpoint, additional momentum, reflected through an extra phase difference between the interfering beams of electrons, which exhibits from a classical physics perspective, the presence of an elusive, long sought-after electromagnetic momentum in the system.

Protein phosphorylation and ADP-ribosylation (ADPr), as two types of post-translational modifications (PTM), are the process of adding phosphate group and ADP-ribose moieties to proteins, respectively. Although both PTM types can occur on many amino acid types, serine is the most common. Serine phosphorylation (pS), serine ADPr (SADPr), and their in situ crosstalks (pSADPr) play essential roles in biological processes. Although in silico classifiers have been developed for predicting pS and SADPr sites, the classifier for predicting pSADPr sites is unavailable. In this study, we developed classifiers to predict pSADPr sites. Specifically, we collected 3250 human pSADPr, 7520 SADPr, 151,227 pS and 80,096 unmodified serine sites. Based on them, we investigated the characteristics of pSADPr sites and constructed three classifiers to predict pSADPr sites from the pS dataset, the SADPr dataset and the protein sequences separately. We built and evaluated five deep-learning classifiers in ten-fold cross-validation and independent test datasets. Three of them (e.g. Convolutional Neural Network with the One-Hot encoding, dubbed CNNOH) performed better than the rest two. For instance, CNNOH had the AUC values of 0.700, 0.914 and 0.954 for recognizing pSADPr sites from the SADPr, pS and unmodified serine sites.Therefore, it is challenging to distinguish pSADPr sites from SADPr sites compared to the other two. It is consistent with our observation that pSADPr's characteristics are more similar to those of SADPr than the rest. Furthermore, we used the classifiers as base classifiers to develop a few stacking-based ensemble classifiers to improve performance. However, none of the ensemble classifiers showed better performances, suggesting that the base classifiers have good enough performances. Finally, we developed an online tool for extensively predicting human pSADPr sites based on the CNNOH classifier, dubbed EdeepSADPr. It is freely available through http://edeepsadpr.bioinfogo.org/.

The design and operation of quantum networks are both decisive in the current push towards a global quantum internet. Although space-enabled quantum connectivity has already been identified as a beneficial candidate for long-range quantum channels for over two decades, the architecture of a hybrid space-ground network is still a work in progress. Here, we propose an analysis of such a network based on a best-path approach, where either fiber- or satellite-based elementary links can be concatenated to form a repeater chain. The network consisting of quantum information processing nodes, equipped with both ground and space connections, is mapped into a graph structure, where edge weights represent the achievable secret key rates, chosen as the figure of merit for the network analysis. A weight minimization algorithm allows identifying the best path dynamically, i.e., as the weather conditions, stray light radiance, and satellite orbital position changes. From the results we conclude that satellite links will play a significant role on the future large-scale quantum internet, and both a constellation of satellites and significant advances in filtering technology are required to fulfill continuous coverage.

The new Post Accelerating Data and Knowledge Online Society, or ‘Padkos’ requires a new model of decision making. This introductory paper proposes a model where decision making and learning are a single symbiotic process, incorporating man and machine, as well as the AADD (ánthrōpos, apparatus, decider, doctrina) diamond model of individual and organizational decision-making and learning processes. The learning is incorporated by using a newly proposed quadruple loop learning model. This model allows for controlled changes of identity, the process of creating and the sense making of new mental models and assumption, and reflections. The model also incorporates the recently proposed model of quantum decision-making, where time collapse of the opted past and the anticipated future (explicitly including its time horizon) into the present play a key role in the process, leveraging decision-making and learning by human as well as Artificial Intelligence (AI) and Machine Learning (ML) algorithms. The paper closes with conclusions.

Revealing the time structure of physical or biological objects is usually performed thanks to the tools of signal processing like the fast Fourier transform, Ramanujan sum signal processing and many other techniques. For space-time topological objects in physics and biology, we propose a type of algebraic processing based on schemes in which the discrimination of singularities within objects is based on the space-time-spin group SL(2,C). Such topological objects possess an homotopy structure encoded in their fundamental group and the related SL(2,C) multivariate polynomial character variety contains a plethora of singularities somehow analogous to the frequency spectrum in time structures. Our approach is applied to an Akbulut cork in exotic R4, to an hyperbolic model of topological quantum computing based on algebraic surfaces and to microRNAs in genetics. Such diverse topics reveal the manifold of possibilities of using the concept of a scheme spectrum.

This study presents a modest attempt to interpret, formulate, and manipulate emotion of robots within the precepts of quantum mechanics. Our proposed framework encodes the emotion information as a superposition state whilst unitary operators are used to manipulate the transition of the emotion states which are recovered via appropriate quantum measurement operations. The framework described provides essential steps towards exploiting the potency of quantum mechanics in a quantum affective computing paradigm. Further, the emotions of multi-robots in a specified communication scenario are fused using quantum entanglement thereby reducing the number of qubits required to capture the emotion states of all the robots in the environment, and fewer quantum gates are needed to transform the emotion of all or part of the robots from one state to another. In addition to the mathematical rigours expected of the proposed framework, we present a few simulation-based demonstrations to illustrate its feasibility and effectiveness. This exposition is an important step in the transition of formulations of emotional intelligence to the quantum era.

An adaptor signature can be viewed as a signature concealed with a secret value and, by design, any two of the trio yield the other. In a multiparty setting, an initial adaptor signature allows each party create additional adaptor signatures without the original secret. Adaptor signatures help address scalability and interoperabity issues in blockchain. They can also bring some important advantages to cryptocurrencies, such as low on-chain cost, improved transaction fungibility, and less limitations of a blockchain’s scripting language. In this paper, we propose a new two-party adaptor signature scheme that relies on quantum-safe hard problems in coding theory. The proposed scheme uses a hash-and-sign code-based signature scheme introduced by Debris-Alazard et al. and a code-based hard relation defined from the well-known syndrome decoding problem. To achieve all the basic properties of adaptor signatures formalized by Aumayr et al., we introduce further modifications to the aforementioned signature scheme. We also give a security analysis of our scheme and its application to the atomic swap. After providing a set of parameters for our scheme, we show that it has the smallest pre-signature size compared to existing post-quantum adaptor signatures.

Time evolution of the quantum correlation of the hybrid qubit-qutrit system in multilocal and global dephasing under the effect of a classical noises environment is presented. We considered the qutrit in z direction and the qubit x direction. In addition, our system presents two configurations: the different and the common environment and our discussion involves three types of noises: A Static Noise (SN), Random Telegraph Noise (RTN) and Ornstein- Uhlenbeck noise (OU). By using the density matrix approach to determine the evolution of the state of the system, the found that the static noise is fatal for the quantum entanglement, the quantum correlation and for RTN and OU noises the quantum entanglement, the quantum correlation decreases monotonically with a sufficiently long time. Therefore, we can say that, entanglement and the quantum correlation are more robust to the noise precisely those Random telegraph noise and Ornstein-Uhlenbeck noise.

We investigate a possible reduction mechanism from (bosonic) Quantum Field Theory (QFT) to Quantum Mechanics (QM), in a way that could explain the apparent loss of degrees of freedom of the original theory in terms of quantum information in the reduced one. This reduction mechanism consists mainly in performing an ansatz on the boson field operator, which takes into account quantum foam and non-commutative geometry. Through the reduction mechanism, QFT reveals its hidden internal structure, which is a quantum network of maximally entangled multipartite states. In the end, a new approach to the quantum simulation of QFT is proposed through the use of QFT's internal quantum network

The global spread of COVID-19 led the World Health Organization to declare a pandemic on 11 March 2020. To decelerate this spread, countries have taken strict measures that affected the lifestyle and economy. Various studies have been focused on the identification of COVID-19 impact to mental health of children and adolescents via traditional statistical approaches. However, a machine learning methodology must be developed to explain the main factors that contribute to the change of mood state of children and adolescents during the first lockdown. Therefore, to this study an explainable machine learning pipeline is presented focusing on children and adolescents in Greece, where a strict lockdown was imposed. The target group consists of children and adolescents, recruited from children and adolescent mental health services, who present mental health problems diagnosed before the pandemic. The proposed methodology imposes: (i) data collection via questionnaires; (ii) a clustering process to identify the groups of subjects with amelioration, deterioration and stability to their mood state; (iii) a feature selection process to identify the most informative features that contribute to mood state prediction; (iv) a decision-making process based on an experimental evaluation among classifiers; (v) calibration of the best performing model and (v) a post-hoc interpretation of the features’ impact on the best performing model. The results showed that a blend of heterogeneous features from almost all feature categories is necessary to increase our understanding regarding the effect of COVID-19 pandemic on the mood state of children and adolescents.

1) We shall discuss what modern interpretations say about the Heisenberg's uncertainties. These interpretations explain that a quantity begins to 'lose' meaning when a conjugate property begins to 'acquire' definite meaning. We know that a quantity losing meaning means that it has no fixed value and has an uncertainty . In this paper we look deeper into this interpretation and the outcome reveals more evidence of the quantity losing meaning. Newer insights appear. 2) We consider two extreme cases of hypothetical processes nature undergoes, without interference by a measurement: One, a system collapses to an energy eigenstate under the influence of a Hamiltonian instantaneously at a time $t$. This is thus what would happen if we would measure the system's energy. Next, when a particle becomes localised to a point at a time $t_0$ under the influence of a Hamiltonian. This is thus what would happen if we would measure the system's position. We shall prove that both these situations cannot arise under ordinary circumstances and thus measurement processes cannot be modelled by physical Hamiltonians.

As known all physical properties of solids are described well by the system of quantum linear harmonic oscillators. It is shown in the present paper that the system consisting of classical linear harmonic oscillators having temperature dependent masses or (and) frequencies has the same partition function as the system consisting of quantum linear harmonic oscillators having temperature independent masses and frequencies while the means of the square displacements of the positions of the oscillators from their mean positions for the system consisting of classical linear harmonic oscillators having: the temperature dependent masses; temperature dependent frequencies; and temperature dependent masses and frequencies differ from each other and from that of the system consisting of quantum linear harmonic oscillators, and hence, the system consisting of classical linear harmonic oscillators describes well the thermodynamic properties of the system consisting of quantum linear harmonic oscillators and solids.

Time and space are fundamental concepts for characterizing and understanding our world. Despite of continuous curiosity and extensive studies, the nature of time and space remains elusive, and the underlying quantum structure is unclear. Here we propose a molecular model based on energy space decomposition to incorporate time and space synthetically in a unified framework. In the proposed model, the multipole expansion of action mapped to energy modules in scalar, vector, and matrix forms, results in the generators of time, space, and a material framework, cloud. And the invariance of time, space and cloud transformation corresponds to the conservation of energy, momentum, and mass, respectively. The classification of energy modules reveals a periodicity of energy elements, which constructs a hierarchical world in a molecular framework with dynamics represented by energy transformations. Here the role of time and space could switch from each other, and motion is attributed to the coupling of particle with intermediate bosons, corresponding to energy transformations among different energy modules. The application on Bohr model demonstrates that this picture provides a consistent classical interpretation to the foundation of quantum mechanics, and suggests an atomic model for gravitation.

porous silicon-based photodetectors have attracted more researches due to their high luminous efficiency, good stability and low cost. In this paper, a PbS quantum dots/porous silicon hybrid structure has been fabricated. The PbS quantum dots (QDs) partly infiltrated into the porous silicon (PSi) layer and partly deposited on its surface, which could increase the absorption of near-infrared wavelength range and extend the light absorption in silicon for wavelengths longer than 1100 nm. After that, A metal-semiconductor-metal (MSM) device is fabricated and its response spectrum could extend to the 1200 nm at -3 V. As a silicon-based photodetector (PD), one can envision its role for operation from visible light to short-wavelength infrared range.

There must exist a reformulation of quantum field theory which does not refer to classical time. We propose a pre-quantum, pre-spacetime theory, which is a matrix-valued Lagrangian dynamics for gravity, Yang-Mills fields, and fermions. The definition of spin in this theory leads us to an eight dimensional octonionic space-time. The algebra of the octonions reveals the standard model; model parameters are determined by roots of the cubic characteristic equation of the exceptional Jordan algebra. We derive the asymptotic low energy value 1/137 of the fine structure constant, and predict the existence of universally interacting spin one Lorentz bosons, which replace the hypothesised graviton. Gravity is not to be quantized, but is an emergent four-dimensional classical phenomenon, precipitated by the spontaneous localisation of highly entangled fermions.

The Double Random Phase Encoding (DRPE) image encryption method has garnered significant attention in color image processing and optical encryption, thanks to its parallel encryption of R, G, B. However, DRPE-based color image encryption faces two challenges. Firstly, it disregards the correlation of R, G, and B, compromising the encrypted image's robustness. Secondly, DRPE schemes relying on Discrete Fourier Transform (DFT) and Discrete Fractional Fourier Transform (DFRFT) are vulnerable to linear attacks, such as Known Plaintext Attack (KPA) and Chosen Plaintext Attack (CPA). Quantum walk stands out as a remarkable tool for designing modern cryptographic mechanisms, offering resistance to potential attacks from both classical and quantum computers.Therefore, this study presents an optical color image encryption algorithm that combines two-dimensional quantum walk with 24-bit plane permutation, dubbed OCT. This approach employs pseudo-random numbers generated by Two-Dimensional Quantum Walking (TDQW) for phase modulation in DRPE and scrambles the encrypted image's real and imaginary parts using the Generalized Arnold Transform. The 24-bit plane permutation helps reduce correlation of the R, G, B, while the Generalized Arnold Transform bolsters DRPE's resistance to linear attacks. By incorporating TDQW, the key space is significantly expanded. Experimental results validate the effectiveness and security of proposed method.

Herein is introduced a simple scalar field model derived from classical based kinetic energy, gravitational potential energy, and Special Relativity’s rest mass energy. By applying a classical orbit over the scalar field, relativistic effects are predicted. The scalar field is then applied to a classical model of the Hydrogen atom resulting in a relativistic effect equal to the binding energy of the Hydrogen atom. In addition, the model derives the fine structure constant due to the gravitational effect. The relativistic effects are then discretized in increments equal to the model’s gravitational induced constant. The discretization produces the Hydrogen atom spectral emissions and an angular moment equal to Planck’s reduced constant. The model is not presented as a replacement for current theory, rather it is for inspection and illustration of how a simplistic model may offer a fundamental bridge between the more complex, time proven theories of General Relativity and Quantum Mechanics.

Information can be considered as the most fundamental, philosophical, physical and mathematical concept originating from the totality by means of physical and mathematical transcendentalism (the counterpart of philosophical transcendentalism). Classical and quantum information, particularly by their units, bit and qubit, correspond and unify the finite and infinite. As classical information is relevant to finite series and sets, as quantum information, to infinite ones. A fundamental joint relativity of the finite and infinite, of the external and internal is to be investigated. The corresponding invariance is able to define physical action and its quantity only on the basis of information and especially: on the relativity of classical and quantum information. The concept of transcendental time, an epoché in relation to the direction of time arrow can be defined. Its correlate is that information invariant to the finite and infinite, therefore unifying both classical and quantum information.

Starting with a particle in the cube system, we investigate the exotic possibility that the quantum numbers (n_x,n_y,n_z) satisfy the Markov equation. We find that the proposed particle in the Markov-cube system follows from a non-classical information entropic space by the quantum potential Q. We study the classical correspondents of the proposed particle in the Markov-cube system. According to our proposition, this particle identified by detailed measurements of the confinement particle-energy levels is an artifact or occurs in nature.

(3+1)D quantum mechanics is a four-dimensional quantum formalism, which is developed neither in a Minkowski spacetime, nor in a purely Hilbert space and not its metric is Lorentzian. This quantum mechanics also yields the quantum Einstein field equation in (3+1)D quantum spacetime. Every observable (3+1)D quantum spacetime can be found to contain internally hidden opposite spin quantum state, that results Supersymmetry. Closed continuous mappings of this hidden quantum state immediately yield more extra hidden dimensions including string. This string is found to be fundamentally eleven-dimensional (rather than lower dimensional) by nature within this quantum spacetime, which is necessarily a natural phenomenon of (3+1)D Quantum Mechanics.

The coronavirus pandemic was declared by the World Health Organization (WHO) in 2020, and a global genetic vaccination program has been rapidly implemented as a fundamental solution. However, many countries around the world have reported that so-called genetic vaccines, such as those using modified mRNA encoding the spike protein and lipid nanoparticles as the drug delivery system, have resulted in post-vaccination thrombosis and subsequent cardiovascular damage, as well as a wide variety of diseases involving all organs and systems, including the nervous system. In this article, based on these circumstances and the volume of evidence that has recently come to light, we call the attention of medical professionals to the various risks associated with blood transfusions using blood products derived from people who have suffered from long COVID and from genetic vaccine recipients, including those who have received mRNA vaccines, and we make proposals regarding specific tests, testing methods, and regulations to deal with these risks. We expect that this proposal will serve as a basis for discussion on how to address post-vaccination syndrome and its consequences following these genetic vaccination programs.

This paper examines whether classical extensional mereology is adequate for formalizing the whole-parts relation in quantum chemical systems. Although other philosophers have argued that classical extensional and summative mereology does not adequately formalize whole-parts relation within organic wholes and social wholes, such critiques often assume that summative mereology is appropriate for formalizing the whole-parts relation in inorganic wholes such as atoms and molecules. However, my discussion of atoms and molecules as they are conceptualized in quantum chemistry will establish that standard mereology cannot adequately fulfill this task, since the properties and behavior of such wholes are context-dependent and cannot simply be reduced to the summative properties of their parts. To the extent that philosophers of chemistry have called for the development of an alternative mereology for quantum chemical systems, this paper ends by proposing behavioral mereology as a promising step in that direction. According to behavioral mereology, considerations of what constitutes a part of a whole is dependent upon the observable behavior displayed by these entities. Thus, relationality and context-dependence are stipulated from the outset and this makes behavioral mereology particularly well-suited as a mereology of quantum chemical wholes. The question of which mereology is appropriate for formalizing the whole-parts relation in quantum chemical systems is relevant to contemporary philosophy of chemistry, since this issue is related to the more general question of the reducibility of chemical wholes to their parts and of the reducibility of chemistry to physics, which have been of central importance within the philosophy of chemistry for several decades. More generally, this paper puts contemporary discussions of mereology within the philosophy of chemistry into a broader historical and philosophical context. In doing so, this paper also bridges the gap between formal mereology, conceived as a branch of formal ontology, and ‘applied’ mereology, conceived as a branch of philosophy of science.

Quantum correlations, especially time correlations, are crucial in ghost imaging in order to significantly reduce the background noise on the one hand while increasing the imaging resolution. Moreover, the time correlations serve as a critical reference, distinguishing between signal and noise, which in turn enable clear visualization of biological samples. Quantum imaging also addresses the challenge involved in imaging delicate biological structures with minimal photon exposure and sample damage. Here we explore the recent progress in quantum correlation-based imaging, notably its impact on secure imaging and remote sensing protocols as well as on biological imaging. We also exploit the quantum characteristics of heralded single-photon sources (HSPS) combined with decoy-state methods for secure imaging. This method uses Quantum Key Distribution (QKD) principles to reduce measurement uncertainties and protect data integrity. It is highly effective in low-photon-number regimes for producing high-quality, noise-reduced images. The versatility of decoy-state methods with WCSs (WCS) is also discussed, highlighting their suitability for scenarios requiring higher photon numbers. We emphasize the dual advantages of these techniques: improving image quality through noise reduction and enhancing data security with quantum encryption, suggesting significant potential for quantum imaging in various applications, from delicate biological imaging to secure quantum communication.

Nearest-neighbour clustering is a simple yet powerful machine learning algorithm that finds natural application in the decoding of signals in classical optical-fibre communication systems. Quantum k-means clustering promises a speed-up over the classical k-means algorithm; however, it has been shown to currently not provide this speed-up for decoding optical-fibre signals due to the embedding of classical data, which introduces inaccuracies and slowdowns. Although still not achieving an exponential speed-up for NISQ implementations, this work proposes the generalised inverse stereographic projection as an improved embedding into the Bloch sphere for quantum distance estimation in k-nearest-neighbour clustering, which allows us to get closer to the classical performance. We also use the generalised inverse stereographic projection to develop an analogous classical clustering algorithm and benchmark its accuracy, runtime and convergence for decoding real-world experimental optical-fibre communication data. This proposed `quantum-inspired' algorithm provides an improvement in both the accuracy and convergence rate with respect to the k-means algorithm. Hence, this work presents two main contributions. Firstly, we propose the general inverse stereographic projection into the Bloch sphere as a better embedding for quantum machine learning algorithms; here, we use the problem of clustering quadrature amplitude modulated optical-fibre signals as an example. Secondly, as a purely classical contribution inspired by the first contribution, we propose and benchmark the use of the general inverse stereographic projection and spherical centroid for clustering optical-fibre signals, showing that optimizing the radius yields a consistent improvement in accuracy and convergence rate.

The phenomenal mathematical efficiency of quantum field theories in modern high-speed information and communication systems has a very simple explanation from the point of view of common sense and higher mathematical logic: all of them – quantum cosmology, quantum physics, quantum metrics and quantum calculus – are the self-informational mathematical systems based on symbolic and numerical functional analysis and elementary recursive calculations of interrelated space and time parameters of matter motion in various states of the material environment.For the first time in scientific and engineering practice, it was clearly shown that the information entropy of both standard symbolic and non-standard numerical functional analysis has absolute exact limits of computational accuracy – 1/10^16 and 1/10^64, respectively. Moreover, the second limit determines the maximum level of accuracy of practical quantum metrics and calculations and fully coordinates four branches of classical physics – thermodynamics, electrodynamics, gravidynamics, chromodynamics with special and general relativity.

The challenge of this work is to re-define the concept of intelligent agent as a building block of social networks by presenting it as a physical particle with additional non-Newtonian properties. The proposed model of an intelligent agent described by a system of ODE coupled with their Liouville equation has been introduced and discussed. Following the Madelung equation that belongs to this class, non-Newtonian properties such as superposition, entanglement, and probability interference typical for quantum systems have been described. Special attention was paid to the capability to violate the second law of thermodynamics, which makes these systems neither Newtonian, nor quantum. It has been shown that the proposed model can be linked to mathematical models of livings as well as to models of AI. The model is presented in two modifications. The first one is illustrated by the discovery of a stochastic attractor approached by the social network; as an application, it was demonstrated that any statistics can be represented by an attractor of the solution to the corresponding system of ODE coupled with its Liouville equation. It was emphasized that evolution to the attractor reveals possible micro-mechanisms driving random events to the final distribution of the corresponding statistical law. Special attention is concentrated upon the power law and its dynamical interpretation: it is demonstrated that the underlying micro- dynamics supports a “violent reputation” of the power-law statistics. The second modification of the model of social network associated with a decision-making process and applied to solution of NP-complete problems known as being unsolvable neither by classical nor by quantum algorithms. The approach is illustrated by solving a search in unsorted database in polynomial time by resonance between external force representing the address of a required item and the response representing the location of this item.

This work - in two parts - tries to promote a new method in Mathematical Modeling, not ever used before, namely the use of the methods of Non-standard Analysis in Topoi. For the general mathematical theory of topoi (Topoi Theory) we refer to the book [10] . For non-standard analysis in the particular Boolean topos SET (the category of sets) we refer to the book [11]. This first part of the work is related, from an applicative point of view, mainly with Mathematical Neuroscience, more precisely a model of the human thinking, consciousness and subconsciousness. The connections between brain and mind will be also scketched, but a closer study also need some further topics to be studied in Part II: Artificial Intelligence, namely (Quantum) neural networks and (Quantum) Turing machine. However both parts (I. and II.) should be considered together, because they complement each other. The topoi model the intuitionistic logic (multi-valued) and have been used in Quantum Physics (see [9] and its references) while Non-Standard Analysis in SET (introduced by Abraham Robinson[31]) has been applied in Mathematical Economics (see [2] and its references); however, the combination was never used until now in Applied Mathematics. Even more, the Non-standard Analysis in Topoi is not too much studied from the point of view of Pure Mathematics either. One of the main objective of this work is to produce progress in this aria of Mathematics also, mainly for the SET-type topoi and exponential topoi, those topoi used in Quantum Physics and in which we need Non-stantard Analysis for our purposes. Based on the paper [13] we propose the logic of non-standard extensions in topoi as a model of the human thinking (based on infons), these theories representing top and very difficult results in Abstract Mathematics. We will analise the relation between brain and mind via the genetic-epigenetic interplay. More details will be provided in the Introduction, followed by a short presentation of the general theory, later connected with the (Quantum) Yang-Baxter equations in topoi. The connections between these equations and braid groups and knots, with intended applications in Neuroscience and Artificial Intelligence will be further analysed in Part II. Besides promoting a new idea of modeling, the present paper aims to promote the building of a Research Proposal for the European $''$Human Brain Project$''$ (https://www.humanbrainproject.eu/en/), and the NSF-Europe Program $''$Collaborative Research in Computational Neuroscience$''$ (https://www.nsf.gov/funding/pgm\_summ.jsp?pims\_id=5147), jointly with the new founded $''$National Centre for the Research of the Brain$''$ of the Romanian Academy of Science (https://acad.ro/centreAR/CNCC/CNCC.pdf, in Romanian). $''$Blue Brain Project$''$ (https://www.epfl.ch/research/domains/bluebrain/) could also be of big interest. We hope that the journals edited by MDPI (Axioms, in particular) and by the Simion Stoilow Institute of the Romanian Academy - Revue Roumaine de Mathematique Pures et Appliqu (http://imar.ro/journals/Revue\_Mathematique/home\_page.html) - among others - will host special issues related to the research subjects described in both parts of this work, starting with this one. For further details and some of the progress on this research subject, see www.ovidiufpasarescu.com.}

Quantum mechanics is often described as irreducibly non-local. A tacit element of this picture is the assumption that one and the same sub-ensemble of quanta is post-selected in every measurement combination of a Bell test. Yet, this expectation was recently shown to be formally inconsistent with quantum theory (Cetto et al., 2020) and even to be experimentally falsifiable (Mardari 2021). The need to make sense of this development motivated a rigorous conceptual analysis of quantum non-locality, especially as it relates to the basic principles of quantum mechanics. The simple conclusion is that quantum theory and quantum non-locality are fundamentally incompatible. This is not a loophole around the predictions of quantum mechanics, but rather an insight into the essential conditions that make them accurate.

Quantum amplitude estimation is a numerical integration technique and a candidate for the first operationally used quantum algorithm providing a quantum advantage in the NISQ era. Its main metric is the generated Fisher information per second, as it describes the accuracy of the numerical integration. The development of this metric can be coupled to the quantum volume of the used quantum processor with a phenomenological noise model. Since the increase of the quantum volume seems to follow an exponential pattern, insight in the integration power of quantum amplitude estimation for the upcoming years can be obtained. This shows that quantum amplitude estimation as a numerical integration technique will not provide an advantage for functions without significant improvements to the connectivity, reliability and speed of quantum processors. Beyond that, this method may be used the estimate the development of many more NISQ era algorithms.

A quantum hybrid (QH) intelligent approach that blends the adaptive search capability of the quantum-behaved particle swarm optimisation (QPSO) method with the intuitionistic rationality of traditional fuzzy k-nearest neighbours (Fuzzy k-NN) algorithm (known simply as the Q-Fuzzy approach) is proposed for efficient feature selection and classification of cells in cervical smeared (CS) images. From an initial multitude of seventeen (17) features describing the geometry, colour, and texture of the CS images, the QPSO stage of our proposed technique is used to select the best subset features (i.e. global best particles) that represent a pruned down collection of seven (7) features. Using a dataset of almost 1000 images, performance evaluation of our proposed Q-Fuzzy approach assesses the impact of our feature selection on classification accuracy by way of three experimental scenarios that are compared alongside two other approaches: The All-features (i.e. classification without prior feature selection) and another hybrid technique combining the standard PSO algorithm with the Fuzzy k-NN technique (P-Fuzzy approach). In the first and second scenarios, we further divided the assessment criteria in terms of classification accuracy based on the choice of best features and those in terms of the different categories of the cervical cells. In the third scenario, we introduced new QH hybrid techniques, i.e. QPSO combined with other supervised learning methods, and compared the classification accuracy alongside our proposed Q-Fuzzy approach. Furthermore, we employed statistical approaches to establish qualitative agreement with regards to the feature selection in scenarios 1 and 3. The synergy between the QPSO and Fuzzy k-NN in the proposed Q-Fuzzy approach marginally improves classification accuracy as manifest in the reduction in number cell features, which is crucial for effective cervical cancer detection and diagnosis.

In this paper, the connections between quantum non-locality and permutation symmetries are explored. This includes two types of symmetries: permutation across a superposition and permutation of qubits in a quantum system. An algorithm is proposed for nding the separability class of a quantum state using a method based on factorizing an arbitrary multipartite state into possible partitions, cyclically permuting qubits of the vectors in a superposition to check which separability class it falls into and thereafter using a reduced density-matrix analysis of the system is proposed. For the case of mixed quantum states, conditions for separability are found in terms of the partial transposition of the density matrices of the quantum system. One of these conditions turns out to be the Partial Positive Transpose (PPT) condition. A graphical method for analyzing separability is also proposed. The concept of permutation of qubits is shown to be useful in dening a new entanglement measure in the `engle'.

We develop a renormalizable model of Quantum General Relativity (QGR). We do this by building on earlier work with quantum electrodynamics (QED). Working with the Feynman path integral (FPI) approach to QED, we generalize the paths from varying in space to varying in space and time. This gives the standard results plus dispersion in time of order attoseconds or left. Over longer times, the dispersion in time averages out, but at attosecond times it should be detectable with current technology. As an unexpected but welcome side-effect, the approach caused the usual loop integrals to be finite. Since the usual UV divergences are significantly harder to renormalize in QGR than in QED, and since using paths in time plus space is definitely more in keeping with the general spirit of GR, we here apply the same approach to QGR. We show that with an appropriate choice of gauge (trace-reversed de Donder gauge) we can extend the earlier results to include QGR. Sub-attosecond measurements of individual gravitons are not within our reach, but at least the ultraviolet divergences in QGR are contained in the same way. We have therefore a renormalizable model of QGR

We derive a quantum speed limit for unitary evolution for the case of mixed quantum states using the stronger uncertainty relation for mixed quantum states. This bound can be optimized over different choices of Hermitian operators for a better bound. We illustrate this with some examples and show its better performance with respect to three existing bounds for mixed quantum states.

In this paper we will show that standard physics to a large degree consists of derivatives of a deeper reality. This means standard physics is both overly complex and also incomplete. Modern physics has typically started from working with first understanding the surface of the world, that is typically the macroscopic world, and then forming theories about the atomic and subatomic world. And we did not have much of a choice, as the subatomic world is very hard to observe directly, if not impossible to observe directly at the deepest level. Despite the enormous success of modern physics, it is therefore no big surprise that we at some point have possibly taken a step in the wrong direction. We will claim that one such step came when one thought that the de Broglie wavelength represented a real matter wavelength. We will claim that the Compton wavelength is the real matter wavelength. Based on such a view we will see that many equations in modern physics are only derivatives of much simpler relations. Second, we will claim that in today’s physics one uses two different mass definitions, one mass definition that is complete or at least more complete, embedded in gravity equations without being aware of it, as it is concealed in GM, and the standard, but incomplete, kg mass definition in non-gravitational physics. First, when this is understood, and one uses the more complete mass definition that is embedded in gravity physics, not only in gravity physics, but in all of physics, then one has a chance to unify gravity and quantum mechanics. Our new theory shows that most physical phenomena when observed over a very short timescale are probabilistic for masses smaller than a Planck mass and dominated by determinism at or above Planck mass size. Our findings have many implications. For example, we show that the Heisenberg uncertainty principle is rooted in a foundation not valid for rest-mass particles, so the Heisenberg uncertainty principle can say nothing about rest-masses. When re-formulated based on a foundation compatible with a new momentum that is also compatible with rest-masses, we obtain a re-defined Heisenberg principle that seems to become a certainty principle in the special case of a Planck mass particle. Furthermore, we show that the Planck mass particle is linked to gravity and that we can easily detect the Planck scale from gravity observations. The Planck mass particle is unique as it only lasts the Planck time, and in that very short time period it can only be observed directly from itself, and it therefore closely linked to absolute rest.

A tunable quantum cascade laser (QCL) spectrometer was used to develop methods for detecting and quantifying high explosives (HE) in soil based on multivariate analysis (MVA) and artificial intelligence (AI). For quantification, mixes of 2,4-dinitrotoluene (2,4-DNT) with concentrations from 0% to 20% w/w were investigated using three types of soils: bentonite, synthetic soil, and natural soil. A Partial least squares regression model was generated for predicting 2,4-DNT concentrations. To increase its selectivity, the model was trained and evaluated using additional analytes as interferences, including other HEs such as PETN, RDX, and TNT and non-explosives such as benzoic acid and ibuprofen. For detection, mixes of different explosives in soils were used to implement two AI strategies. In the first strategy, the spectra of the samples were compared with those of soils recorded in a database to identify the most similar soils based on QCL spectroscopy. Next, a Classical Least Squares preprocessing (Pre-CLS) was applied to soils spectra selected from the database. The parameter obtained based on the sum of the weights of Pre-CLS was then used to generate a simple binary discrimination model for distinguishing between contaminated and uncontaminated soils, achieving an accuracy of 0.877. In the second AI strategy, the same parameter was added to a principal component matrix obtained from spectral data of samples and used to generate multi-classification models based on different machine learning algorithms. A Random Forest model worked best with 0.997 accuracy and allowing to distinguish between soils contaminated with DNT, TNT, or RDX and uncontaminated soils.

PEDOT:PSS (polyethylene dioxythiophene:polystyrenesulfonate) is a commonly used hole injec-tion layer (HIL) in optoelectronic devices due to its high conductive properties and work function. However, the acidic and hygroscopic nature of PEDOT:PSS can be problematic for device stability over time. To address this issue, in this study, we have demonstrated the potential of an organic-inorganic hybrid HIL, by incorporating solution-processed WOx nanoparticles (WOx NPs) into the PEDOT:PSS mixture. This hybrid solution was found to have a superior hole transport ability and low Ohmic contact resistance, contributing to higher brightness (~62 000 cd m-2) and current efficiency (13.1 cd A-1) in the manufactured quantum-dot based light-emitting diodes (QLEDs). In addition, the resulting devices achieved a relative operational lifetime of 7,071 hours, or approxi-mately twice that of traditional QLEDs with PEDOT:PSS HILs. The proposed method is an un-complicated, reliable and low-cost way to achieve long operational lifetimes without sacrificing efficiency in optoelectronic devices.

Quantum Rayleigh scattering of single photons rules out coincident detections of the originally entangled, paired photons Correlations between independent states of qubits can easily outperform those calculated with entangled photons. The quantum joint probability for a Bell state can be factorized enabling a local detection of the alleged quantum nonlocality, if it existed.

Quantum Computation, in the gate array version, uses logical gates adopting convenient forms for computational algorithms based on those of classical computation. There, two-level quantum systems are the basic elements connecting the binary nature of classical computation with the settlement of quantum processing. Despite, their design depends on specific quantum systems and physical interactions involved, exacerbating the dynamics analysis. Predictable and controllable manipulation should be addressed to control the quantum states, but resources are restricted to limitations imposed by the physical settlement. This work presents a formalism to decompose the quantum information dynamics in SU(2^2d) for 2d-partite two-level systems into 2^2d-1 SU(2) quantum subsystems. Decomposition lets to set control procedures, to generate large entangled states and to design specialized dedicated quantum gates. There, easy and traditional operations proposed by quantum computation are recovered for more complex and large systems. Alternating the parameters of local and non-local interactions, the procedure states a universal exchange semantics on the generalized Bell states basis. It could be understood as a momentary splitting of the 2d information channels into 2^2d-1 pairs of 2 level quantum information subsystems and a settlement of the quantum information manipulation free of the imposed restrictions by the underlying physical system.

Red color conversion materials have often been used in conventional white LEDs (light-emitting diodes) to enhance the insufficient deep red component and thus improve the color rendering property. Quantum dots (QDs) are one of the candidates due to their flexibility in controlling the emission wavelength, which is attributed to the quantum confinement effect. Two types of remote QD components, i.e., QD films and QD caps, were prepared and applied to conventional white LED illumination to improve the color rendering properties. Thanks to the red component near 630 nm caused by the QD components, the color rendering indices(CRIs) of both Ra and R9 could be increased to over 95. It was found that both the diffusing nature of the reflector and the light recycling process in the vertical cavity between the bottom reflector and the top optical films play important roles in improving the color conversion efficiency of remote QD components. The present study showed that the proper application of remote QDs combined with a suitable optical cavity can control the correlated color temperature of the illumination over a wide range, thus realizing different color appearances of white LED illumination. In addition, a high CRI of over 95 could be achieved due to sufficient excitation from fewer QDs due to the strong optical cavity effect.