Related papers: Constructing a virtual two-qubit gate by sampling …
Quantum algorithms offer a dramatic speedup for computational problems in machine learning, material science, and chemistry. However, any near-term realizations of these algorithms will need to be heavily optimized to fit within the finite…
We experimentally demonstrate a programmable single-qubit quantum gate. This device applies a unitary phase shift operation to a data qubit with the value of the phase shift being fully determined by the state of a program qubit. Our linear…
Algorithms for quantum information processing are usually decomposed into sequences of quantum gate operations, most often realized with single- and two- qubit gates[1]. While such operations constitute a universal set for quantum…
Translating a general quantum circuit on a specific hardware topology with a reduced set of available gates, also known as transpilation, comes with a substantial increase in the length of the equivalent circuit. Due to decoherence, the…
The native gate set is fundamental to the performance of quantum devices, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
Practical Quantum computing hinges on the ability to control large numbers of qubits with high fidelity. Quantum dots define a promising platform due to their compatibility with semiconductor manufacturing. Moreover, high-fidelity…
The classical simulation of quantum circuits is of central importance for benchmarking near-term quantum devices. The fact that gates belonging to the Clifford group can be simulated efficiently on classical computers has motivated a range…
We experimentally demonstrate a programmable quantum gate that applies a sign flip operation to data qubit in an arbitrary basis fully specified by the quantum state of a two-qubit program register. Our linear-optical implementation is…
This thesis focuses on quantum information processing using the superconducting device, especially, on realizing quantum gates and algorithms in open quantum systems. Such a device is constructed by transmon-type superconducting qubits…
We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits. Each qubit (a two-level quantum system) is initially mapped to a vector in an eight dimensional probability space (equivalently, to a…
A quantum algorithm can be decomposed into a sequence consisting of single qubit and 2-qubit entangling gates. To optimize the decomposition and achieve more efficient construction of the quantum circuit, we can replace multiple 2-qubit…
We propose a simple simulation of nonlocal quantum correlations among $N$ qubits using a local hidden variable source with a positive probability distribution, given that each the $N$ observers has access to a local negative bit. Notably,…
A quantum algorithm is presented for the simulation of arbitrary Markovian dynamics of a qubit, described by a semigroup of single qubit quantum channels $\{T_t\}$ specified by a generator $\mathcal{L}$. This algorithm requires only…
To employ a quantum device, the performance of the quantum gates in the device needs to be evaluated first. Since the dimensionality of a quantum gate grows exponentially with the number of qubits, evaluating the performance of a quantum…
We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. In addition to tools such as the Trotter-Suzuki expansion and graph coloring, we also discuss the…
We consider procedures to realize an approximate universal NOT gate in terms of average fidelity and fidelity deviation. The average fidelity indicates the optimality of operation on average, while the fidelity deviation does the…
We study the remote implementation of a unitary transformation on a qubit. We show the existence of non-trivial protocols (i.e., using less resources than bidirectional state teleportation) which allow the perfect remote implementation of…
We discuss the realization of a universal set of ultrafast single- and two-qubit operations with superconducting quantum circuits and investigate the most relevant physical and technical limitations that arise when pushing for faster and…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…