Probabilistic Nonunitary Gate in Imaginary Time Evolution

• URL: http://arxiv.org/abs/2006.09726v2
• Date: Wed, 2 Sep 2020 10:05:17 GMT
• Title: Probabilistic Nonunitary Gate in Imaginary Time Evolution
• Authors: Tong Liu, Jin-Guo Liu and Heng Fan
• Abstract summary: 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.
• Score: 19.255769538019106
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Algorithm Cards: Streamlining the development of hybrid classical-quantum applications [0.0]
  The emergence of quantum computing proposes a revolutionary paradigm that can radically transform numerous scientific and industrial application domains. The ability of quantum computers to scale computations implies better performance and efficiency for certain algorithmic tasks than current computers provide. To gain benefit from such improvement, quantum computers must be integrated with existing software systems, a process that is not straightforward.
  arXiv  Detail & Related papers  (2023-10-04T06:02:59Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Nonunitary Gate Operations by Dissipation Engineering [0.0]
  We propose protocols that harness dissipation to realize the nonunitary evolution required for irreversible gate operations. We exemplify our approach considering several classical logic operations, such as the OR, NOR, and XOR gates. Our study shows that irreversible logic operations can be efficiently performed on realistic quantum systems and that dissipation engineering is an essential tool for obtaining nonunitary evolutions.
  arXiv  Detail & Related papers  (2022-01-28T18:53:10Z)
• 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 [0.0]
  Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system. We propose a new approach of PITE which requires only a single ancillary qubit. We discuss the application of our approach to quantum chemistry by focusing on the scaling of computational cost.
  arXiv  Detail & Related papers  (2021-11-24T12:54:27Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Noncyclic nonadiabatic holonomic quantum gates via shortcuts to adiabaticity [5.666193021459319]
  We propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum systems via shortcuts to adiabaticity. Our scheme is readily realizable in physical system currently pursued for implementation of quantum computation.
  arXiv  Detail & Related papers  (2021-05-28T15:23:24Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Real- and imaginary-time evolution with compressed quantum circuits [0.5089078998562184]
  We show that quantum circuits can provide a dramatically more efficient representation than current classical numerics. For quantum circuits, we perform both real- and imaginary-time evolution using an optimization algorithm that is feasible on near-term quantum computers.
  arXiv  Detail & Related papers  (2020-08-24T11:16:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.