Searcharxiv⌕ Search

arXiv subjects

Matthias Troyer

Publications and source records attributed to Matthias Troyer.

At least 55 records · Page 3Linked to original sources

Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions

In this work we investigate methods to improve the efficiency and scalability of quantum algorithms for quantum chemistry applications. We propose a transformation of the electronic structure Hamiltonian in the second quantization framework into the particle-hole (p/h) picture, which offers a better starting point for the expansion of the trial wavefunction. The state of the molecular system at study is parametrized in a way to efficiently explore the sector of the molecular Fock space that contains the desired solution. To this end, we explore several trial wavefunctions to identify the most efficient parameterization of the molecular ground state. Taking advantage of known post-Hartree Fock quantum chemistry approaches and heuristic Hilbert space search quantum algorithms, we propose a new family of quantum circuits based on exchange-type gates that enable accurate calculations while keeping the gate count (i.e., the circuit depth) low. The particle-hole implementation of the Unitary Coupled Cluster (UCC) method within the Variational Quantum Eigensolver approach gives rise to an efficient quantum algorithm, named q-UCC , with important advantages compared to the straightforward 'translation' of the classical Coupled Cluster counterpart. In particular, we show how a single Trotter step can accurately and efficiently reproduce the ground state energies of simple molecular systems.

quant-ph↗

Q#: Enabling scalable quantum computing and development with a high-level domain-specific language

Quantum computing exploits quantum phenomena such as superposition and entanglement to realize a form of parallelism that is not available to traditional computing. It offers the potential of significant computational speed-ups in quantum chemistry, materials science, cryptography, and machine learning. The dominant approach to programming quantum computers is to provide an existing high-level language with libraries that allow for the expression of quantum programs. This approach can permit computations that are meaningless in a quantum context; prohibits succinct expression of interaction between classical and quantum logic; and does not provide important constructs that are required for quantum programming. We present Q#, a quantum-focused domain-specific language explicitly designed to correctly, clearly and completely express quantum algorithms. Q# provides a type system, a tightly constrained environment to safely interleave classical and quantum computations; specialized syntax, symbolic code manipulation to automatically generate correct transformations of quantum operations, and powerful functional constructs which aid composition.

quant-ph↗

ProjectQ: An Open Source Software Framework for Quantum Computing

We introduce ProjectQ, an open source software effort for quantum computing. The first release features a compiler framework capable of targeting various types of hardware, a high-performance simulator with emulation capabilities, and compiler plug-ins for circuit drawing and resource estimation. We introduce our Python-embedded domain-specific language, present the features, and provide example implementations for quantum algorithms. The framework allows testing of quantum algorithms through simulation and enables running them on actual quantum hardware using a back-end connecting to the IBM Quantum Experience cloud service. Through extension mechanisms, users can provide back-ends to further quantum hardware, and scientists working on quantum compilation can provide plug-ins for additional compilation, optimization, gate synthesis, and layout strategies.

quant-ph↗

Many-body quantum state tomography with neural networks

The experimental realization of increasingly complex synthetic quantum systems calls for the development of general theoretical methods, to validate and fully exploit quantum resources. Quantum-state tomography (QST) aims at reconstructing the full quantum state from simple measurements, and therefore provides a key tool to obtain reliable analytics. Brute-force approaches to QST, however, demand resources growing exponentially with the number of constituents, making it unfeasible except for small systems. Here we show that machine learning techniques can be efficiently used for QST of highly-entangled states, in both one and two dimensions. Remarkably, the resulting approach allows one to reconstruct traditionally challenging many-body quantities - such as the entanglement entropy - from simple, experimentally accessible measurements. This approach can benefit existing and future generations of devices ranging from quantum computers to ultra-cold atom quantum simulators.

cond-mat.dis-nn↗

Entanglement spectroscopy on a quantum computer

We present a quantum algorithm to compute the entanglement spectrum of arbitrary quantum states. The interesting universal part of the entanglement spectrum is typically contained in the largest eigenvalues of the density matrix which can be obtained from the lower Renyi entropies through the Newton-Girard method. Obtaining the $p$ largest eigenvalues ($λ_1>λ_2\ldots>λ_p$) requires a parallel circuit depth of $\mathcal{O}(p(λ_1/λ_p)^p)$ and $\mathcal{O}(p\log(N))$ qubits where up to $p$ copies of the quantum state defined on a Hilbert space of size $N$ are needed as the input. We validate this procedure for the entanglement spectrum of the topologically-ordered Laughlin wave function corresponding to the quantum Hall state at filling factor $ν=1/3$. Our scaling analysis exposes the tradeoffs between time and number of qubits for obtaining the entanglement spectrum in the thermodynamic limit using finite-size digital quantum computers. We also illustrate the utility of the second Renyi entropy in predicting a topological phase transition and in extracting the localization length in a many-body localized system.

cond-mat.str-el↗

WannierTools: An open-source software package for novel topological materials

