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

Springer eBooks

Mesoscopic Route to Time Travel

P. Singha Deo

Published Jan 1, 2021• 5 citations
Publisher
DOI
10.1007/978-981-16-4465-8

Related papers

Time Travel: A Reality in Mesoscopic Physics

P. Singha Deo, Kanchan Meena

Springer eBooks•Jan 1, 2024•1 citation

Travelling Salesperson Problem with Quantum Computing

Bhanu Lalith Aakash Medury, Vyoma Harshitha Podapati

Combinatorial optimization problems involve find-ing an optimal solution from a finite set of feasible solutions.Dynamic Programming attempts to solve a combinatorial prob-lem by performing an exhaustive search over the entire domain of the problem.In many such cases, this exhaustive search is not effective or tractable.Travelling salesperson problem is an important combinatorial optimization problem in which the salesperson is given N cities to travel with the condition that he has to travel each city exactly once and return to the origin.Among the finite set of feasible routes, the salesperson has to choose an optimal route with shortest total distance.The route can be optimal either by cost or by distance.The classical algorithm which attempts to find the shortest distance/cost to travel all the cities run in exponential time complexity.For small number of cities, the classical algorithm is effective and feasible but as the number of cities increase, the number of possible routes and the time required to compute them grows exponentially.However, addressing this problem by implementing quantum computing significantly reduces the time required to compute these routes.A quantum algorithm is required to run on a quantum computer to obtain meaningful results as quantum computers use Quantum Bits which differ from the bits used by a classical computer.A.

International Journal of Engineering Research and•Mar 12, 2020•1 citation

The Quantum Physics of Time Travel

David Deutsch, Michael Lockwood

Scientific American•Mar 1, 1994•95 citations

Evading quantum barrier to time travel

Ivars Peterson

Science News•Apr 11, 1998•0 citations

Optimization of Practical Time-Dependent Vehicle Routing Problem by Ising Machines

Yui Tsuyumine, Kenichi Masuda, Takeshi Hachikawa +5 more

The Vehicle Routing Problem (VRP) is an extension of the Travelling Salesperson Problem (TSP). A VRP determines the delivery sequence where multiple vehicles are available, delivery should be made to multiple points, and each point should be visited once. However, road conditions change depending on the time of day, and the time required to travel between two points changes accordingly. Unless these changes are considered, a calculated minimum cost is not realized in actual logistics. Aiming to apply the Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW), which is a VRP extension that counts changes in the time required to travel between two points depending on the time of day, to Ising machines including quantum annealers, this paper proposes an effective formulation to realize TDVRPTW, composed of several objective functions and constraints. Further, this paper compares and evaluates the results obtained by a physical Ising machine and confirms the validity of the formulation, thus verifying the applicability of the TDVRPTW to quantum computing.

International Conference on Consumer Electronics•Jan 6, 2024•6 citations

Adaptive Quantum-Classical Routing under Dynamic Traveler Preferences

syed Saad Anwar

Quantum optimization algorithms for the Traveling Salesperson and Vehicle Routing Problems overwhelmingly treat the problem as static: constraints, demands, and objectives are fixed before the solver runs and never revisited. The one adaptive strand of prior work, Quantum Reinforcement Learning for VRP, responds to changes in the external environment, such as traffic or demand, but not to the traveler's own evolving priorities. This paper introduces a prototype system that re-solves a small routing problem each time a simulated traveler's preferences shift, using a Bayesian model to represent the traveler's evolving priorities and the Quantum Approximate Optimization Algorithm (QAOA) to re-solve the routing subproblem on a quantum circuit simulator. We describe the architecture, report preliminary results on a 4-stop instance comparing QAOA against an exact classical baseline, and discuss the current limitations of penalty-based QUBO encodings for this problem class. We conclude with a concrete extension for future work: representing the traveler's decision-making as a branching tree of possible preference trajectories rather than a single linear path, which would allow the system to be evaluated for path-dependence, i.e. whether small early differences in a traveler's mood compound into substantially different final routes.

•Jul 27, 2026•0 citations
Combinatorial optimization problems involve find-ing an optimal solution from a finite set of feasible solutions.Dynamic Programming attempts to solve a combinatorial prob-lem by performing an exhaustive search over the entire domain of the problem.In many such cases, this exhaustive search is not effective or tractable.Travelling salesperson problem is an important combinatorial optimization problem in which the salesperson is given N cities to travel with the condition that he has to travel each city exactly once and return to the origin.Among the finite set of feasible routes, the salesperson has to choose an optimal route with shortest total distance.The route can be optimal either by cost or by distance.The classical algorithm which attempts to find the shortest distance/cost to travel all the cities run in exponential time complexity.For small number of cities, the classical algorithm is effective and feasible but as the number of cities increase, the number of possible routes and the time required to compute them grows exponentially.However, addressing this problem by implementing quantum computing significantly reduces the time required to compute these routes.A quantum algorithm is required to run on a quantum computer to obtain meaningful results as quantum computers use Quantum Bits which differ from the bits used by a classical computer.A.
The Vehicle Routing Problem (VRP) is an extension of the Travelling Salesperson Problem (TSP). A VRP determines the delivery sequence where multiple vehicles are available, delivery should be made to multiple points, and each point should be visited once. However, road conditions change depending on the time of day, and the time required to travel between two points changes accordingly. Unless these changes are considered, a calculated minimum cost is not realized in actual logistics. Aiming to apply the Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW), which is a VRP extension that counts changes in the time required to travel between two points depending on the time of day, to Ising machines including quantum annealers, this paper proposes an effective formulation to realize TDVRPTW, composed of several objective functions and constraints. Further, this paper compares and evaluates the results obtained by a physical Ising machine and confirms the validity of the formulation, thus verifying the applicability of the TDVRPTW to quantum computing.
Quantum optimization algorithms for the Traveling Salesperson and Vehicle Routing Problems overwhelmingly treat the problem as static: constraints, demands, and objectives are fixed before the solver runs and never revisited. The one adaptive strand of prior work, Quantum Reinforcement Learning for VRP, responds to changes in the external environment, such as traffic or demand, but not to the traveler's own evolving priorities. This paper introduces a prototype system that re-solves a small routing problem each time a simulated traveler's preferences shift, using a Bayesian model to represent the traveler's evolving priorities and the Quantum Approximate Optimization Algorithm (QAOA) to re-solve the routing subproblem on a quantum circuit simulator. We describe the architecture, report preliminary results on a 4-stop instance comparing QAOA against an exact classical baseline, and discuss the current limitations of penalty-based QUBO encodings for this problem class. We conclude with a concrete extension for future work: representing the traveler's decision-making as a branching tree of possible preference trajectories rather than a single linear path, which would allow the system to be evaluated for path-dependence, i.e. whether small early differences in a traveler's mood compound into substantially different final routes.