Simulating quantum circuits using the multi-scale entanglement renormalization ansatz

• URL: http://arxiv.org/abs/2112.14046v1
• Date: Tue, 28 Dec 2021 09:05:01 GMT
• Title: Simulating quantum circuits using the multi-scale entanglement renormalization ansatz
• Authors: I.A. Luchnikov, A.V. Berezutskii, A.K. Fedorov
• Abstract summary: We propose a scalable technique for approximate simulations of intermediate-size quantum circuits. We benchmark the proposed technique for checkerboard-type intermediate-size quantum circuits of 27 qubits with various depths.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Understanding the limiting capabilities of classical methods in simulating complex quantum systems is of paramount importance for quantum technologies. Although many advanced approaches have been proposed and recently used to challenge quantum advantage experiments, novel efficient methods for approximate simulation of complex quantum systems are highly demanded. Here we propose a scalable technique for approximate simulations of intermediate-size quantum circuits on the basis of multi-scale entanglement renormalization ansatz (MERA). MERA is a tensor network, whose geometry together with orthogonality constraints imposed on its "elementary" tensors allows approximating many-body quantum states lying beyond the area-law scaling of the entanglement entropy. We benchmark the proposed technique for checkerboard-type intermediate-size quantum circuits of 27 qubits with various depths. Our approach paves a way to explore new efficient simulation techniques for quantum many-body systems.

Related papers

• Entropy-driven entanglement forging [0.0]
  We show how entropy-driven entanglement forging can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices. Our findings indicate that our method, entropy-driven entanglement forging, can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2024-09-06T16:54:41Z)
• 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)
• Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach [5.193557673127421]
  We present a general framework to calculate the lower bound for simulating a broad class of quantum Markov semigroups. Our framework can be applied to both unital and non-unital quantum dynamics.
  arXiv  Detail & Related papers  (2024-07-22T03:57:41Z)
• Multi-reference Quantum Davidson Algorithm for Quantum Dynamics [3.3869539907606603]
  Quantum Krylov Subspace (QKS) methods have been developed, enhancing the ability to perform accelerated simulations on noisy intermediate-scale quantum computers. We introduce and evaluate two QKS methods derived from the QDavidson algorithm, a novel approach for determining the ground and excited states of many-body systems.
  arXiv  Detail & Related papers  (2024-06-12T22:30:52Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Quantum Neural Architecture Search with Quantum Circuits Metric and Bayesian Optimization [2.20200533591633]
  We propose a new quantum gates distance that characterizes the gates' action over every quantum state. Our approach significantly outperforms the benchmark on three empirical quantum machine learning problems.
  arXiv  Detail & Related papers  (2022-06-28T16:23:24Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Classical variational simulation of the Quantum Approximate Optimization Algorithm [0.0]
  We introduce a method to simulate layered quantum circuits consisting of parametrized gates. A neural-network parametrization of the many-qubit wave function is used. For the largest circuits simulated, we reach 54 qubits at 4 QAOA layers.
  arXiv  Detail & Related papers  (2020-09-03T15:55:27Z)

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.