English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Early but promising results in quantum computing have been enabled by theconcurrent development of quantum algorithms, devices, and materials. Classicalsimulation of quantum programs has enabled the design and analysis ofalgorithms and implementation strategies targeting current and anticipatedquantum device architectures. In this paper, we present a graph-based approachto achieve efficient quantum circuit simulation. Our approach involvespartitioning the graph representation of a given quantum circuit into acyclicsub-graphs/circuits that exhibit better data locality. Simulation of eachsub-circuit is organized hierarchically, with the iterative construction andsimulation of smaller state vectors, improving overall performance. Also, thispartitioning reduces the number of passes through data, improving the totalcomputation time. We present three partitioning strategies and observe thatacyclic graph partitioning typically results in the best time-to-solution. Incontrast, other strategies reduce the partitioning time at the expense ofpotentially increased simulation times. Experimental evaluation demonstratesthe effectiveness of our approach.

Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning