Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physics

A Random Approach to Quantum Simulation

Dominic William Berry

Published Aug 14, 2019• 3 citations
Publisher
DOI
10.1103/physics.12.91

Related papers

Bridging gaps between random approaches to quantum simulation

Leonardo Novo

•Mar 19, 2020•1 citation

Randomized Algorithms and Lower Bounds for Quantum Simulation

Zhang, Chi

We consider deterministic and {\em randomized} quantum algorithms simulating $e^{-iHt}$ by a product of unitary operators $e^{-iA_jt_j}$, $j=1,...,N$, where $A_j\in\{H_1,...,H_m\}$, $H=\sum_{i=1}^m H_i$ and $t_j > 0$ for every $j$. Randomized algorithms are algorithms approximating the final state of the system by a mixed quantum state. First, we provide a scheme to bound the trace distance of the final quantum states of randomized algorithms. Then, we show some randomized algorithms, which have the same efficiency as certain deterministic algorithms, but are less complicated than their opponentes. Moreover, we prove that both deterministic and randomized algorithms simulating $e^{-iHt}$ with error $\e$ at least have $Ω(t^{3/2}\e^{-1/2})$ exponentials.

arXiv:0910.4145•Oct 21, 2009•1 citation

A perspective on quantum simulations

E. Solano

Proceedings of the International School of Physics "Enrico Fermi"•Jan 1, 2018•0 citations

Title: The Geometry of Randomness – Characterizing Fractal Behavior with Quantum Simulation

Jincheng Zhang

This paper investigates the geometry of randomness, specifically focusing on characterizing fractal behavior using quantum simulation. The core claim is to develop a novel quantum simulation technique to unveil the underlying fractal structure of random systems, thereby providing a deeper understanding of their complex dynamics. The method aims to emulate the evolution of a random system through quantum mechanics, allowing us to directly observe and quantify the emergence of fractal patterns. The research will explore the potential of this approach to surpass current approximation methods, offering a fundamentally new pathway to analyze and quantify fractal geometry.

•Sep 1, 2026•0 citations

Introduction to Quantum Simulation

Linda Sansoni

Springer theses•Jan 1, 2014•0 citations

Efficient Random Quantum Circuit Generator: A Benchmarking Approach for Quantum Simulators

Vu Tuan Hai, Vu Trung Duong Le, Pham Hoai Luan +1 more

Recently, many proposed simulators have been proposed. However, they lack a standard evaluation, including a benchmarking dataset and metrics set, leading to low confidence. To solve this problem, in this research, we propose a general random quantum circuit (RQC) generator. The proposed generator consumes fewer resources than the Haar random generator. When increasing the number of qubits, the resources used by the RQC generator remain constant, while the resources for Haar increase exponentially. To demonstrate the applicability of RQC, we evaluated on 14GB dataset of 15,000 generated quantum circuits through four simulators and three hardware-based simulators. Moreover, the evaluation metrics have been clarified for the benchmarking process of quantum simulators. The experiment results based on these metrics demonstrate that the RQC generator is a practical component for random quantum circuit benchmarking.

RIVF International Conference on Computing and Communication Technologies (RIVF)•Dec 21, 2024•3 citations
We consider deterministic and {\em randomized} quantum algorithms simulating e−iHte^{-iHt}e−iHt by a product of unitary operators e−iAjtje^{-iA_jt_j}e−iAj​tj​, j=1,...,Nj=1,...,Nj=1,...,N, where Aj∈{H1,...,Hm}A_j\in\{H_1,...,H_m\}Aj​∈{H1​,...,Hm​}, H=∑i=1mHiH=\sum_{i=1}^m H_iH=∑i=1m​Hi​ and tj>0t_j > 0tj​>0 for every jjj. Randomized algorithms are algorithms approximating the final state of the system by a mixed quantum state. First, we provide a scheme to bound the trace distance of the final quantum states of randomized algorithms. Then, we show some randomized algorithms, which have the same efficiency as certain deterministic algorithms, but are less complicated than their opponentes. Moreover, we prove that both deterministic and randomized algorithms simulating e−iHte^{-iHt}e−iHt with error $\e$ at least have $Ω(t^{3/2}\e^{-1/2})$ exponentials.
This paper investigates the geometry of randomness, specifically focusing on characterizing fractal behavior using quantum simulation. The core claim is to develop a novel quantum simulation technique to unveil the underlying fractal structure of random systems, thereby providing a deeper understanding of their complex dynamics. The method aims to emulate the evolution of a random system through quantum mechanics, allowing us to directly observe and quantify the emergence of fractal patterns. The research will explore the potential of this approach to surpass current approximation methods, offering a fundamentally new pathway to analyze and quantify fractal geometry.
Recently, many proposed simulators have been proposed. However, they lack a standard evaluation, including a benchmarking dataset and metrics set, leading to low confidence. To solve this problem, in this research, we propose a general random quantum circuit (RQC) generator. The proposed generator consumes fewer resources than the Haar random generator. When increasing the number of qubits, the resources used by the RQC generator remain constant, while the resources for Haar increase exponentially. To demonstrate the applicability of RQC, we evaluated on 14GB dataset of 15,000 generated quantum circuits through four simulators and three hardware-based simulators. Moreover, the evaluation metrics have been clarified for the benchmarking process of quantum simulators. The experiment results based on these metrics demonstrate that the RQC generator is a practical component for random quantum circuit benchmarking.