# Probabilistic nonunitary gate in imaginary time evolution

@article{Liu2021ProbabilisticNG,
title={Probabilistic nonunitary gate in imaginary time evolution},
author={Tongqi Liu and Jin-Guo Liu and H. Fan},
journal={Quantum Inf. Process.},
year={2021},
volume={20},
pages={204}
}
• Published 2021
• Physics, Computer Science
• Quantum Inf. Process.
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… Expand
2 Citations

#### Figures from this paper

Molecular Structure Optimization based on Electrons-Nuclei Quantum Dynamics Computation
A new concept of the molecular structure optimization method based on quantum dynamics computations is presented. Nuclei are treated as quantum mechanical particles, as are electrons, and theExpand
Quantum Power Method by a Superposition of Time-Evolved States
• Physics
• 2020
We propose a quantum-classical hybrid algorithm of the power method, here dubbed as quantum power method, to evaluate $\hat{\mathcal{H}}^{n}|\psi\rangle$ with quantum computers, where $n$ is aExpand

#### References

SHOWING 1-10 OF 97 REFERENCES
Nonunitary Operations for Ground-State Calculations in Near-Term Quantum Computers.
• Computer Science, Medicine
• Physical review letters
• 2019
A quantum Monte Carlo inspired reweighting scheme to accurately compute energies from optimally short quantum circuits and features both entanglement provided by a short quantum circuit, and the presence of an effective nonunitary operator at the same time. Expand
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Physics, Medicine
• Science
• 2001
For the small examples that the authors could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems. Expand
Variational ansatz-based quantum simulation of imaginary time evolution
• Computer Science, Mathematics
• 2018
This work proposes a variational algorithm that is hybrid, suitable for error mitigation and can exploit shallow quantum circuits, and can be implemented with current quantum computers, and uses it to find the ground-state energy of many-particle systems. Expand
Preparing topological projected entangled pair states on a quantum computer
• Physics
• 2013
Simulating of exotic phases of matter that are not amenable to classical techniques is one of the most important potential applications of quantum information processing. We present an efficientExpand
Experimental simulation of shift operators in a quantum processor
• Physics
• 2019
The ability of implementing quantum operations plays fundamental role in manipulating quantum systems. Creation and annihilation operators which transform a quantum state to another by adding orExpand
Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
The accurate computation of Hamiltonian ground, excited and thermal states on quantum computers stands to impact many problems in the physical and computer sciences, from quantum simulation toExpand
Probabilistic nonunitary quantum computing
In [1] Gingrich and Williams extended the standard quantum circuit model of quantum computation to include gates that perform arbitrary linear, yet non-unitary, transformations of their input state.Expand
Efficient classical simulation of slightly entangled quantum computations.
• G. Vidal
• Physics, Medicine
• Physical review letters
• 2003
The results imply that a necessary condition for an exponential computational speedup is that the amount of entanglement increases with the size n of the computation, and provide an explicit lower bound on the required growth. Expand
Preparing projected entangled pair states on a quantum computer.
• Physics, Computer Science
• Physical review letters
• 2012
An algorithm to prepare injective projected entangled pair states (PEPS) on a quantum computer, a class of open tensor networks representing quantum states, scales polynomially with the inverse of the minimum condition number of the PEPS projectors. Expand
Efficient simulation of one-dimensional quantum many-body systems.
• G. Vidal
• Computer Science, Physics
• Physical review letters
• 2004
Numerical analysis indicates that this method can be used, for instance, to efficiently compute time-dependent properties of low-energy dynamics in sufficiently regular but otherwise arbitrary one-dimensional quantum many-body systems. Expand