On the 90th anniversary of the Lebedev Physics Institute of the Russian Academy of Sciences (LPI). Physics of our days
Computable and noncomputable in the quantum domain: statements and conjectures
A.K. Fedorov†a,b,c,
E.O. Kiktenko‡b,c,
N.N. Kolachevsky§a,c aLebedev Physical Institute, Russian Academy of Sciences, Leninsky prosp. 53, Moscow, 119991, Russian Federation bNational University of Science and Technology "MISIS", Leninskii prosp. 4, Moscow, 119049, Russian Federation cInternational Center for Quantum Optics and Quantum Technologies (the Russian Quantum Center), Skolkovo Innovation Center, Bolshoi Boulevard, Building 30, Block 1, 3rd floor, sectors G3, G7, Moscow, Moscow Region, 121205, Russian Federation
Significant advances in the development of computing devices based on quantum effects and the demonstration of their use to solve various problems have rekindled interest in the nature of the "quantum computational advantage." Although various attempts to quantify and characterize the nature of the quantum computational advantage have previously been made, this question largely remains open. Indeed, there is no universal approach that allows determining the scope of problems whose solution can be accelerated by quantum computers, in theory of in practice. In this paper, we consider an approach to this question based on the concept of complexity and reachability of quantum states. On the one hand, the class of quantum states that are of interest for quantum computing must be complex, i.e., not amenable to simulation by classical computers with less than exponential resources. On the other hand, such quantum states must be reachable on a practically feasible quantum computer. This means that the unitary operation that transforms the initial quantum state into the desired one must be decomposable into a sequence of one- and two-qubit gates of a length that is at most polynomial in the number of qubits. By formulating several statements and conjectures, we discuss the question of describing a class of problems whose solution can be accelerated by a quantum computer.
Keywords: quantum computing, quantum complexity, quantum algorithms PACS:03.67.Ac, 03.67.Lx, 42.50.Dv (all) DOI:10.3367/UFNe.2024.07.039721 URL: https://ufn.ru/en/articles/2024/9/f/ Citation: Fedorov A K, Kiktenko E O, Kolachevsky N N "Computable and noncomputable in the quantum domain: statements and conjectures" Phys. Usp.67 906–911 (2024)
Preskill J "Quantum computing and the entanglement frontier" arXiv:1203.5813
Ladd T D, Jelezko F, Laflamme R, Nakamura Y, Monroe C, O’Brien J L Nature464 45 (2010)
Gottesman D "The Heisenberg representation of quantum computers" quant-ph/9807006; Gottesman D Group 22: Proc. of the 12th Intern. Colloquium on Group Theoretical Methods in Physics (Eds S P Corney, R Delbourgo, P D Jarvis) (Cambridge, MA: Intern. Press, 1999) p. 32
Nielsen M A, Chuang I L Quantum Computation And Quantum Information (Cambridge: Cambridge Univ. Press, 2000)
Fedorov A K, Akimov A V, Biamonte J D, Kavokin A V, Khalili F Ya, Kiktenko E O, Kolachevsky N N, Kurochkin Y V, Lvovsky A I, Rubtsov A N, Shlyapnikov G V, Straupe S S, Ustinov A V, Zheltikov A M Quantum Sci. Technol.4 040501 (2019)
Aksenov M A, Zalivako I V, Semerikov I A, Borisenko A S, Semenin N V, Sidorov P L, Fedorov A K, Khabarova K Yu, Kolachevsky N N Phys. Rev.A107 052612 (2023)
Zalivako I V, Borisenko A S, Semerikov I A, Korolkov A E, Sidorov P L, Galstyan K P, Semenin N V, Smirnov V N, Aksenov M D, Fedorov A K, Khabarova K Yu, Kolachevsky N N Front. Quantum Sci. Technol.2 1228208 (2023)
Zalivako I V, Nikolaeva A S, Borisenko A S, Korolkov A E, Sidorov P L, Galstyan K P, Semenin N V, Smirnov V N, Aksenov M A, Makushin K M, Kiktenko E O, Fedorov A K, Semerikov I A, Khabarova K Yu, Kolachevsky N N "Towards multiqudit quantum processor based on a 171Yb+ ion string: Realizing basic quantum algorithms" arXiv:2402.03121
Kazmina A S, Zalivako I V, Borisenko A S, Nemkov N A, Nikolaeva A S, Simakov I A, Kuznetsova A V, Egorova E Yu, Galstyan K P, Semenin N V, Korolkov A E, Moskalenko I N, Abramov N N, Besedin I S, Kalacheva D A, Lubsanov V B, Bolgar A N, Kiktenko E O, Khabarova K Yu, Galda A, Semerikov I A, Kolachevsky N N, Maleeva N, Fedorov A K Phys. Rev.A109 032619 (2024)
Aharonov D, Gao X, Landau Z, Liu Y, Vazirani U; STOC 2023. Proc. of the 55th Annual ACM Symp. on Theory of Computing (Eds B Saha, R A Servedio) (New York: Association for Computing Machinery, 2023) p. 945-957
Sotnikov O M, Iakovlev I A, Kiktenko E O, Fedorov A K, Mazurenko V V "Achieving the volume-law entropy regime with random-sign Dicke states" arXiv:2404.15050