Fetching the paper…
Reading the bibliography…
In this paper, we study the problem of learning an unknown quantum circuit of a certain structure.
1908
Earlier work this paper cites.
A. Holevo, “Bounds for the quantity of information transmitted by a quantum communication channel,” Probl. Inf. Transm. , vol. 9, no. 3, pp. 177–– 183, 1973
1973
Earlier work this paper cites.
L. G. Valiant, “A theory of the learnable,” in Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC ’84 . ACM Press, 1984
1984
Earlier work this paper cites.
C. H. Bennett and S. J. Wiesner, “Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states,” Phys. Rev. Lett. , vol. 69, pp. 2881–2884, Nov 1992
1992
Earlier work this paper cites.
Z. Hradil, “Quantum-state estimation,” Phys. Rev. A , vol. 55, no. 3, pp. R1561–R1564, mar 1997
1997
Earlier work this paper cites.
I. L. Chuang and M. A. Nielsen, “Prescription for experimental determination of the dynamics of a quantum black box,” J. Mod. Opt. , vol. 44, no. 11-12, pp. 2455–2467, nov 1997
1997
Earlier work this paper cites.
J. F. Poyatos, J. I. Cirac, and P. Zoller, “Complete characterization of a quantum process: The two-bit quantum gate,” Phys. Rev. Lett. , vol. 78, no. 2, pp. 390–393, jan 1997
1997
Earlier work this paper cites.
D. Gottesman, “Theory of fault-tolerant quantum computation,” Phys. Rev. A , vol. 57, no. 1, pp. 127–137, jan 1998
1998
Earlier work this paper cites.
D. Gottesman, “The Heisenberg representation of quantum computers,” in Group theoretical methods in physics. Proceedings, 22nd International Colloquium, Group22, ICGTMP’98, Hobart, Australia, July 13-17,1998 , 1998, pp. 32–43
1998
Earlier work this paper cites.
A. Y. K. S. B. Bravyi, “Quantum codes on a lattice with boundary,” 1998, arXiv:quant-ph/9811052
1998
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,” Nature , vol. 402, pp. 390–393, 1999
1999
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information . Cambridge, UK: Cambridge University Press, 2000
2000
Earlier work this paper cites.
C. Moore and M. Nilsson, “Parallel quantum computation and quantum codes,” SIAM J. Comput. , vol. 31, no. 3, pp. 799–815, 2002
2002
Earlier work this paper cites.
G. M. D’Ariano, M. G. Paris, and M. F. Sacchi, “Quantum tomography,” in Advances in Imaging and Electron Physics . Elsevier, 2003, pp. 205–308
2003
Earlier work this paper cites.
J. Dehaene and B. De Moor, “Clifford group, stabilizer states, and linear and quadratic operations over GF(2),” Phys. Rev. A , vol. 68, p. 042318, Oct 2003
2003
Earlier work this paper cites.
A. Blum, A. Kalai, and H. Wasserman, “Noise-tolerant learning, the parity problem, and the statistical query model,” J. ACM, 50, no. 4, pp. 506–519, 2003
2003
Earlier work this paper cites.
S. Aaronson and D. Gottesman, “Improved simulation of stabilizer circuits,” Phys. Rev. A , vol. 70, p. 052328, Nov 2004
2004
Cited alongside, same era.
S. Bravyi and A. Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas,” Phys. Rev. A , vol. 71, p. 022316, Feb 2005
2005
Cited alongside, same era.
S. Aaronson, “The learnability of quantum states,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , vol. 463, no. 2088, pp. 3089–3114, dec 2007
2007
Cited alongside, same era.
D. Gottesman, “Identifying stabilizer states,” 2008. [Online]. Available: http://pirsa.org/08080052
2008
Cited alongside, same era.
M. Mohseni, A. T. Rezakhani, and D. A. Lidar, “Quantum-process tomography: resource analysis of different strategies,” Phys. Rev. A , vol. 77, no. 3, mar 2008
2008
S. Bravyi and D. Gosset, “Improved classical simulation of quantum circuits dominated by Clifford gates,” Phys. Rev. Lett. , vol. 116, p. 250501, Jun 2016
2016
Later among the works it cites.
J. Haah, A. W. Harrow, Z. Ji, X. Wu, and N. Yu, “Sample-optimal tomography of quantum states,” IEEE Trans. Inf. Theory , pp. 1–1, 2017
2017
Later among the works it cites.
A. Montanaro, “Learning stabilizer states by Bell sampling,” 2017, arXiv:1707.04012
2017
Later among the works it cites.
M. Howard and E. Campbell, “Application of a resource theory for magic states to fault-tolerant quantum computing,” Phys. Rev. Lett. , vol. 118, p. 090501, Mar 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
K. N. Patel, I. L. Markov, and J. P. Hayes, “Optimal synthesis of linear reversible circuits,” Quant. Inf. Comput. , vol. 8, no. 3&4, pp. 0282–0294, 2008
2008
Cited alongside, same era.
R. A. Low, “Learning and testing algorithms for the Clifford group,” Phys. Rev. A , vol. 80, p. 052314, Nov 2009
2009
Cited alongside, same era.
M. V. den Nest, “Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond,” Quantum Inf. Comput. , vol. 10, no. 3&4, pp. 0258–0271, 2010
2010
Cited alongside, same era.
M. P. da Silva, O. Landon-Cardinal, and D. Poulin, “Practical characterization of quantum devices without tomography,” Phys. Rev. Lett. , vol. 107, no. 21, nov 2011
2011
Cited alongside, same era.
K. Banaszek, M. Cramer, and D. Gross, “Focus on quantum tomography,” New J. Phys. , vol. 15, no. 12, p. 125020, dec 2013
2013
Cited alongside, same era.
V. Kliuchnikov, D. Maslov, and M. Mosca, “Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T T gates,” Quantum Inf. Comput. , vol. 13, no. 7–8, pp. 607–630, 2013
2013
Cited alongside, same era.
P. Selinger, “Quantum circuits of t t -depth one,” Phys. Rev. A , vol. 87, p. 042302, Apr 2013
2013
Cited alongside, same era.
2018
Later among the works it cites.
A. Rocchetto, “Stabiliser states are efficiently PAC-learnable,” Quant. Inf. Comput. , vol. 18, no. 7&8, pp. 541–552, 2018
2018
Later among the works it cites.
D. Maslov and M. Roetteler, “Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations,” IEEE Trans. Inf. Theory , vol. 64, no. 7, pp. 4729–4738, July 2018
2018
Later among the works it cites.
A. Rocchetto, S. Aaronson, S. Severini, G. Carvacho, D. Poderini, I. Agresti, M. Bentivegna, and F. Sciarrino, “Experimental learning of quantum states,” Sci. Adv. , vol. 5, no. 3, p. eaau1946, mar 2019
2019
Later among the works it cites.
J. Miyazaki, A. Soeda, and M. Murao, “Complex conjugation supermap of unitary quantum maps and its universal implementation protocol,” Phys. Rev. Res. , vol. 1, p. 013007, Aug 2019
2019
Later among the works it cites.
P. Rall, D. Liang, J. Cook, and W. Kretschmer, “Simulation of qubit quantum circuits via pauli propagation,” Phys. Rev. A , vol. 99, p. 062337, Jun 2019
2019
Later among the works it cites.
K.-Y. Kuo and C.-Y. Lai, “The encoding and decoding complexities of entanglement-assisted quantum stabilizer codes,” in Proc. IEEE Int. Symp. Inf. Theory , 2019, pp. 2893–2897
2019
Later among the works it cites.
S. Aaronson, “Shadow tomography of quantum states,” SIAM J. Comput. , vol. 49, no. 5, pp. STOC18–368–STOC18–394, Jan 2020
2020
Later among the works it cites.
Matthias C. Caro and Ishaun Datta, “Pseudo-dimension of quantum circuits,” Quantum Mach. Intell. vol 2, no. 14, 2020
2020
Later among the works it cites.
Y.-C. Zheng, C.-Y. Lai, T. A. Brun, and L.-C. Kwek, “Constant depth fault-tolerant Clifford circuits for multi-qubit large block codes,” Quantum Sci. Tech. , vol. 5, p. 045007, 2020
2020
Later among the works it cites.
N.-H. Chia, K.-M. Chung, and C.-Y. Lai, “On the Need of Large Quantum Depth,” in Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020) , June 2020, p. 902–915
2020
Later among the works it cites.
M. Coudron and S. Menda, “ Computations with greater quantum depth are strictly more powerful (relative to an oracle),” in Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020) , June 2020, pp. 889–901
2020
Later among the works it cites.