We present an open-source software package WannierTools, a tool for investigation of novel topological materials. This code works in the tight-binding framework, which can be generated by another software package Wannier90. It can help to classify the topological phase of given materials by calculating the Wilson loop and can get the surface state spectrum which is detected by angle-resolved photoemission (ARPES) and in scanning tunneling microscopy (STM) experiments. It also identifies positions of Weyl/Dirac points and nodal line structures, calculates the Berry phase around a closed momentum loop and Berry curvature in a part of the Brillouin zone.

physics.comp-ph↗

Fermionic Hamiltonians for quantum simulations: a general reduction scheme

Many-body fermionic quantum calculations performed on analog quantum computers are restricted by the presence of k-local terms, which represent interactions among more than two qubits. These originate from the fermion-to-qubit mapping applied to the electronic Hamiltonians. Current solutions to this problem rely on perturbation theory in an enlarged Hilbert space. The main challenge associated with this technique is that it relies on coupling constants with very different magnitudes. This prevents its implementation in currently available architectures. In order to resolve this issue, we present an optimization scheme that unfolds the k-local terms into a linear combination of 2-local terms, while ensuring the conservation of all relevant physical properties of the original Hamiltonian, with several orders of magnitude smaller variation of the coupling constants.

quant-ph↗

Orbital contributions to the electron g-factor in semiconductor nanowires

Recent experiments on Majorana fermions in semiconductor nanowires [Albrecht et al., Nat. 531, 206 (2016)] revealed a surprisingly large electronic Landé g-factor, several times larger than the bulk value - contrary to the expectation that confinement reduces the g-factor. Here we assess the role of orbital contributions to the electron g-factor in nanowires and quantum dots. We show that an LS coupling in higher subbands leads to an enhancement of the g-factor of an order of magnitude or more for small effective mass semiconductors. We validate our theoretical finding with simulations of InAs and InSb, showing that the effect persists even if cylindrical symmetry is broken. A huge anisotropy of the enhanced g-factors under magnetic field rotation allows for a straightforward experimental test of this theory.

cond-mat.mes-hall↗

Infinite Matrix Product States vs Infinite Projected Entangled-Pair States on the Cylinder: a comparative study

In spite of their intrinsic one-dimensional nature matrix product states have been systematically used to obtain remarkably accurate results for two-dimensional systems. Motivated by basic entropic arguments favoring projected entangled-pair states as the method of choice, we assess the relative performance of infinite matrix product states and infinite projected entangled-pair states on cylindrical geometries. By considering the Heisenberg and half-filled Hubbard models on the square lattice as our benchmark cases, we evaluate their variational energies as a function of both bond dimension as well as cylinder width. In both examples we find crossovers at moderate cylinder widths, i.e. for the largest bond dimensions considered we find an improvement on the variational energies for the Heisenberg model by using projected entangled-pair states at a width of about 11 sites, whereas for the half-filled Hubbard model this crossover occurs at about 7 sites.

physics.comp-ph↗

Optimizing Schedules for Quantum Annealing

Classical and quantum annealing are two heuristic optimization methods that search for an optimal solution by slowly decreasing thermal or quantum fluctuations. Optimizing annealing schedules is important both for performance and fair comparisons between classical annealing, quantum annealing, and other algorithms. Here we present a heuristic approach for the optimization of annealing schedules for quantum annealing and apply it to 3D Ising spin glass problems. We find that if both classical and quantum annealing schedules are similarly optimized, classical annealing outperforms quantum annealing for these problems when considering the residual energy obtained in slow annealing. However, when performing many repetitions of fast annealing, simulated quantum annealing is seen to outperform classical annealing for our benchmark problems.

quant-ph↗

Assessment of Quantum Annealing for the Construction of Satisfiability Filters

Satisfiability filters, introduced by S. A. Weaver et al. in 2014, are a new and promising type of filters to address set membership testing. In order to construct satisfiability filters, it is necessary to find disparate solutions to hard random $k$-SAT problems. This paper compares simulated annealing, simulated quantum annealing and walkSAT, an open-source SAT solver, in terms of their ability to find such solutions. The results indicate that solutions found by simulated quantum annealing are generally less disparate than solutions found by the other solvers and therefore less useful for the construction of satisfiability filters.

quant-ph↗

Quantum Monte Carlo tunneling from quantum chemistry to quantum annealing

Quantum Tunneling is ubiquitous across different fields, from quantum chemical reactions, and magnetic materials to quantum simulators and quantum computers. While simulating the real-time quantum dynamics of tunneling is infeasible for high-dimensional systems, quantum tunneling also shows up in quantum Monte Carlo (QMC) simulations that scale polynomially with system size. Here we extend a recent results obtained for quantum spin models {[{Phys. Rev. Lett.} {\bf 117}, 180402 (2016)]}, and study high-dimensional continuos variable models for proton transfer reactions. We demonstrate that QMC simulations efficiently recover ground state tunneling rates due to the existence of an instanton path, which always connects the reactant state with the product. We discuss the implications of our results in the context of quantum chemical reactions and quantum annealing, where quantum tunneling is expected to be a valuable resource for solving combinatorial optimization problems.

quant-ph↗

Designing Adiabatic Quantum Optimization: A Case Study for the Traveling Salesman Problem

