Alireza Shabani

Digitized adiabatic quantum computing with a superconducting circuit

Quantum mechanics can help to solve complex problems in physics and chemistry, provided they can be programmed in a physical device. In adiabatic quantum computing, a system is slowly evolved from the ground state of a simple initial Hamiltonian to a final Hamiltonian that encodes a computational problem. The appeal of this approach lies in the combination of simplicity and generality; in principle, any problem can be encoded. In practice, applications are restricted by limited connectivity, available interactions and noise. A complementary approach is digital quantum computing, which enables the construction of arbitrary interactions and is compatible with error correction, but uses quantum circuit algorithms that are problem-specific. Here we combine the advantages of both approaches by implementing digitized adiabatic quantum computing in a superconducting system. We tomographically probe the system during the digitized evolution and explore the scaling of errors with system size. We then let the full system find the solution to random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions. This digital quantum simulation of the adiabatic algorithm consists of up to nine qubits and up to 1,000 quantum logic gates. The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems. When combined with fault-tolerance, our approach becomes a general-purpose algorithm that is scalable.

Efficient measurement of quantum dynamics via compressive sensing

The resources required to characterize the dynamics of engineered quantum systems--such as quantum computers and quantum sensors--grow exponentially with system size. Here we adapt techniques from compressive sensing to exponentially reduce the experimental configurations required for quantum process tomography. Our method is applicable to processes that are nearly sparse in a certain basis and can be implemented using only single-body preparations and measurements. We perform efficient, high-fidelity estimation of process matrices of a photonic two-qubit logic gate. The database is obtained under various decoherence strengths. Our technique is both accurate and noise robust, thus removing a key roadblock to the development and scaling of quantum technologies.

Computational multiqubit tunnelling in programmable quantum annealers

Quantum tunneling, a phenomenon in which a quantum state traverses energy barriers above the energy of the state itself, has been hypothesized as an advantageous physical resource for optimization. Here we show that multiqubit tunneling plays a computational role in a currently available, albeit noisy, programmable quantum annealer. We develop a non-perturbative theory of open quantum dynamics under realistic noise characteristics predicting the rate of many-body dissipative quantum tunneling. We devise a computational primitive with 16 qubits where quantum evolutions enable tunneling to the global minimum while the corresponding classical paths are trapped in a false minimum. Furthermore, we experimentally demonstrate that quantum tunneling can outperform thermal hopping along classical paths for problems with up to 200 qubits containing the computational primitive. Our results indicate that many-body quantum phenomena could be used for finding better solutions to hard optimization problems.Quantum tunnelling is a phenomenon in which a quantum state traverses energy barriers higher than the energy of the state itself. Quantum tunnelling has been hypothesized as an advantageous physical resource for optimization in quantum annealing. However, computational multiqubit tunnelling has not yet been observed, and a theory of co-tunnelling under high- and low-frequency noises is lacking. Here we show that 8-qubit tunnelling plays a computational role in a currently available programmable quantum annealer. We devise a probe for tunnelling, a computational primitive where classical paths are trapped in a false minimum. In support of the design of quantum annealers we develop a nonperturbative theory of open quantum dynamics under realistic noise characteristics. This theory accurately predicts the rate of many-body dissipative quantum tunnelling subject to the polaron effect. Furthermore, we experimentally demonstrate that quantum tunnelling outperforms thermal hopping along classical paths for problems with up to 200 qubits containing the computational primitive.

Theory of initialization-free decoherence-free subspaces and subsystems

We introduce a generalized theory of decoherence-free subspaces and subsystems (DFSs), which do not require accurate initialization. We derive a set of conditions for the existence of DFSs within this generalized framework. By relaxing the initialization requirement we show that a DFS can tolerate arbitrarily large preparation errors. This has potentially significant implications for experiments involving DFSs, in particular for the experimental implementation, over DFSs, of the large class of quantum algorithms which can function with arbitrary input states.

Completely positive post-Markovian master equation via a measurement approach

A post-Markovian quantum master equation is derived, which includes bath memory effects via a phenomenologically introduced memory kernel kstd. The derivation uses as a formal tool a probabilistic single-shot bath-measurement process performed during the coupled system-bath evolution. The resulting analytically solvable master equation interpolates between the exact Nakajima-Zwanzig equation and the Markovian Lindblad equation. A necessary and sufficient condition for complete positivity in terms of properties of kstd is presented, in addition to a prescription for the experimental determination of kstd. The formalism is illustrated with examples.

