Related papers: Probabilistic Process Algebra to Unifying Quantum …
Probabilistic behavior is omnipresent in computer controlled systems, in particular, so-called safety-critical hybrid systems, because of various reasons, like uncertain environments, or fundamental properties of nature. In this paper, we…
Quantum computing (QC) has gained significant attention over the past two decades due to its potential for speeding up classically demanding tasks. This transition from an academic focus to a thriving commercial sector is reflected in…
Quantum Computing (QC) offers the potential to enhance traditional High-Performance Computing (HPC) workloads by leveraging the unique properties of quantum computers, leading to the emergence of a new paradigm: HPC-QC. While this…
We consider classical and quantum algorithms which have a duality property: roughly, either the algorithm provides some nontrivial improvement over random or there exist many solutions which are significantly worse than random. This enables…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
We present a probabilistic quantum processor for qudits. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is…
The time evolution of the one-point probability vector of stochastic processes and quantum processes for $N$-level systems have been unified. Hence, quantum states and quantum operations can be regarded as generalizations of the one-point…
Natural language processing (NLP) problems are ubiquitous in classical computing, where they often require significant computational resources to infer sentence meanings. With the appearance of quantum computing hardware and simulators, it…
The increasing growth of data volume, and the consequent explosion in demand for computational power, are affecting scientific computing, as shown by the rise of extreme data scientific workflows. As the need for computing power increases,…
A probabilistic version of the Bernstein-Vazirani problem (which is a generalization of the original Bernstein-Vazirani problem) and a quantum algorithm to solve it are proposed. The problem involves finding one or more secret keys from a…
Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum…
Quantum computing promises to provide the next step up in computational power for diverse application areas. In this review, we examine the science behind the quantum hype, and the breakthroughs required to achieve true quantum advantage in…
Computational complexity theory contains a corpus of theorems and conjectures regarding the time a Turing machine will need to solve certain types of problems as a function of the input size. Nature {\em need not} be a Turing machine and,…
Classical machine learning theory and theory of quantum computations are among of the most rapidly developing scientific areas in our days. In recent years, researchers investigated if quantum computing can help to improve classical machine…
Kolmogorov's foundation of probability takes measure spaces, $\sigma$-algebras, and probability measures as basic objects. It is, however, widely recognized that this classical framework is inadequate for random phenomena involving quantum…
Quantized integrable systems can be made to perform universal quantum computation by the application of a global time-varying control. The action-angle variables of the integrable system function as qubits or qudits, which can be coupled…
Observables of quantum or classical mechanics form algebras called quantum or classical Hamilton algebras respectively (Grgin E and Petersen A (1974) {\it J Math Phys} {\bf 15} 764\cite{grginpetersen}, Sahoo D (1977) {\it Pramana} {\bf 8}…
The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum entanglement shows up qualitatively at the level of two qubits. We show that if no entanglement is envolved then…
In the Bayesian approach to probability theory, probability quantifies a degree of belief for a single trial, without any a priori connection to limiting frequencies. In this paper we show that, despite being prescribed by a fundamental…
As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can…