Related papers: Experimental Implementation of the Deutsch-Jozsa A…
We present a study of the prospects for coherence preservation in solid-state spin qubits using dynamical decoupling protocols. Recent experiments have provided the first demonstrations of multipulse dynamical decoupling sequences in this…
We introduce a quantum decomposition algorithm (QDA) that decomposes the problem $\frac{\partial \rho}{\partial t}=\mathcal{L}\rho=\lambda \rho$ into a summation of eigenvalues times phase-space variables. One interesting feature of QDA…
This thesis presents an efficient quantum algorithm and explicit circuits for generating eigenstates of arbitrary SU(2) and SU(3) representations. These include a wide variety of highly entangled states. The algorithm uses Schur transform…
Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the…
We present an effective measurement scheme for the solid-state qubits that does {\bf not} introduce extra decoherence to the qubits until the measurement is switched on by a resonant pulse. The resonant pulse then maximally entangles the…
We use a single squeezed state to represent a qubit, which can be coherently processed in a deconvolution picture (DP) in the presence of noise. We avail ourselves of the fact that when evolution is governed by a quadratic dissipative…
In this paper, we propose efficient probabilistic algorithms for several problems regarding the autocorrelation spectrum. First, we present a quantum algorithm that samples from the Walsh spectrum of any derivative of $f()$. Informally, the…
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…
The implementation of circuit quantum electrodynamics allows coupling distant qubits by microwave photons hosted in on-chip superconducting resonators. Typically, the qubit-photon interaction is realized by coupling the photons to the…
Static electric response properties of atoms and molecules are reported within the real-space Cartesian grid implementation of pseudopotential Kohn-Sham (KS) density functional theory (DFT). A detailed systematic investigation is made for a…
The optimal estimation of a quantum mechanical 2-state system (qubit) - with N identically prepared qubits available - is obtained by measuring all qubits simultaneously in an entangled basis. We report the experimental estimation of qubits…
Josephson Junctions are important components in superconducting qubits. It introduces anharmonicity to the energy level spacings of the qubit which allow us to identify two unique quantum energy states for computing. It is difficult to…
We present a quantum algorithm to prepare the thermal Gibbs state of interacting quantum systems. This algorithm sets a universal upper bound D^alpha on the thermalization time of a quantum system, where D is the system's Hilbert space…
We analyzed the Josephson bifurcation amplifier (JBA) readout process of a superconducting qubit quantum mechanically. This was achieved by employing numerical analyses of the dynamics of the density operator of a driven nonlinear…
For a Bose Josephson junction realized with a double-well potential we propose a strategy to observe the coherent superpositions of phase states occurring during the time evolution after a sudden rise of the barrier separating the two…
The problem of noise incidence on qubits taking part of bipartite entanglement-based protocols is addressed. It is shown that the use of a three-partite GHZ state and measurements instead of their EPR counterparts allows the experimenter to…
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both…
While all quantum algorithms can be expressed in terms of single-qubit and two-qubit gates, more expressive gate sets can help reduce the algorithmic depth. This is important in the presence of gate errors, especially those due to…
In the era of quantum computing, the emergence of quantum computers and subsequent advancements have led to the development of various quantum algorithms capable of solving linear equations and eigenvalues, surpassing the pace of classical…
Quantum algorithms for diverse problems, including search and optimization problems, require the implementation of a reflection operator over a target state. Commonly, such reflections are approximately implemented using phase estimation.…