相关论文: Rapid solution of problems by nuclear-magnetic-res…
We consider a family of unstructured problems, for which we propose a method for constructing analog, continuous-time quantum algorithms that are more efficient than their classical counterparts. In this family of problems, which we refer…
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough.…
The simulation of the spectra measured in nuclear magnetic resonance (NMR) spectroscopy experiments is a computationally non-trivial problem which, due to its natural interpretation as a quantum spin problem, maps in a straightforward way…
We study a simple-harmonic-oscillator quantum computer solving oracle decision problems. We show that such computers can perform better by using nonorthogonal Gaussian wave functions rather than orthogonal top-hat wave functions as input to…
We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefl y describe the standard models of quantum…
We discuss the ensemble version of the Deutsch-Jozsa (DJ) algorithm which attempts to provide a "scalable" implementation on an expectation-value NMR quantum computer. We show that this ensemble implementation of the DJ algorithm is at best…
That superpositions of states can be useful for performing tasks in quantum systems has been known since the early days of quantum information, but only recently has quantitative theory of quantum coherence been proposed. Here we apply that…
Nuclear Magnetic Ressonance (NMR) is a widely used technique, with a long history of applications in chemestry, medicine, and material science. Twenty years ago, it emerged as a reliable source for quantum computing too, since the work of…
We report an ensemble nuclear magnetic resonance (NMR) implementation of a quantum lattice gas algorithm for the diffusion equation. The algorithm employs an array of quantum information processors sharing classical information, a novel…
The quantum search problem is an important problem due to the fact that a general NP problem can be solved efficiently by an unsorted quantum search algorithm. Here it has been shown that the quantum search problem could be solved in…
Quantum computation is a subject of much theoretical promise, but has not been realized in large scale, despite the discovery of fault-tolerant procedures to overcome decoherence. Part of the reason is that the theoretically modest…
Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates…
Quantum correlations have been pointed out as the most likely source of the speed-up in quantum computation. Here we analyzed the presence of quantum correlations in the implementation of Deutsch-Jozsa algorithm running in the DQC1 and DQCp…
As of today, no one can tell when a universal quantum computer with thousands of logical quantum bits (qubits) will be built. At present, most quantum computer prototypes involve less than ten individually controllable qubits, and only…
We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining…
In this article, we present an introduction to quantum computing (QC) tailored for computing professionals such as programmers, machine learning engineers, and data scientists. Our approach abstracts away the physics underlying QC, which…
We propose a scalable method on the basis of nth-order coupling operators to construct f-dependent phase transformations in the n-qubit modified Deutsch-Jozsa (D-J) quantum algorithm. The novel n-qubit entangling transformations are easily…
In these notes we present preliminary results on quantum-like algorithms where tensor product is replaced by geometric product. Such algorithms possess the essential properties typical of quantum computation (entanglement, parallelism) but…
A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. The refined version allows a simpler analysis of…
We propose and analyze a method for improving quantum chemical energy calculations on a quantum computer impaired by decoherence and shot noise. The error mitigation approach relies on the fact that the one- and two-particle reduced density…