activity
20172026
most citedQuantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor

469 citations · 922 across the 30 of their papers we have counts for

collaborators

33 papers

cs.NE2026

LLM-Driven Evolutionary Generation of Multi-Objective Bayesian Optimization Algorithms

Georgios Laskaris, Reuben Brasher, Niki van Stein +3

Designing effective multi-objective Bayesian optimization (MOBO) algorithms requires balancing many interdependent design choices whose optimal configuration is problem-dependent a…

physics.gen-ph2025

Non-Gravitational Acceleration in 3I ATLAS: Constraints on Exotic Volatile Outgassing in Interstellar Comets

Florian Neukart

The interstellar comet 3I/ATLAS displayed a small but statistically significant non-gravitational acceleration during its passage through the inner Solar System. Using a thermophys…

physics.gen-ph2025★ 4 cited

Information Wells and the Emergence of Primordial Black Holes in a Cyclic Quantum Universe

Florian Neukart, Eike Marx, Valerii Vinokur

Primordial black holes (PBHs) remain one of the most intriguing candidates for dark matter and a unique probe of physics at extreme curvatures. Here, we examine their formation in…

physics.gen-ph2025★ 9 cited

Extending the QMM Framework to the Strong and Weak Interactions

Florian Neukart, Eike Marx, Valerii Vinokur

We extend the Quantum Memory Matrix (QMM) framework, originally developed to reconcile quantum mechanics and general relativity by treating space-time as a dynamic information rese…

physics.gen-ph2025★ 12 cited

The Quantum Memory Matrix: A Unified Framework for the Black Hole Information Paradox

Florian Neukart, Reuben Brasher, Eike Marx

We present the Quantum Memory Matrix (QMM) hypothesis, which addresses the longstanding Black Hole Information Paradox rooted in the apparent conflict between Quantum Mechanics (QM…

quant-ph2025★ 19 cited

Tensor networks for quantum computing

Aleksandr Berezutskii, Minzhao Liu, Atithi Acharya +25

In the rapidly evolving field of quantum computing, tensor networks serve as an important tool due to their multifaceted utility. In this paper, we review the diverse applications…

physics.gen-ph2025

Reversible Imprinting and Retrieval of Quantum Information: Experimental Verification of the Quantum Memory Matrix Hypothesis

Florian Neukart, Eike Marx, Valerii Vinokur

We report the first end-to-end hardware-validated demonstration of a reversible Quantum Memory Matrix QMM imprint retrieval cycle. Using IBM Quantum back ends, we realize five impr…

physics.gen-ph2025

Thermodynamic-Complexity Duality: Embedding Computational Hardness as a Thermodynamic Coordinate

Florian Neukart, Valerii Vinokur

We propose a duality between thermodynamics and computational complexity, elevating the difficulty of a computational task to the status of a thermodynamic variable. By introducing…

gr-qc2024★ 3 cited

Geometry-Information Duality: Quantum Entanglement Contributions to Gravitational Dynamics

Florian Neukart

We propose a fundamental duality between the geometric properties of spacetime and the informational content of quantum fields. Specifically, we establish that the curvature of spa…

physics.gen-ph2024

Integrated Deflector Shield Technology for Spacecraft

Florian Neukart

The increasing velocity and frequency of space missions necessitate advancements in spacecraft protection technologies to ensure mission success and the safety of onboard systems a…

physics.gen-ph2024★ 1 cited

Toward the Stars: Technological, Ethical, and Sociopolitical Dimensions of Interstellar Exploration

Florian Neukart

The endeavor of interstellar exploration is a convergence of technical innovation and profound ethical inquiry, challenging humanity to extend its reach beyond the confines of our…

cs.IT2024

Thermodynamic Perspectives on Computational Complexity: Exploring the P vs. NP Problem

Florian Neukart

The resolution of the P vs. NP problem, a cornerstone in computational theory, remains elusive despite extensive exploration through mathematical logic and algorithmic theory. This…

quant-ph2023

Comparison between Tensor Networks and Variational Quantum Classifier

Georgios Laskaris, Artem A. Melnikov, Michael R. Perelshtein +3

The primary objective of this paper is to conduct a comparative analysis between two Machine Learning approaches: Tensor Networks (TN) and Variational Quantum Classifiers (VQC). Wh…

astro-ph.IM2023★ 56 cited

Towards Sustainable Horizons: A Comprehensive Blueprint for Mars Colonization

Florian Neukart

Establishing a human colony on Mars is one of the most ambitious endeavors of our time. This paper provides a comprehensive assessment of the challenges and solutions related to Ma…

physics.gen-ph2023

Magnetic Fusion Plasma Drive

Florian Neukart

In the evolving realm of space exploration, efficient propulsion methods are paramount to achieve interplanetary and possibly interstellar voyages. Traditional propulsion systems,…

quant-ph2022

Do we live in a [quantum] simulation? Constraints, observations, and experiments on the simulation hypothesis

Florian Neukart, Anders Indset, Markus Pflitsch +1

The question "What is real?" can be traced back to the shadows in Plato's cave. Two thousand years later, Rene Descartes lacked knowledge about arguing against an evil deceiver fee…

quant-ph2022

Quantum-Enhanced Selection Operators for Evolutionary Algorithms

David Von Dollen, Sheir Yarkoni, Daniel Weimer +2

Genetic algorithms have unique properties which are useful when applied to black box optimization. Using selection, crossover, and mutation operators, candidate solutions may be ob…

quant-ph2022★ 21 cited

Practical application-specific advantage through hybrid quantum computing

Michael Perelshtein, Asel Sagingalieva, Karan Pinto +7

Quantum computing promises to tackle technological and industrial problems insurmountable for classical computers. However, today's quantum computers still have limited demonstrabl…

quant-ph2021

Multi-car paint shop optimization with quantum annealing

Sheir Yarkoni, Alex Alekseyenko, Michael Streif +3

We present a generalization of the binary paint shop problem (BPSP) to tackle an automotive industry application, the multi-car paint shop (MCPS) problem. The objective of the opti…

cs.LG2021★ 6 cited

Quantum-Assisted Feature Selection for Vehicle Price Prediction Modeling

David Von Dollen, Florian Neukart, Daniel Weimer +1

Within machine learning model evaluation regimes, feature selection is a technique to reduce model complexity and improve model performance in regards to generalization, model fit,…

quant-ph2020★ 45 cited

Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm

Michael Streif, Sheir Yarkoni, Andrea Skolik +2

The binary paint shop problem (BPSP) is an APX-hard optimization problem of the automotive industry. In this work, we show how to use the Quantum Approximate Optimization Algorithm…

quant-ph2020★ 47 cited

Quantum Shuttle: Traffic Navigation with Quantum Computing

Sheir Yarkoni, Florian Neukart, Eliane Moreno Gomez Tagle +5

The Web Summit conference in Lisbon, Portugal, is one of the biggest technology conferences in Europe, attended by tens of thousands of people every year. The high influx of people…

quant-ph2020★ 10 cited

Semi-supervised time series classification method for quantum computing

Sheir Yarkoni, Andrii Kleshchonok, Yury Dzerin +2

In this paper we develop methods to solve two problems related to time series (TS) analysis using quantum computing: reconstruction and classification. We formulate the task of rec…

quant-ph2020★ 469 cited

Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor

Matthew P. Harrigan, Kevin J. Sung, Matthew Neeley +83

We demonstrate the application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algor…