Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates.
Yasuhiro TakahashiTakeshi YamazakiKazuyuki TanakaPublished in: Quantum Inf. Comput. (2014)
Keyphrases
- logic circuits
- low power
- tunnel diode
- logic synthesis
- quantum computing
- high speed
- np hard
- np complete
- phase transition
- learning theory
- computational complexity
- power consumption
- information theoretic
- worst case
- low cost
- data sets
- np hardness
- evolutionary algorithm
- random instances
- expert systems
- search algorithm
- case study