Related papers: Efficiency of classical simulations of a noisy Gro…
Classical simulations of noisy quantum circuits are instrumental to our understanding of the behavior of real-world quantum systems and the identification of regimes where one expects quantum advantage. In this work, we present a highly…
The dynamics of open quantum systems can be simulated by unraveling it into an ensemble of pure state trajectories undergoing non-unitary monitored evolution, which has recently been shown to undergo measurement-induced entanglement phase…
Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which…
Quantum processing units boost entanglement at the level of hardware and enable physical simulations of highly correlated electron states in molecules and intermolecular chemical bonds. The variational quantum eigensolver provides a…
Today's experimental noisy quantum processors can compete with and surpass all known algorithms on state-of-the-art supercomputers for the computational benchmark task of Random Circuit Sampling [1-5]. Additionally, a circuit-based quantum…
Simulating quantum circuits with classical computers requires resources growing exponentially in terms of system size. Real quantum computer with noise, however, may be simulated polynomially with various methods considering different noise…
The cost of classical simulations of quantum many-body dynamics is often determined by the amount of entanglement in the system. In this paper, we study entanglement in stochastic quantum trajectory approaches that solve master equations…
The implementation and practicality of quantum algorithms highly hinge on the quality of operations within a quantum processor. Therefore, including realistic error models in quantum computing simulation platforms is crucial for testing…
Using the tensor product representation in the density matrix renormalization group, we show that a quantum circuit of Grover's algorithm, which has one-qubit unitary gates, generalized Toffoli gates, and projective measurements, can be…
We optimize matrix-product state-based algorithms for simulating quantum circuits with finite fidelity, specifically the time-evolving block decimation (TEBD) and the density-matrix renormalization group (DMRG) algorithms, by exploiting the…
We study how matrix-product-operator (MPO) truncation errors evolve when simulating two setups: (1) 1D Haar-random circuits under either depolarizing noise or amplitude-damping noise, and (2) 1D Lindbladian dynamics of a non-integrable…
Evolution of entanglement with the proceeding of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one.…
Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide any quantum-computational speedup, although we cannot…
This paper demonstrates that how well a state performs as an input to Grover's search algorithm depends critically upon the entanglement present in that state; the more entanglement, the less well the algorithm performs. More precisely,…
Quantum computation offers significant potential for accelerating the simulation of molecules and materials through algorithms such as quantum phase estimation (QPE). However, the expected speedup in ground-state energy estimation depends…
In this article, we present a novel approach to investigating entanglement in the context of quantum computing. Our methodology involves analyzing reduced density matrices at different stages of a quantum algorithm's execution and…
Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary and that the full Hilbert space is available. However, in…
Matrix Product States (MPS) and Operators (MPO) have been proven to be a powerful tool to study quantum many-body systems but are restricted to moderately entangled states as the number of parameters scales exponentially with the…
The dynamics of one-dimensional quantum many-body systems is often numerically simulated with matrix-product states (MPSs). The computational complexity of MPS methods is known to be related to the growth of entropies of reduced density…
Quantum Entanglement is a fundamentally important resource in Quantum Information Science; however, generating it in practice is plagued by noise and decoherence, limiting its utility. Entanglement distillation and forward error correction…