Ville Bergholm

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.

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{sup n-1}-1 controlled-NOT gates, 2{sup n-1} one-qubit gates, and a single diagonal n-qubit gate. To illustrate the versatility of these gates we then apply them to the decomposition of a general n-qubit gate and a 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.

Chiral quantum walks

Given its importance to many other areas of physics, from condensed matter physics to thermodynamics, time-reversal symmetry has had relatively little influence on quantum information science. Here we develop a network-based picture of time-reversal theory, classifying Hamiltonians and quantum circuits as time-symmetric or not in terms of the elements and geometries of their underlying networks. Many of the typical circuits of quantum information science are found to exhibit time-asymmetry. Moreover, we show that time-asymmetry in circuits can be controlled using local gates only, and can simulate time-asymmetry in Hamiltonian evolution. We experimentally implement a fundamental example in which controlled time-reversal asymmetry in a palindromic quantum circuit leads to near-perfect transport. Our results pave the way for using time-symmetry breaking to control coherent transport, and imply that time-asymmetry represents an omnipresent yet poorly understood effect in quantum information science.

Tensor network methods for invariant theory

Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial local unitary invariants of quantum states. This graphical approach provides an alternative to the polynomial equations that describe invariants, which often contain a large number of terms with coefficients raised to high powers. This approach also enables one to use known methods from tensor network theory (such as the matrix product state (MPS) factorization) when studying polynomial invariants. As our main example, we consider invariants of MPSs. We generate a family of tensor contractions resulting in a complete set of local unitary invariants that can be used to express the R?nyi entropies. We find that the graphical approach to representing invariants can provide structural insight into the invariants being contracted, as well as an alternative, and sometimes much simpler, means to study polynomial invariants of quantum states. In addition, many tensor network methods, such as MPSs, contain excellent tools that can be applied in the study of invariants.

Suppression of 1/fxx noise in one-qubit systems

We investigate the generation of quantum operations for one-qubit systems under classical noise with 1/f^\alpha power spectrum, where 2>\alpha > 0. We present an efficient way to approximate the noise with a discrete multi-state Markovian fluctuator. With this method, the average temporal evolution of the qubit density matrix under 1/f^\alpha noise can be feasibly determined from recently derived deterministic master equations. We obtain qubit operations such as quantum memory and the NOT}gate to high fidelity by a gradient based optimization algorithm. For the NOT gate, the computed fidelities are qualitatively similar to those obtained earlier for random telegraph noise. In the case of quantum memory however, we observe a nonmonotonic dependency of the fidelity on the operation time, yielding a natural access rate of the memory.

Equivalent qubit dynamics under classical and quantum noise

We study the dynamics of quantum systems under classical and quantum noise, focusing on decoherence in qubit systems. Classical noise is described by a random process leading to a stochastic temporal evolution of a closed quantum system, whereas quantum noise originates from the coupling of the microscopic quantum system to its macroscopic environment. We derive deterministic master equations describing the average evolution of the quantum system under classical continuous-time Markovian noise and two sets of master equations under quantum noise. Strikingly, these three equations of motion are shown to be equivalent in the case of classical random telegraph noise and proper quantum environments. Hence fully quantum-mechanical models within the Born approximation can be mapped to a quantum system under classical noise. Furthermore, we apply the derived equations together with pulse optimization techniques to achieve high-fidelity one-qubit operations under random telegraph noise, and hence fight decoherence in these systems of great practical interest.