The Combination Problem for Relational Quantum Mechanics
- URL: http://arxiv.org/abs/2401.15790v1
- Date: Sun, 28 Jan 2024 22:40:16 GMT
- Title: The Combination Problem for Relational Quantum Mechanics
- Authors: Emily Adlam
- Abstract summary: I consider various proposed solutions to the panpsychist problem, assessing the prospects for a similar solution in the context of RQM.
I argue that overall the prospects for solving RQM's combination problem look better for RQM with cross-perspective links than for orthodox versions of RQM.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This article uses the existing literature on the panpsychist combination
problem as a starting point to think about how to address a structurally
similar combination problem in relational quantum mechanics. I note some
similarities and differences between the two problems, and I consider various
proposed solutions to the panpsychist problem, assessing the prospects for a
similar solution in the context of RQM. I argue that overall the prospects for
solving RQM's combination problem look better for RQM with cross-perspective
links than for orthodox versions of RQM.
Related papers
- A QUBO Formulation for the Generalized LinkedIn Queens Game [49.1574468325115]
We present a QUBO formulation designed to solve a series of generalisations of the LinkedIn queens game.
We adapt this formulation for several particular cases of the problem by trying to optimise the number of variables and interactions.
We also present two new types of problems, the Coloured Chess Piece Problem and the Max Chess Pieces Problem, with their corresponding QUBO formulations.
arXiv Detail & Related papers (2024-10-08T23:54:54Z) - Quantum Computational Complexity and Symmetry [3.9134031118910264]
Testing the symmetries of quantum states and channels provides a way to assess their usefulness.
We prove that various symmetry-testing problems are complete for BQP, QMA, QSZK, QIP(2), QIP_EB(2), and QIP.
We also prove the inclusion of two Hamiltonian symmetry-testing problems in QMA and QAM.
arXiv Detail & Related papers (2023-09-18T18:48:44Z) - Matching Game for Optimized Association in Quantum Communication
Networks [65.16483325184237]
This paper proposes a swap-stable request-QS association algorithm for quantum switches.
It achieves a near-optimal (within 5%) performance in terms of the percentage of served requests.
It is shown to be scalable and maintain its near-optimal performance even when the size of the QCN increases.
arXiv Detail & Related papers (2023-05-22T03:39:18Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks.
Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture.
We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
arXiv Detail & Related papers (2023-04-14T08:03:20Z) - Can a Bohmian be a Rovellian for all practical purposes? [0.0]
We first show that the mathematical formalism of RQM is immune to recent critics concerning consistency.
We also analyse the notion of interaction in RQM and provide a For All Practical Purposes (FAPP) reading of RQM comparing it with Bohmian mechanics.
arXiv Detail & Related papers (2023-02-21T11:00:56Z) - The Relational Dissolution of the Quantum Measurement Problems [0.0]
The Quantum Measurement Problem is arguably one of the most debated issues in the philosophy of Quantum Mechanics.
It represents not only a technical difficulty for the standard formulation of the theory, but also a source of interpretational disputes concerning the meaning of the quantum postulates.
arXiv Detail & Related papers (2022-11-15T19:33:59Z) - Randomness in Relational Quantum Mechanics [0.0]
relational interpretation of quantum mechanics (RQM) introduced in its present form by Carlo Rovelli in 1996.
RQM assumes that all objects in the universe are quantum objects, regardless of their material complexity.
concept of randomness associated with quantum state variables in RQM differs from that in other QM interpretations.
arXiv Detail & Related papers (2022-05-17T14:27:27Z) - Open Problems Related to Quantum Query Complexity [4.467248776406005]
I offer a case that quantum query complexity still has loads of enticing and fundamental open problems.
I offer a case that quantum query complexity still has loads of enticing and fundamental open problems.
arXiv Detail & Related papers (2021-09-14T18:36:15Z) - Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP)
This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm.
Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
arXiv Detail & Related papers (2021-05-06T17:59:38Z) - Quantum-optimal-control-inspired ansatz for variational quantum
algorithms [105.54048699217668]
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form.
Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries.
This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
arXiv Detail & Related papers (2020-08-03T18:00:05Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.