We introduce a simple sub-universal quantum computing model, which we call the Hadamard-classical circuit with one-qubit (HC1Q) model. It consists of a classical reversible circuit sandwiched by two layers of Hadamard gates, and therefore it is in the second level of the Fourier hierarchy. We show that output probability distributions of the HC1Q model cannot be classically efficiently sampled within a multiplicative error unless the polynomial-time hierarchy collapses to the second level. The proof technique is different from those used for previous sub-universal models, such as IQP, Boson Sampling, and DQC1, and therefore the technique itself might be useful for finding other sub-universal models that are hard to classically simulate. We also study the classical verification of quantum computing in the second level of the Fourier hierarchy. To this end, we define a promise problem, which we call the probability distribution distinguishability with maximum norm (PDD-Max). It is a promise problem to decide whether output probability distributions of two quantum circuits are far apart or close. We show that PDD-Max is BQP-complete, but if the two circuits are restricted to some types in the second level of the Fourier hierarchy, such as the HC1Q model or the IQP model, PDD-Max has a Merlin-Arthur system with quantum polynomial-time Merlin and classical probabilistic polynomial-time Arthur.
 D. R. Simon, On the power of quantum computation. Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), p.116 (1994). DOI:10.1137/S0097539796298637.
 P. Shor, Algorithms for quantum computation: discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), p.124 (1994). DOI:10.1109/SFCS.1994.365700.
 M. J. Bremner, R. Jozsa, and D. J. Shepherd, Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy. Proc. R. Soc. A 467, 459 (2011). DOI:10.1098/rspa.2010.0301.
 M. J. Bremner, A. Montanaro, and D. J. Shepherd, Average-case complexity versus approximate simulation of commuting quantum computations. Phys. Rev. Lett. 117, 080501 (2016). DOI:10.1103/PhysRevLett.117.080501.
 B. M. Terhal and D. P. DiVincenzo, Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games. Quant. Inf. Comput. 4, 134 (2004). DOI:10.26421/QIC4.2.
 T. Morimae, K. Fujii, and J. F. Fitzsimons, Hardness of classically simulating the one clean qubit model. Phys. Rev. Lett. 112, 130502 (2014). DOI:10.1103/PhysRevLett.112.130502.
 T. Morimae, Hardness of classically sampling one clean qubit model with constant total variation distance error. Phys. Rev. A 96, 040302(R) (2017). DOI:10.1103/PhysRevA.96.040302.
 K. Fujii, H. Kobayashi, T. Morimae, H. Nishimura, S. Tamate, and S. Tani, Impossibility of classically simulating one-clean-qubit computation. Phys. Rev. Lett. 120, 200502 (2018). DOI:10.1103/PhysRevLett.120.200502.
 K. Fujii, H. Kobayashi, T. Morimae, H. Nishimura, S. Tamate, and S. Tani, Power of quantum computation with few clean qubits. Proceedings of 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), p.13:1. DOI:10.4230/LIPIcs.ICALP.2016.13.
 A. Bouland, J. F. Fitzsimons, and D. E. Koh, Quantum advantage from conjugated Clifford circuits. Proceedings of the 33rd Computational Complexity Conference (CCC2018). DOI:10.4230/LIPIcs.CCC.2018.21.
 A. Bouland, B. Fefferman, C. Nirkhe, and U. Vazirani, On the complexity and verification of quantum random circuit sampling. Nat. Phys. 2018 DOI:10.1038/s41567-018-0318-2.
 T. Morimae, D. Nagaj, and N. Schuch, Quantum proofs can be verified using only single-qubit measurements. Phys. Rev. A 93, 022326 (2016). DOI:10.1103/PhysRevA.93.022326.
 J. F. Fitzsimons, M. Hajdušek, and T. Morimae, Post hoc verification of quantum computation. Phys. Rev. Lett. 120, 040501 (2018). DOI:10.1103/PhysRevLett.120.040501.
 M. Hayashi and T. Morimae, Verifiable measurement-only blind quantum computing with stabilizer testing. Phys. Rev. Lett. 115, 220502 (2015). DOI:10.1103/PhysRevLett.115.220502.
 Z. Ji, Classical verification of quantum proofs. Proceedings of the 48th annual ACM symposium on Theory of Computing (STOC 2016) p.885 (2016). DOI:10.1145/2897518.2897634.
 M. McKague, Interactive proofs with efficient quantum prover for recursive Fourier sampling. Chicago Journal of Theoretical Computer Science 6, 1 (2012). DOI:10.4086/cjtcs.0006.
 T. F. Demarie, Y. Ouyang, and J. F. Fitzsimons, Classical verification of quantum circuits containing few basis changes. Phys. Rev. A 97, 042319 (2018). DOI:10.1103/PhysRevA.97.042319.
 A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, H. Weinfurter, Elementary gates for quantum computation. Phys. Rev. A 52 3457 (1995). DOI:10.1103/PhysRevA.52.3457.
 R. Canetti, G. Even, and O. Goldreich, Lower bounds for sampling algorithms for estimating the average. Information Processing Letters 53, 17 (1995).
 François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, and Yuki Takeuchi, "Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups", arXiv:1805.03385 (2018).
 Keisuke Fujii, "Quantum speedup in stoquastic adiabatic quantum computation", arXiv:1803.09954 (2018).
 Tomoyuki Morimae and Harumichi Nishimura, "Rational proofs for quantum computing", arXiv:1804.08868 (2018).
 Mariami Gachechiladze, Otfried Gühne, and Akimasa Miyake, "Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states", Physical Review A 99 5, 052304 (2019).
The above citations are from Crossref's cited-by service (last updated 2019-05-20 21:28:19) and SAO/NASA ADS (last updated 2019-05-20 21:28:20). The list may be incomplete as not all publishers provide suitable and complete citation data.
This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.