Probabilistic Nonunitary Gate in Imaginary Time Evolution

Abstract

Simulation of quantum matters is a significant application of quantum computers. In contrast to the unitary operation which can be realized naturally on a quantum computer, the implementation of nonunitary operation, widely used in classical approaches, needs special designing. Here, by application of Grover's algorithm, we extend the probabilistic method of implementing nonunitary operation and show that it can promote success probability without fidelity decreasing. This method can be applied to problems of imaginary time evolution and contraction of tensor networks on a quantum computer.

References in corpus (51)

• Quantum Mechanics helps in searching for a needle in a haystack
• The density-matrix renormalization group in the age of matrix product states
• Efficient classical simulation of slightly entangled quantum computations
• Quantum Annealing in the Transverse Ising Model
• Barren plateaus in quantum neural network training landscapes
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Efficient simulation of one-dimensional quantum many-body systems
• Entanglement renormalization
• Thermodynamic limit of the density matrix renormalization for the spin-1 Heisenberg chain
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• A class of quantum many-body states that can be efficiently simulated
• Quantum annealing with more than one hundred qubits
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Theory of Quantum Annealing of an Ising Spin Glass
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Efficient quantum state tomography
• Criticality, the area law, and the computational power of PEPS
• Tensor networks for complex quantum systems
• Variational ansatz-based quantum simulation of imaginary time evolution
• Sequential generation of entangled multi-qubit states
• The computational complexity of PEPS
• Experimental signature of programmable quantum annealing
• PEPS as ground states: degeneracy and topology
• Continuous Matrix Product States for Quantum Fields
• Computational Role of Multiqubit Tunneling in a Quantum Annealer
• Coherent perfect absorption in deeply subwavelength films in the single photon regime
• Fixed-point quantum search with an optimal number of queries
• Exponential improvement in precision for simulating sparse Hamiltonians
• A different kind of quantum search
• Quantum versus Classical Annealing of Ising Spin Glasses
• Variational Quantum Eigensolver with Fewer Qubits
• Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
• Application of Quantum Annealing to Nurse Scheduling Problem
• Quantum simulation of a three-body interaction Hamiltonian on an NMR quantum computer
• Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
• Multi-scale Entanglement Renormalization Ansatz in Two Dimensions: Quantum Ising Model
• Nested quantum search and NP-complete problems
• Symmetry-adapted variational quantum eigensolver
• Nonunitary quantum circuit
• Generalized Hartree-Fock Theory for Interacting Fermions in Lattices: Numerical Methods
• Quantum optical realization of arbitrary linear transformations allowing for loss and gain
• Contracting projected entangled pair states is average-case hard
• Preparing projected entangled pair states on a quantum computer
• Non-unitary operations for ground-state calculations in near term quantum computers
• Tensor Network Contractions for #SAT
• Experimental implementation of adiabatic passage between different topological orders
• Measurement-based quantum phase estimation algorithm for finding eigenvalues of non-unitary matrices
• Preparing topological PEPS on a quantum computer
• Solving search problems by strongly simulating quantum circuits
• Experimental Simulation of Bosonic Creation and Annihilation Operators in a Quantum Processor

Cited by in corpus (8)

• Grid-based methods for chemistry simulations on a quantum computer
• Error-resilient Monte Carlo quantum simulation of imaginary time
• Efficient quantum imaginary time evolution by drifting real time evolution: an approach with low gate and measurement complexity
• Molecular Structure Optimization based on Electrons-Nuclei Quantum Dynamics Computation
• Nonunitary Gate Operations by Dissipation Engineering
• Evaluating thermal expectation values by almost ideal sampling with Trotter gates
• Probabilistic imaginary-time evolution by using forward and backward real-time evolution with a single ancilla: first-quantized eigensolver of quantum chemistry for ground states
• Quantum State Preparation and Non-Unitary Evolution with Diagonal Operators