Related papers: Implementing a Quantum Algorithm with Exchange-Cou…
Quantum computing was so far mainly concerned with discrete problems. Recently, E. Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, which advantages quantum computing can bring…
We have designed efficient quantum circuits for the three-qubit Toffoli (controlled-controlled NOT) and the Fredkin (controlled-SWAP) gate, optimized via genetic programming methods. The gates thus obtained were experimentally implemented…
We consider the problem of estimating the expected outcomes of Monte Carlo processes whose outputs are described by multidimensional random variables. We tightly characterize the quantum query complexity of this problem for various choices…
A scheme to execute an n-bit Deutsch-Jozsa (D-J) algorithm using n qubits has been implemented for up to three qubits on an NMR quantum computer. For the one and two bit Deutsch problem, the qubits do not get entangled, hence the NMR…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
We study how entanglement among the register qubits affects the gate fidelity in the one-way quantum computation if a measurement is inaccurate. We derive an inequality which shows that the mean gate fidelity is upper bounded by a…
Two-qubit interactions are at the heart of quantum information processing. For single-spin qubits in semiconductor quantum dots, the exchange gate has always been considered the natural two-qubit gate. The recent integration of magnetic…
Quantum computing has the potential to solve many complex algorithms in the domains of optimization, arithmetics, structural search, financial risk analysis, machine learning, image processing, and others. Quantum circuits built to…
We propose a novel physical realization of a quantum computer. The qubits are electric dipole moments of ultracold diatomic molecules, oriented along or against an external electric field. Individual molecules are held in a 1-D trap array,…
The prevalent approach to executing quantum algorithms on quantum computers is to break-down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate…
Quantum bits have technological imperfections. Additionally, the capacity of a component that can be implemented feasibly is limited. Therefore, distributed quantum computation is required to scale up quantum computers. This dissertation…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
We have calculated the exchange, correlation, and total electronic energy of a realistic InAs self-assembled quantum dot embedded in a GaAs matrix as a function of the number of electrons in the dot. The many-body interactions have been…
Current technological advancements of quantum computers highlight the need for application-driven, practical and well-defined methods of benchmarking their performance. As the existing NISQ device's quality of two-qubit gate errors rate is…
Coherent errors in quantum operations are ubiquitous. Whether arising from spurious environmental couplings or errors in control fields, such errors can accumulate rapidly and degrade the performance of a quantum circuit significantly more…
The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling quantum gates offers clear…
We investigate the feasibility of using electrons in a linear Paul trap as qubits in a future quantum computer. We discuss the necessary experimental steps to realize such a device through a concrete design proposal, including trapping,…
We consider quantum computer architectures where interactions are mediated between hot qubits that are not in their mechanical ground state. Such situations occur, e.g., when not cooling ideally, or when moving ions or atoms around. We…
Exact simulations of quantum circuits (QCs) are currently limited to $\sim$50 qubits because the memory and computational cost required to store the QC wave function scale exponentially with qubit number. Therefore, developing efficient…