Visualizing Quantum Circuit Probability: Estimating Quantum State Complexity for Quantum Program Synthesis
This work applies concepts from algorithmic probability to Boolean and quantum combinatorial logic circuits. The relations among the statistical, algorithmic, computational, and circuit complexities of states are reviewed. Thereafter, the probability of states in the circuit model of computation is...
Main Authors: | Bao Gia Bach, Akash Kundu, Tamal Acharya, Aritra Sarkar |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-05-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/25/5/763 |
Similar Items
-
Experimental Characterization of Fault-Tolerant Circuits in Small-Scale Quantum Processors
by: Rosie Cane, et al.
Published: (2021-01-01) -
Estimating Algorithmic Information Using Quantum Computing for Genomics Applications
by: Aritra Sarkar, et al.
Published: (2021-03-01) -
Quantum Gates to Implement the Reversible Logic Circuits
by: Ali H. Khidhir
Published: (2017-04-01) -
Shortcuts to adiabaticity in a fast controlled-phase gate in superconducting quantum circuits
by: Jia-Xin Li, et al.
Published: (2023-03-01) -
A universal quantum circuit design for periodical functions
by: Junxu Li, et al.
Published: (2021-01-01)