Parallel quantum trajectories via forking for sampling without redundancy

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 15
  • Download : 0
The computational cost of preparing a quantum state can be substantial depending on the structure of data to be encoded. Many quantum algorithms require repeated sampling to find the answer, mandating reconstruction of the same input state for every execution of an algorithm. Thus, the advantage of quantum computation can diminish due to redundant state initialization. We present a framework based on quantum forking that bypasses this fundamental issue and expedites a family of tasks that require sampling from independent quantum processes. Quantum forking propagates an input state to multiple quantum trajectories in superposition, and a weighted power sum of individual results from each trajectories is obtained in one measurement via quantum interference. The significance of our work is demonstrated via applications to implementing non-unitary quantum channels, studying entanglement and benchmarking quantum control. A proof-of-principle experiment is implemented on the IBM and Rigetti quantum cloud platforms.
Publisher
IOP PUBLISHING LTD
Issue Date
2019-08
Language
English
Article Type
Article
Citation

NEW JOURNAL OF PHYSICS, v.21

ISSN
1367-2630
DOI
10.1088/1367-2630/ab35fb
URI
http://hdl.handle.net/10203/266614
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0