Efficient estimation of energy transfer efficiency in light-harvesting complexes

The fundamental physical mechanisms of energy transfer in photosynthetic complexes is not yet fully understood. In particular, the degree of efficiency or sensitivity of these systems for energy transfer is not known given their realistic with surrounding photonic and phononic environments. One major problem in studying light-harvesting complexes has been the lack of an efficient method for simulation of their dynamics in biological environments. To this end, here we revisit the second order time-convolution (TC2) master equation and examine its reliability beyond extreme Markovian and perturbative limits. In particular, we present a derivation of TC2 without making the usual weak system-bath coupling assumption. Using this equation, we explore the long-time behavior of exciton dynamics of Fenna-Matthews-Olson (FMO) portein complex. Moreover, we introduce a constructive error analysis to estimate the accuracy of TC2 equation in calculating energy transfer efficiency, exhibiting reliable performance for system-bath interactions with weak and intermediate memory and strength. Furthermore, we numerically show that energy transfer efficiency is optimal and robust for the FMO protein complex of green sulfur bacteria with respect to variations in reorganization energy and bath correlation time scales.

Energy-scales convergence for optimal and robust quantum transport in photosynthetic complexes

Underlying physical principles for the high efficiency of excitation energy transfer in light-harvesting complexes are not fully understood. Notably, the degree of robustness of these systems for transporting energy is not known considering their realistic interactions with vibrational and radiative environments within the surrounding solvent and scaffold proteins. In this work, we employ an efficient technique to estimate energy transfer efficiency of such complex excitonic systems. We observe that the dynamics of the Fenna-Matthews-Olson (FMO) complex leads to optimal and robust energy transport due to a convergence of energy scales among all important internal and external parameters. In particular, we show that the FMO energy transfer efficiency is optimum and stable with respect to important parameters of environmental interactions including reorganization energy λ, bath frequency cutoff γ, temperature T, and bath spatial correlations. We identify the ratio of kBλT/ℏγ⁢g as a single key parameter governing quantum transport efficiency, where g is the average excitonic energy gap.

Robust Quantum Error Correction via Convex Optimization

We present a semidefinite program optimization approach to quantum error correction that yields codes and recovery procedures that are robust against significant variations in the noise channel. Our approach allows us to optimize the encoding, recovery, or both, and is amenable to approximations that significantly improve computational cost while retaining fidelity. We illustrate our theory numerically for optimized 5-qubit codes, using the standard [5,1,3] code as a benchmark. Our optimized encoding and recovery yields fidelities that are uniformly higher by 1-2 orders of magnitude against random unitary weight-2 errors compared to the [5,1,3] code with standard recovery.

Estimation of many-body quantum Hamiltonians via compressive sensing

We develop an efficient and robust approach to Hamiltonian id e t fication for multipartite quantum systems based on the method of compressed sensing. This work demonst rates that with onlyO(s log(d)) experimental configurations, consisting of random local preparations an d measurements, one can estimate the Hamiltonian of ad-dimensional system, provided that the Hamiltonian is near ly s-sparse in a known basis. We numerically simulate the performance of this algorithm for threeand fo ur-body interactions in spin-coupled quantum dots and atoms in optical lattices. Furthermore, we apply the alg orithm to characterize Hamiltonian fine structure and unknown system-bath interactions.

Maps for general open quantum systems and a theory of linear quantum error correction

We show that quantum subdynamics of an open quantum system can always be described by a linear, Hermitian map irrespective of the form of the initial total system state. Since the theory of quantum error correction was developed based on the assumption of completely positive (CP) maps, we present a generalized theory of linear quantum error correction, which applies to any linear map describing the open system evolution. In the physically relevant setting of Hermitian maps, we show that the CP-map-based version of quantum error correction theory applies without modifications. However, we show that a more general scenario is also possible, where the recovery map is Hermitian but not CP. Since non-CP maps have nonpositive matrices in their range, we provide a geometric characterization of the positivity domain of general linear maps. In particular, we show that this domain is convex and that this implies a simple algorithm for finding its boundary.