Tensor-Network Simulations of Noisy Quantum Computers
- URL: http://arxiv.org/abs/2304.01751v1
- Date: Tue, 4 Apr 2023 12:42:18 GMT
- Title: Tensor-Network Simulations of Noisy Quantum Computers
- Authors: Marcel Niedermeier, Jose L. Lado and Christian Flindt
- Abstract summary: We simulate the execution of three quantum algorithms on noisy quantum computers.
We find that they can be executed with high fidelity even at a moderate loss of entanglement.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computers are a rapidly developing technology with the ultimate goal
of outperforming their classical counterparts in a wide range of computational
tasks. Several types of quantum computers already operate with more than a
hundred qubits. However, their performance is hampered by interactions with
their environments, which destroy the fragile quantum information and thereby
prevent a significant speed-up over classical devices. For these reasons, it is
now important to explore the execution of quantum algorithms on noisy quantum
processors to better understand the limitations and prospects of realizing
near-term quantum computations. To this end, we here simulate the execution of
three quantum algorithms on noisy quantum computers using matrix product states
as a special class of tensor networks. Matrix product states are characterized
by their maximum bond dimension, which limits the amount of entanglement they
can describe, and which thereby can mimic the generic loss of entanglement in a
quantum computer. We analyze the fidelity of the quantum Fourier transform,
Grover's algorithm, and the quantum counting algorithm as a function of the
bond dimension, and we map out the entanglement that is generated during the
execution of these algorithms. For all three algorithms, we find that they can
be executed with high fidelity even at a moderate loss of entanglement. We also
identify the dependence of the fidelity on the number of qubits, which is
specific to each algorithm. Our approach provides a general method for
simulating noisy quantum computers, and it can be applied to a wide range of
algorithms.
Related papers
- The Algorithm for Solving Quantum Linear Systems of Equations With Coherent Superposition and Its Extended Applications [8.8400072344375]
We propose two quantum algorithms for solving quantum linear systems of equations with coherent superposition.
The two quantum algorithms can both compute the rank and general solution by one measurement.
Our analysis indicates that the proposed algorithms are mainly suitable for conducting attacks against lightweight symmetric ciphers.
arXiv Detail & Related papers (2024-05-11T03:03:14Z) - Tensor Quantum Programming [0.0]
We develop an algorithm that encodes Matrix Product Operators into quantum circuits with a depth that depends linearly on the number of qubits.
It demonstrates effectiveness on up to 50 qubits for several frequently encountered in differential equations, optimization problems, and quantum chemistry.
arXiv Detail & Related papers (2024-03-20T10:44:00Z) - Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
This thesis develops two main techniques to reduce the quantum computational resource requirements.
The aim is to scale up application sizes on current quantum processors.
While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
arXiv Detail & Related papers (2024-03-01T19:36:35Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Power Characterization of Noisy Quantum Kernels [52.47151453259434]
We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small.
We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
arXiv Detail & Related papers (2024-01-31T01:02:16Z) - Generalized quantum Arimoto-Blahut algorithm and its application to
quantum information bottleneck [55.22418739014892]
We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al.
We apply our algorithm to the quantum information bottleneck with three quantum systems.
Our numerical analysis shows that our algorithm is better than their algorithm.
arXiv Detail & Related papers (2023-11-19T00:06:11Z) - Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
We design, implement, and evaluate three hybrid quantum k-Means algorithms.
We exploit quantum phenomena to speed up the computation of distances.
We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
arXiv Detail & Related papers (2022-12-13T16:04:16Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - Establishing trust in quantum computations [0.0]
We introduce a technique for measuring the fidelity with which an as-built quantum computer can execute an algorithm.
Our technique converts the algorithm's quantum circuits into a set of closely related circuits whose success rates can be efficiently measured.
arXiv Detail & Related papers (2022-04-15T17:44:30Z) - Quantum Algorithms for Unsupervised Machine Learning and Neural Networks [2.28438857884398]
We introduce quantum algorithms to solve tasks such as matrix product or distance estimation.
These results are then used to develop new quantum algorithms for unsupervised machine learning.
We will also present new quantum algorithms for neural networks, or deep learning.
arXiv Detail & Related papers (2021-11-05T16:36:09Z) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z)
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.