Computational complexity is a quantum information concept that recently has found applications in the holographic understanding of the black hole interior. We consider quantum computational complexity for n qubits using Nielsen's geometrical approach. In the definition of complexity there is a big amount of arbitrariness due to the choice of the penalty factors, which parametrizes the cost of the elementary computational gates. In order to reproduce desired features in holography, such as ergodicity and exponential maximal complexity for large number of qubits n, negative curvatures are required. With the simplest choice of penalties, this is achieved at the price of singular sectional curvatures in the large n limit. We investigate a choice of penalties in which we can obtain negative curvatures in a smooth way. We also analyze the relation between operator and state complexities, framing the discussion with the language of Riemannian submersions. This provides a direct relation between geodesics and curvatures in the unitaries and the states spaces, which we also exploit to give a closed-form expression for the metric on the states in terms of the one for the operators. Finally, we study conjugate points for a large number of qubits in the unitary space and we provide a strong indication that maximal complexity scales exponentially with the number of qubits in a certain regime of the penalties space.

Auzzi, R., Baiguera, S., De Luca, B., Legramandi, A., Nardelli, G., Zenoni, N., Geometry of quantum complexity, <<PHYSICAL REVIEW D>>, 2021; 103 (10): 1-28. [doi:10.1103/PhysRevD.103.106021] [https://hdl.handle.net/10807/185492]

Geometry of quantum complexity

Auzzi, Roberto;Nardelli, Giuseppe;Zenoni, Nicolo'
2021

Abstract

Computational complexity is a quantum information concept that recently has found applications in the holographic understanding of the black hole interior. We consider quantum computational complexity for n qubits using Nielsen's geometrical approach. In the definition of complexity there is a big amount of arbitrariness due to the choice of the penalty factors, which parametrizes the cost of the elementary computational gates. In order to reproduce desired features in holography, such as ergodicity and exponential maximal complexity for large number of qubits n, negative curvatures are required. With the simplest choice of penalties, this is achieved at the price of singular sectional curvatures in the large n limit. We investigate a choice of penalties in which we can obtain negative curvatures in a smooth way. We also analyze the relation between operator and state complexities, framing the discussion with the language of Riemannian submersions. This provides a direct relation between geodesics and curvatures in the unitaries and the states spaces, which we also exploit to give a closed-form expression for the metric on the states in terms of the one for the operators. Finally, we study conjugate points for a large number of qubits in the unitary space and we provide a strong indication that maximal complexity scales exponentially with the number of qubits in a certain regime of the penalties space.
2021
Inglese
Auzzi, R., Baiguera, S., De Luca, B., Legramandi, A., Nardelli, G., Zenoni, N., Geometry of quantum complexity, <<PHYSICAL REVIEW D>>, 2021; 103 (10): 1-28. [doi:10.1103/PhysRevD.103.106021] [https://hdl.handle.net/10807/185492]
File in questo prodotto:
File Dimensione Formato  
2011.07601v3.pdf

accesso aperto

Tipologia file ?: Postprint (versione finale dell’autore successiva alla peer-review)
Licenza: Non specificato
Dimensione 1.93 MB
Formato Adobe PDF
1.93 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10807/185492
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 26
  • ???jsp.display-item.citation.isi??? 27
social impact