2000 character limit reached
QSweep: Pulse-Optimal Single-Qudit Synthesis
Published 15 Dec 2023 in quant-ph | (2312.09990v1)
Abstract: The synthesis of single-qudit unitaries has mainly been understudied, resulting in inflexible and non-optimal analytical solutions, as well as inefficient and impractical numerical solutions. To address this challenge, we introduce QSweep, a guided numerical synthesizer that produces pulse-optimal single-qudit decompositions for any subspace gateset, outperforming all prior solutions. When decomposing ququart gates, QSweep created circuits 4100x (up to 23500x) faster than QSearch with an average of 7.9 fewer pulses than analytical solutions, resulting in an overall 1.54x and 2.36x improvement in experimental single-qutrit and ququart gate fidelity as measured by randomized benchmarking.
- M. Ringbauer, M. Meth, L. Postler, R. Stricker, R. Blatt, P. Schindler, and T. Monz, “A universal qudit quantum processor with trapped ions,” Nature Physics, vol. 18, no. 9, pp. 1053–1057, 2022.
- M. Malik, M. Erhard, M. Huber, M. Krenn, R. Fickler, and A. Zeilinger, “Multi-photon entanglement in high dimensions,” Nature Photonics, vol. 10, no. 4, pp. 248–252, 2016.
- M. Reck, A. Zeilinger, H. J. Bernstein, and P. Bertani, “Experimental realization of any discrete unitary operator,” Physical review letters, vol. 73, no. 1, p. 58, 1994.
- B. Anderson, H. Sosa-Martinez, C. Riofrío, I. H. Deutsch, and P. S. Jessen, “Accurate and robust unitary transformations of a high-dimensional quantum system,” Physical review letters, vol. 114, no. 24, p. 240401, 2015.
- N. Goss, A. Morvan, B. Marinelli, B. K. Mitchell, L. B. Nguyen, R. K. Naik, L. Chen, C. Jünger, J. M. Kreikebaum, D. I. Santiago et al., “High-fidelity qutrit entangling gates for superconducting circuits,” Nature communications, vol. 13, no. 1, p. 7481, 2022.
- A. Morvan, V. Ramasesh, M. Blok, J. Kreikebaum, K. O’Brien, L. Chen, B. Mitchell, R. Naik, D. Santiago, and I. Siddiqi, “Qutrit randomized benchmarking,” Physical review letters, vol. 126, no. 21, p. 210504, 2021.
- E. Gustafson, “Noise improvements in quantum simulations of sqed using qutrits,” arXiv preprint arXiv:2201.04546, 2022.
- G. Bottrill, M. Pandey, and O. Di Matteo, “Exploring the potential of qutrits for quantum optimization of graph coloring,” arXiv preprint arXiv:2308.08050, 2023.
- S. Gröblacher, T. Jennewein, A. Vaziri, G. Weihs, and A. Zeilinger, “Experimental quantum cryptography with qutrits,” New Journal of Physics, vol. 8, no. 5, p. 75, 2006.
- P. Gokhale, J. M. Baker, C. Duckering, N. C. Brown, K. R. Brown, and F. T. Chong, “Asymptotic improvements to quantum circuits via qutrits,” in Proceedings of the 46th International Symposium on Computer Architecture, 2019, pp. 554–566.
- A. Litteken, L. M. Seifert, J. Chadwick, N. Nottingham, F. T. Chong, and J. M. Baker, “Qompress: Efficient compilation for ququarts exploiting partial and mixed radix operations for communication reduction,” in Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2, 2023, pp. 646–659.
- H. de Guise, O. Di Matteo, and L. L. Sánchez-Soto, “Simple factorization of unitary transformations,” Physical Review A, vol. 97, no. 2, p. 022328, 2018.
- M. G. Davis, E. Smith, A. Tudor, K. Sen, I. Siddiqi, and C. Iancu, “Towards optimal topology aware quantum circuit synthesis,” in 2020 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, 2020, pp. 223–234.
- I. Bengtsson and K. Zyczkowski, “On discrete structures in finite hilbert spaces,” arXiv preprint arXiv:1701.07902, 2017.
- E. Knill, D. Leibfried, R. Reichle, J. Britton, R. B. Blakestad, J. D. Jost, C. Langer, R. Ozeri, S. Seidelin, and D. J. Wineland, “Randomized benchmarking of quantum gates,” Phys. Rev. A, vol. 77, p. 012307, Jan 2008. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.77.012307
- P. Liu, R. Wang, J.-N. Zhang, Y. Zhang, X. Cai, H. Xu, Z. Li, J. Han, X. Li, G. Xue, W. Liu, L. You, Y. Jin, and H. Yu, “Performing SU(d)SU𝑑\mathrm{SU}(d)roman_SU ( italic_d ) operations and rudimentary algorithms in a superconducting transmon qudit for d=3𝑑3d=3italic_d = 3 and d=4𝑑4d=4italic_d = 4,” Phys. Rev. X, vol. 13, p. 021028, May 2023. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevX.13.021028
- P. Dita, “Factorization of unitary matrices,” Journal of Physics A: Mathematical and General, vol. 36, no. 11, p. 2781, 2003.
- W. R. Clements, P. C. Humphreys, B. J. Metcalf, W. S. Kolthammer, and I. A. Walmsley, “Optimal design for universal multiport interferometers,” Optica, vol. 3, no. 12, pp. 1460–1465, 2016.
- E. Younis, C. C. Iancu, W. Lavrijsen, M. Davis, E. Smith et al., “Berkeley quantum synthesis toolkit (bqskit) v1,” Lawrence Berkeley National Lab.(LBNL), Berkeley, CA (United States), Tech. Rep., 2021.
- C. Campbell, F. T. Chong, D. Dahl, P. Frederick, P. Goiporia, P. Gokhale, B. Hall, S. Issa, E. Jones, S. Lee et al., “Superstaq: Deep optimization of quantum programs,” arXiv preprint arXiv:2309.05157, 2023.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.