Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2204.02768

Quantum Computers, Predictability, and Free Will

Gil Kalai

Published Apr 5, 2022• 0 citations
arXivHTMLPDF

Abstract

This article focuses on the connection between the possibility of quantum computers, the predictability of complex quantum systems in nature, and the issue of free will.
DOI
10.48550/arxiv.2204.02768

Related papers

Quantum computational complexity from quantum information to black holes and back

Shira Chapman, Giuseppe Policastro

Abstract Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely different physical problem – that of information processing inside black holes. Quantum computational complexity was suggested as a new entry in the holographic dictionary, which extends the connection between geometry and information and resolves the puzzle of why black hole interiors keep growing for a very long time. In this pedagogical review, we present the geometric approach to complexity advocated by Nielsen and show how it can be used to define complexity for generic quantum systems; in particular, we focus on Gaussian states in QFT, both pure and mixed, and on certain classes of CFT states. We then present the conjectured relation to gravitational quantities within the holographic correspondence and discuss several examples in which different versions of the conjectures have been tested. We highlight the relation between complexity, chaos and scrambling in chaotic systems. We conclude with a discussion of open problems and future directions. This article was written for the special issue of EPJ-C Frontiers in Holographic Duality.

arXiv:2110.14672•The European Physical Journal C•Feb 1, 2022•127 citations

Quantum Physics, Action and Free Will: How Might Free Will be Possible in a Quantum Universe?

Robert J. Kane

De Gruyter eBooks•Aug 6, 2014•2 citations

Can Free Will Emerge from Determinism in Quantum Theory?

Gilles Brassard A, Paul Raymond-Robichaud

arXiv:1204.2128•Springer eBooks•Nov 21, 2012•38 citations

Quantum spatial search on planar networks

Przemysław Sadowski

This paper deals with the problem of the requirements for quantum systems that enable one to design efficient quantum algorithms. We rise the issue of the possibility to utilise the non-complete networks for algorithmic purposes. In particular we consider applications for the spatial search problems. We focus on showing that the asymptotic complexity widely discussed in the related work is not enough tool for determining the potential of the network. We provide an example of a network where the asymptotic complexity is the same for a variety of cases and yet it is not always possible to implement successful search procedure within the quantum walk scheme. The examples are based on an Apollonian network which models a variety of iteratively generated planar networks. The network is planar, exhibits linear growth of edges number, consists nodes of different degrees and has the small-world and scale-free properties. This motivates its analysis due to the simplicity in terms of connections density and potential for quantum phenomena due to the nodes diversity.

arXiv:1406.0339•Jun 2, 2014•2 citations

One-Dimensional Disordered Bosonic Systems

Chiara D’Errico, Marco G. Tarallo

Disorder is everywhere in nature and it has a fundamental impact on the behavior of many quantum systems. The presence of a small amount of disorder, in fact, can dramatically change the coherence and transport properties of a system. Despite the growing interest in this topic, a complete understanding of the issue is still missing. An open question, for example, is the description of the interplay of disorder and interactions, which has been predicted to give rise to exotic states of matter such as quantum glasses or many-body localization. In this review, we will present an overview of experimental observations with disordered quantum gases, focused on one-dimensional bosons, and we will connect them with theoretical predictions.

arXiv:2206.10961•Atoms•Dec 14, 2021•3 citations

Modeling a Quantum AI with Free Will Based on Artificial Self-Awareness

Seyed kazem Mousavi

•Sep 27, 2026•0 citations
Abstract Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely different physical problem – that of information processing inside black holes. Quantum computational complexity was suggested as a new entry in the holographic dictionary, which extends the connection between geometry and information and resolves the puzzle of why black hole interiors keep growing for a very long time. In this pedagogical review, we present the geometric approach to complexity advocated by Nielsen and show how it can be used to define complexity for generic quantum systems; in particular, we focus on Gaussian states in QFT, both pure and mixed, and on certain classes of CFT states. We then present the conjectured relation to gravitational quantities within the holographic correspondence and discuss several examples in which different versions of the conjectures have been tested. We highlight the relation between complexity, chaos and scrambling in chaotic systems. We conclude with a discussion of open problems and future directions. This article was written for the special issue of EPJ-C Frontiers in Holographic Duality.
This paper deals with the problem of the requirements for quantum systems that enable one to design efficient quantum algorithms. We rise the issue of the possibility to utilise the non-complete networks for algorithmic purposes. In particular we consider applications for the spatial search problems. We focus on showing that the asymptotic complexity widely discussed in the related work is not enough tool for determining the potential of the network. We provide an example of a network where the asymptotic complexity is the same for a variety of cases and yet it is not always possible to implement successful search procedure within the quantum walk scheme. The examples are based on an Apollonian network which models a variety of iteratively generated planar networks. The network is planar, exhibits linear growth of edges number, consists nodes of different degrees and has the small-world and scale-free properties. This motivates its analysis due to the simplicity in terms of connections density and potential for quantum phenomena due to the nodes diversity.
Disorder is everywhere in nature and it has a fundamental impact on the behavior of many quantum systems. The presence of a small amount of disorder, in fact, can dramatically change the coherence and transport properties of a system. Despite the growing interest in this topic, a complete understanding of the issue is still missing. An open question, for example, is the description of the interplay of disorder and interactions, which has been predicted to give rise to exotic states of matter such as quantum glasses or many-body localization. In this review, we will present an overview of experimental observations with disordered quantum gases, focused on one-dimensional bosons, and we will connect them with theoretical predictions.