Improved real-space parallelizable matrix-product state compression and
its application to unitary quantum dynamics simulation
- URL: http://arxiv.org/abs/2312.02667v1
- Date: Tue, 5 Dec 2023 11:14:48 GMT
- Title: Improved real-space parallelizable matrix-product state compression and
its application to unitary quantum dynamics simulation
- Authors: Rong-Yang Sun and Tomonori Shirakawa and Seiji Yunoki
- Abstract summary: We introduce an improved real-space parallelizable matrix-product state (MPS) compression method.
We further apply this method to simulate unitary quantum dynamics and introduce a parallel time-evolving block-decimation algorithm.
The obtained numerical results unequivocally demonstrate that the pTEBD algorithm achieves the same level of simulation precision as the current state-of-the-art MPS algorithm.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Towards the efficient simulation of near-term quantum devices using tensor
network states, we introduce an improved real-space parallelizable
matrix-product state (MPS) compression method. This method enables efficient
compression of all virtual bonds in constant time, irrespective of the system
size, with controlled accuracy, while it maintains the stability of the
wavefunction norm without necessitating sequential renormalization procedures.
In addition, we introduce a parallel regauging technique to partially restore
the deviated canonical form, thereby improving the accuracy of the simulation
in subsequent steps. We further apply this method to simulate unitary quantum
dynamics and introduce a parallel time-evolving block-decimation (pTEBD)
algorithm. We employ the pTEBD algorithm for extensive simulations of typical
one- and two-dimensional quantum circuits, involving over 1000 qubits. The
obtained numerical results unequivocally demonstrate that the pTEBD algorithm
achieves the same level of simulation precision as the current state-of-the-art
MPS algorithm but in polynomially shorter time, exhibiting nearly perfect weak
scaling performance on a modern supercomputer.
Related papers
- Two dimensional quantum lattice models via mode optimized hybrid CPU-GPU density matrix renormalization group method [0.0]
We present a hybrid numerical approach to simulate quantum many body problems on two spatial dimensional quantum lattice models.
We demonstrate for the two dimensional spinless fermion model and for the Hubbard model on torus geometry that several orders of magnitude in computational time can be saved.
arXiv Detail & Related papers (2023-11-23T17:07:47Z) - Efficient Quantum Circuit Simulation by Tensor Network Methods on Modern
GPUs [12.741817108411214]
In quantum hardware, primary simulation methods are based on state vectors and tensor networks.
As the number of qubits and quantum gates grows larger, traditional state-vector based quantum circuit simulation methods prove inadequate due to the overwhelming size of the Hilbert space and extensive entanglement.
In this study, we propose general optimization strategies from two aspects: computational efficiency and accuracy.
arXiv Detail & Related papers (2023-10-06T02:24:05Z) - Simulating Hamiltonian dynamics in a programmable photonic quantum
processor using linear combinations of unitary operations [4.353492002036882]
We modify the multi-product Trotterization and combine it with the oblivious amplitude amplification to simultaneously reach a high simulation precision and high success probability.
We experimentally implement the modified multi-product algorithm in an integrated-photonics programmable quantum simulator in silicon.
arXiv Detail & Related papers (2022-11-12T18:49: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) - QuOp_MPI: a framework for parallel simulation of quantum variational
algorithms [0.0]
QuOp_MPI is a Python package designed for parallel simulation of quantum variational algorithms.
It presents an object-orientated approach to quantum variational algorithm design.
arXiv Detail & Related papers (2021-10-08T08:26:09Z) - Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations.
Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff.
For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
arXiv Detail & Related papers (2021-09-07T20:01:22Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Continuous-time dynamics and error scaling of noisy highly-entangling
quantum circuits [58.720142291102135]
We simulate a noisy quantum Fourier transform processor with up to 21 qubits.
We take into account microscopic dissipative processes rather than relying on digital error models.
We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
arXiv Detail & Related papers (2021-02-08T14:55:44Z) - Fast and differentiable simulation of driven quantum systems [58.720142291102135]
We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods.
We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
arXiv Detail & Related papers (2020-12-16T21:43:38Z) - Realistic simulation of quantum computation using unitary and
measurement channels [1.406995367117218]
We introduce a new simulation approach that relies on approximating the density matrix evolution by a sum of unitary and measurement channels.
This model shows an improvement of at least one order of magnitude in terms of accuracy compared to the best known approaches.
arXiv Detail & Related papers (2020-05-13T14:29:18Z) - Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
Random quantum circuits are commonly viewed as hard to simulate classically.
We show that approximate simulation of typical instances is almost as hard as exact simulation.
We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
arXiv Detail & Related papers (2019-12-31T19:00:00Z)
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.