Related papers: Implementation of the refined Deutsch-Jozsa algori…
We describe a quantum computer based upon the coherent manipulation of two-level atoms between discrete one-dimensional momentum states. Combinations of short laser pulses with kinetic energy dependent free phase evolution can perform the…
Classical simulations of noisy quantum circuits are instrumental to our understanding of the behavior of real-world quantum systems and the identification of regimes where one expects quantum advantage. In this work, we present a highly…
Using the Deutsch-Jozsa algorithm, we will develop a method for solving a class of problems in which we need to determine parts of an array and then apply a specified function to each independent part. Since present quantum computers are…
In this work, we present an implementation of quantum logic gates and algorithms in a three effective qubits system, represented by a (I = 7/2) NMR quadrupolar nuclei. To implement these protocols we have used the strong modulating pulses…
The goal of this paper is to study the effect of entanglement on the running time of a quantum computation. Adiabatic quantum computation is suited to this kind of study, since it allows us to explicitly calculate the time evolution of the…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
We show how to control and perform universal three-qubit quantum computation with trapped electron quantum states. The three qubits are the electron spin, and the first two quantum states of the cyclotron and axial harmonic oscillators. We…
We demonstrate the use of an NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch's problem.
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the…
In this paper, we study efficient algorithms towards the construction of any arbitrary Dicke state. Our contribution is to use proper symmetric Boolean functions that involve manipulations with Krawtchouk polynomials. Deutsch-Jozsa…
With qubit measurement and control fidelities above the threshold of fault-tolerance, much attention is moving towards the daunting task of scaling up the number of physical qubits to the large numbers needed for fault tolerant quantum…
ROM-based quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less ``magical'', and being more suited to implementing space-efficient computation (i.e. computation using the minimum number of…
The n-qubit real equally weighted states are employed in some quantum algorithms including Deutsch-Jozsa, Grover, Simon, and so on. We qualitatively investigate the entanglement properties of n-qubit real equally weighted states. Firstly,…
In this paper, we study different cryptographically significant spectra of Boolean functions, including the Walsh-Hadamard, cross-correlation, and autocorrelation. The $2^k$-variation by Stanica [IEEE-IT 2016] is considered here with the…
One-way quantum computing is a promising candidate for fault-tolerant quantum computing. Here, we propose new protocols to realize a deterministic one-way CNOT gate and one-way $X$-rotations on quantum-computing platforms. By applying a…
In the ideal quantum Zeno effect, repeated quantum projective measurements can freeze the coherent dynamics of a quantum system. However, in the weak quantum Zeno regime, measurement back-actions can allow the sensing of semi-classical…
We demonstrate a five-bit nuclear-magnetic-resonance quantum computer that distinguishes among various functions on four bits, making use of quantum parallelism. Its construction draws on the recognition of the sufficiency of linear…
We experimentally implement the Sz.-Nagy dilation algorithm to simulate open quantum dynamics on an nuclear magnetic resonance (NMR) quantum processor. The Sz.-Nagy algorithm enables the simulation of the dynamics of arbitrary-dimensional…
We present a computational framework based on geometric structures. No quantum mechanics is involved, and yet the algorithms perform tasks analogous to quantum computation. Tensor products and entangled states are not needed -- they are…
Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to…