arXiv subjects

Juha J. Vartiainen

Publications and source records attributed to Juha J. Vartiainen.

14 recordsLinked to original sources

arXiv2008

Experimental determination of the Berry phase in a superconducting charge pump

We present the first measurements of the Berry phase in a superconducting Cooper pair pump. A fixed amount of Berry phase is accumulated to the quantum-mechanical ground state in each adiabatic pumping cycle, which is determined by measuring the charge passing through the device. The dynamic and geometric phases are identified and measured quantitatively from their different response when pumping in opposite directions. Our observations, in particular, the dependencies of the dynamic and geometric effects on the superconducting phase bias across the pump, agree with the basic theoretical model of coherent Cooper pair pumping.

cond-mat.supr-con↗

arXiv2007

Suppression of the critical current of a balanced SQUID

We present an experimental study of the magnetic flux dependence of the critical current of a balanced SQUID with three Josephson junctions in parallel. Unlike for ordinary dc SQUIDs, the suppression of the critical current does not depend on the exact parameters of the Josephson junctions. The suppression is essentially limited only by the inductances of the SQUID loops. We demonstrate a critical current suppression ratio of higher than 300 in a balanced SQUID with a maximum critical current 30 nA.

cond-mat.mes-hall↗

arXiv2007

Hybrid single-electron transistor as a source of quantized electric current

The basis of synchronous manipulation of individual electrons in solid-state devices was laid by the rise of single-electronics about two decades ago. Ultra-small structures in a low temperature environment form an ideal domain of addressing electrons one by one. A long-standing challenge in this field has been the realization of a source of electric current that is accurately related to the operation frequency $f$. There is an urgent call for a quantum standard of electric current and for the so-called metrological triangle, where voltage from Josephson effect and resistance from quantum Hall effect are tested against current via Ohm's law for a consistency check of the fundamental constants of Nature, $\hbar$ and $e$. Several attempts to create a metrological current source that would comply with the demanding criteria of extreme accuracy, high yield, and implementation with not too many control parameters have been reported. However, no satisfactory solution exists as yet despite many ingenious achievements that have been witnessed over the years. Here we propose and prove the unexpected concept of a hybrid metal-superconductor turnstile in the form of a one-island single-electron transistor with one gate, which demonstrates robust current plateaus at multiple levels of $ef$ within the uncertainty of our current measurement. Our theoretical estimates show that the errors of the present system can be efficiently suppressed by further optimizations of design and proper choice of the device parameters and therefore we expect it to eventually meet the stringent specifications of quantum metrology.

cond-mat.mes-hall↗

arXiv2006

Nanoampere pumping of Cooper pairs

We have employed a tunable Cooper-pair transistor, the sluice, with radio frequency control to pump current over a resistive circuit. We find that the charge transferred per pumping cycle can be controlled with the resolution of a single Cooper-pair up to hundreds of pairs. The achieved nanoampere current features more than an order of magnitude improvement over the previously reported results and it is close to the theoretical maximum value for the measured sample.

cond-mat.supr-con↗

arXiv2006

Experimental Designs for Binary Data in Switching Measurements on Superconducting Josephson Junctions

We study the optimal design of switching measurements of small Josephson junction circuits which operate in the macroscopic quantum tunnelling regime. Starting from the D-optimality criterion we derive the optimal design for the estimation of the unknown parameters of the underlying Gumbel type distribution. As a practical method for the measurements, we propose a sequential design that combines heuristic search for initial estimates and maximum likelihood estimation. The presented design has immediate applications in the area of superconducting electronics implying faster data acquisition. The presented experimental results confirm the usefulness of the method. KEY WORDS: optimal design, D-optimality, logistic regression, complementary log-log link, quantum physics, escape measurements

cond-mat.supr-con↗

arXiv2006

Measurement scheme of the Berry phase in superconducting circuits

We present a measurement scheme for observing the Berry phase in a flux assisted Cooper pair pump - the Cooper pair sluice. In contrast to the recent experiments, in which the sluice was employed to generate accurate current through a resistance, we consider a device in a superconducting loop. This arrangement introduces a connection between the pumped current and the Berry phase accumulated during the adiabatic pumping cycles. From the adiabaticity criterion, we derive equations for the maximum pumped current and optimize the sluice accordingly. These results apply also to the high accuracy pumping which results in a potential candidate for a metrological current standard. For measuring the pumped current, an additional Josephson junction is installed into the superconducting loop. We show in detail that the switching of this system from superconducting state into normal state as a consequence of an external current pulse through it may be employed to probe the pumped current. The experimental realization of our scheme would be the first observation of the Berry phase in superconducting circuits.

cond-mat.supr-con↗

arXiv2004

Warp-Drive Quantum Computation

Recently it has been shown that time-optimal quantum computation is attained by using the Cartan decomposition of a unitary matrix. We extend this approach by noting that the unitary group is compact. This allows us to reduce the execution time of a quantum algorithm $U_{\rm alg}$ further by adding an extra gate $W$ to it. This gate $W$ sends $U_{\rm alg}$ to another algorithm $WU_{\rm alg}$ which is executable in a shorter time than $U_{\rm alg}$. We call this technique warp-drive. Here we show both theoretically and experimentally that the execution time of Grover's algorithm is reduced in two-qubit NMR quantum computer. Warp-drive is potentially a powerful tool in accelerating algorithms and reducing the errors in any realization. of a quantum computer

quant-ph↗

arXiv2004

Quantum circuits with uniformly controlled one-qubit gates

Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type using at most 2^{n-1} - 1 controlled-NOT gates, 2^{n-1} one-qubit gates and a single diagonal n-qubit gate. The circuit is based on the so-called quantum multiplexor, for which we provide a modified construction. We illustrate the versatility of these gates by applying them to the decomposition of a general n-qubit gate and a local state preparation procedure. Moreover, we study their implementation using only nearest-neighbor gates. We give upper bounds for the one-qubit and controlled-NOT gate counts for all the aforementioned applications. In all four cases, the proposed circuit topologies either improve on or achieve the previously reported upper bounds for the gate counts. Thus, they provide the most efficient method for general gate decompositions currently known.

quant-ph↗

arXiv2004

Quantum Circuits for General Multiqubit Gates

We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the so-called cosine-sine matrix decomposition is presented. The result is optimal in the number of elementary one-qubit gates, 4^n, and scales more favorably than the previously reported decompositions requiring 4^n-2^n+1 controlled NOT gates.

quant-ph↗

arXiv2004

Transformation of quantum states using uniformly controlled rotations

We consider a unitary transformation which maps any given state of an $n$-qubit quantum register into another one. This transformation has applications in the initialization of a quantum computer, and also in some quantum algorithms. Employing uniformly controlled rotations, we present a quantum circuit of $2^{n+2}-4n-4$ CNOT gates and $2^{n+2}-5$ one-qubit elementary rotations that effects the state transformation. The complexity of the circuit is noticeably lower than the previously published results. Moreover, we present an analytic expression for the rotation angles needed for the transformation.

quant-ph↗

arXiv2004

Efficient decomposition of quantum gates

Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit which is optimal in the sense of fully controlled single-qubit gates and yet is equivalent with the multiqubit gate. In the second step of the optimization, superfluous control bits are eliminated, which eventually results in a smaller total number of the elementary gates. In our scheme the number of controlled NOT gates is $O(4^n)$ which coincides with the theoretical lower bound.

quant-ph↗

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↗