Related papers: Orchestrating an NMR quantum computation: the N=3 …
A gate sequence of single-qubit transformations may be condensed into a single microwave pulse that maps a qubit from an initialized state directly into the desired state of the composite transformation. Here, machine learning is used to…
We present experimental measurements on a model quantum system that demonstrate our ability to dramatically suppress qubit error rates by the application of optimized dynamical decoupling pulse sequences in a variety of experimentally…
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to…
We present a computational method to automatically design the n-qubit realisations of quantum algorithms. Our approach leverages a domain-specific language (DSL) that enables the construction of quantum circuits via modular building blocks,…
In liquid-state NMR quantum computation, a selective entanglement operator between qubits 2 and 3 of a three-qubit molecule is conventionally realized by applying a pair of short $\pi$-pulses to qubit 1. This method, called refocusing, is…
Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with a single quantum query, and thus achieved the best separation between classical deterministic and exact quantum query complexity. Until recent years,…
This paper surveys our recent research on quantum information processing by nuclear magnetic resonance (NMR) spectroscopy. We begin with a geometric introduction to the NMR of an ensemble of indistinguishable spins, and then show how this…
Aimed at the simulation, design, and interpretation of advanced pulse experiments crossing the boundaries between nuclear magnetic resonance (NMR) and electron paramagnetic resonance (EPR), including the rapidly emerging, hybrid discipline…
Nuclear magnetic resonance (NMR) has been widely used in the context of quantum information processing (QIP). However, despite the great similarities between NMR and nuclear quadrupole resonance (NQR), no experimental implementation for QIP…
Refocusing of a quantum system in NMR and quantum information processing can be achieved by application of short pulses according to the methods of spin echo and dynamical decoupling. However, these methods are strongly limited by the…
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…
Quantum process tomography is a procedure by which the unknown dynamical evolution of an open quantum system can be fully experimentally characterized. We demonstrate explicitly how this procedure can be implemented with a nuclear magnetic…
Nuclear magnetic resonance (NMR) provides an experimental setting to explore physical implementations of quantum information processing (QIP). Here we introduce the basic background for understanding applications of NMR to QIP and explain…
In pulsed dynamic nuclear polarization (DNP), enhancement of the polarization of bulk nuclei requires the repeated application of a microwave pulse sequence. So far, analysis of a one-time transfer of electron spin polarization to a…
We develop a new class of genetic algorithm that computationally determines efficient pulse sequences to implement a quantum gate U in a three-qubit system. The method is shown to be quite general, and the same algorithm can be used to…
In the present paper methods and algorithms of modeling quantum operations for quantum computer integrated circuits design are developed. We examine different ways of quantum operation descriptions, including operator-sums, unitary…
The development of efficient algorithms that generate robust quantum controls is crucial for the realization of quantum technologies. The commonly used gradient-based optimization algorithms are limited by their sensitivity to the initial…
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…
Simulating nonlinear classical dynamics on a quantum computer is an inherently challenging task due to the linear operator formulation of quantum mechanics. In this work, we provide a systematic approach to alleviate this difficulty by…
A hybrid model of the Deutsch-Jozsa algorithm is presented, inspired by the proposals of hybrid computation by S. Lloyd and P. van Loock et. al. The model is based on two observations made about both the discrete and continuous algorithms…