arXiv subjects

Antti O. Niskanen

Publications and source records attributed to Antti O. Niskanen.

6 recordsLinked to original sources

arXiv2006

Tunable coupling scheme for flux qubits at the optimal point

We discuss a practical design for tunably coupling a pair of flux qubits via the quantum inductance of a third high-frequency qubit. The design is particularly well suited for realizing a recently proposed microwave-induced parametric coupling scheme. This is attractive because the qubits can always remain at their optimal points. Furthermore, we will show that the resulting coupling also has an optimal point where it is insensitive to low-frequency flux noise. This is an important feature for the coherence of coupled qubits. The presented scheme is an experimentally realistic way of carrying out two-qubit gates and should be easily extended to multiqubit systems.

cond-mat.mes-hall↗

arXiv2004

Evidence of Cooper pair pumping with combined flux and voltage control

We have experimentally demonstrated pumping of Cooper pairs in a single-island mesoscopic structure. The island was connected to leads through SQUID (Superconducting Quantum Interference Device) loops. Synchronized flux and voltage signals were applied whereby the Josephson energies of the SQUIDs and the gate charge were tuned adiabatically. From the current-voltage characteristics one can see that the pumped current increases in 1e steps which is due to quasiparticle poisoning on the measurement time scale, but we argue that the transport of charge is due to Cooper pairs.

cond-mat.mes-hall↗

arXiv2004

Acceleration of quantum algorithms using three-qubit gates

Quantum-circuit optimization is essential for any practical realization of quantum computation, in order to beat decoherence. We present a scheme for implementing the final stage in the compilation of quantum circuits, i.e., for finding the actual physical realizations of the individual modules in the quantum-gate library. We find that numerical optimization can be efficiently utilized in order to generate the appropriate control-parameter sequences which produce the desired three-qubit modules within the Josephson charge-qubit model. Our work suggests ways in which one can in fact considerably reduce the number of gates required to implement a given quantum circuit, hence diminishing idle time and significantly accelerating the execution of quantum algorithms.

quant-ph↗

arXiv2004

Implementing Shor's algorithm on Josephson Charge Qubits

We investigate the physical implementation of Shor's factorization algorithm on a Josephson charge qubit register. While we pursue a universal method to factor a composite integer of any size, the scheme is demonstrated for the number 21. We consider both the physical and algorithmic requirements for an optimal implementation when only a small number of qubits is available. These aspects of quantum computation are usually the topics of separate research communities; we present a unifying discussion of both of these fundamental features bridging Shor's algorithm to its physical realization using Josephson junction qubits. In order to meet the stringent requirements set by a short decoherence time, we accelerate the algorithm by decomposing the quantum circuit into tailored two- and three-qubit gates and we find their physical realizations through numerical optimization.

quant-ph↗

arXiv2003

Optimal multiqubit operations for Josephson charge qubits

We introduce a method for finding the required control parameters for a quantum computer that yields the desired quantum algorithm without invoking elementary gates. We concentrate on the Josephson charge-qubit model, but the scenario is readily extended to other physical realizations. Our strategy is to numerically find any desired double- or triple-qubit gate. The motivation is the need to significantly accelerate quantum algorithms in order to fight decoherence.

quant-ph↗

arXiv2002

Realization of Arbitrary Gates in Holonomic Quantum Computation

Among the many proposals for the realization of a quantum computer, holonomic quantum computation (HQC) is distinguished from the rest in that it is geometrical in nature and thus expected to be robust against decoherence. Here we analyze the realization of various quantum gates by solving the inverse problem: Given a unitary matrix, we develop a formalism by which we find loops in the parameter space generating this matrix as a holonomy. We demonstrate for the first time that such a one-qubit gate as the Hadamard gate and such two-qubit gates as the CNOT gate, the SWAP gate and the discrete Fourier transformation can be obtained with a single loop.

quant-ph↗