With progress in quantum technology more sophisticated quantum annealing devices are becoming available. While they offer new possibilities for solving optimization problems, their true potential is still an open question. As the optimal design of adiabatic algorithms plays an important role in their assessment, we illustrate the aspects and challenges to consider when implementing optimization problems on quantum annealing hardware based on the example of the traveling salesman problem (TSP). We demonstrate that tunneling between local minima can be exponentially suppressed if the quantum dynamics are not carefully tailored to the problem. Furthermore we show that inequality constraints, in particular, present a major hurdle for the implementation on analog quantum annealers. We finally argue that programmable digital quantum annealers can overcome many of these obstacles and can - once large enough quantum computers exist - provide an interesting route to using quantum annealing on a large class of problems.

quant-ph↗

Scaling analysis and instantons for thermally-assisted tunneling and Quantum Monte Carlo simulations

We develop an instantonic calculus to derive an analytical expression for the thermally-assisted tunneling decay rate of a metastable state in a fully connected quantum spin model. The tunneling decay problem can be mapped onto the Kramers escape problem of a classical random dynamical field. This dynamical field is simulated efficiently by path integral Quantum Monte Carlo (QMC). We show analytically that the exponential scaling with the number of spins of the thermally-assisted quantum tunneling rate and the escape rate of the QMC process are identical. We relate this effect to the existence of a dominant instantonic tunneling path. The instanton trajectory is described by nonlinear dynamical mean-field theory equations for a single site magnetization vector, which we solve exactly. Finally, we derive scaling relations for the "spiky" barrier shape when the spin tunnelling and QMC rates scale polynomially with the number of spins $N$ while a purely classical over-the-barrier activation rate scales exponentially with $N$.

quant-ph↗

Quantum Monte Carlo Annealing with Multi-Spin Dynamics

We introduce a novel Simulated Quantum Annealing (SQA) algorithm which employs a multispin quantum fluctuation operator. At variance with the usual transverse field, short-range two-spin flip interactions are included in the driver Hamiltonian. A Quantum Monte Carlo algorithm, capable of efficiently simulating large disordered systems, is described and tested. A first application to SQA, on a random square lattice Ising spin glass reveals that the multi-spin driver Hamiltonian improves upon the usual transverse field. This work paves the way for more systematic investigations using multi-spin quantum fluctuations on a broader range of problems.

quant-ph↗

Operator Locality in Quantum Simulation of Fermionic Models

Simulating fermionic lattice models with qubits requires mapping fermionic degrees of freedom to qubits. The simplest method for this task, the Jordan-Wigner transformation, yields strings of Pauli operators acting on an extensive number of qubits. This overhead can be a hindrance to implementation of qubit-based quantum simulators, especially in the analog context. Here we thus review and analyze alternative fermion-to-qubit mappings, including the two approaches by Bravyi and Kitaev and the Auxiliary Fermion transformation. The Bravyi-Kitaev transform is reformulated in terms of a classical data structure and generalized to achieve a further locality improvement for local fermionic models on a rectangular lattice. We conclude that the most compact encoding of the fermionic operators can be done using ancilla qubits with the Auxiliary Fermion scheme. Without introducing ancillas, a variant of the Bravyi-Kitaev transform provides the most compact fermion-to-qubit mapping for Hubbard-like models.

quant-ph↗

Experimental Signatures of the Inverted Phase in InAs/GaSb Coupled Quantum Wells

Transport measurements are performed on InAs/GaSb double quantum wells at zero and finite magnetic fields applied parallel and perpendicular to the quantum wells. We investigate a sample in the inverted regime where electrons and holes coexist, and compare it with another sample in the non-inverted semiconducting regime. Activated behavior in conjunction with a strong suppression of the resistance peak at the charge neutrality point in a parallel magnetic field attest to the topological hybridization gap between electron and hole bands in the inverted sample. We observe an unconventional Landau level spectrum with energy gaps modulated by the magnetic field applied perpendicular to the quantum wells. This is caused by strong spin-orbit interaction provided jointly by the InAs and the GaSb quantum wells.

cond-mat.mes-hall↗

Z2Pack: Numerical Implementation of Hybrid Wannier Centers for Identifying Topological Materials

The intense theoretical and experimental interest in topological insulators and semimetals has established band structure topology as a fundamental material property. Consequently, identifying band topologies has become an important, but often challenging problem, with no exhaustive solution at the present time. In this work we compile a series of techniques, some previously known, that allow for a solution to this problem for a large set of the possible band topologies. The method is based on tracking hybrid Wannier charge centers computed for relevant Bloch states, and it works at all levels of materials modeling: continuous k.p models, tight-binding models and ab initio calculations. We apply the method to compute and identify Chern, Z2 and crystalline topological insulators, as well as topological semimetal phases, using real material examples. Moreover, we provide a numerical implementation of this technique (the Z2Pack software package) that is ideally suited for high-throughput screening of materials databases for compounds with non-trivial topologies. We expect that our work will allow researchers to: (a) identify topological materials optimal for experimental probes, (b) classify existing compounds and (c) reveal materials that host novel, not yet described, topological states.

cond-mat.mtrl-sci↗