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

Quantum Formulation

Isamu Kusaka

Published Jan 1, 2015• 0 citations
Publisher
DOI
10.1007/978-3-319-13809-1_8

Related papers

Quantum perspective

Amanda Gefter

The New Scientist•Feb 1, 2022•2 citations

A comparative study of crew pairing optimization formulations: Preparing for quantum computing

Emily Stoebke, Thorsten Ehlers, Klaus Lütjens

Quantum computing is widely discussed for its potential to solve challenging optimization problems much faster. However, real-world airline problem sizes currently exceed the capabilities of existing quantum hardware. Preparing for larger quantum hardware requires developing and benchmarking problem formulations most suitable for quantum implementation. In this study, we use the crew pairing problem from aviation as an use case to benchmark different problem formulations: a set partitioning model and two compact formulations, a constrained flow assignment problem and a satisfiability problem (SAT). For classical benchmarking we solve these formulations using mixed integer programming and SAT solvers. For quantum benchmarking we translate the formulations into quadratic unconstrained binary optimization and Ising formulations. Our benchmarking shows that the problem formulations lead to different classical and quantum properties. Among the formulations considered, the SAT formulation emerges as the most promising candidate for future implementation on quantum hardware with the lowest share of non-zero elements and highest spectral gap, despite its larger ratio of linear term coefficients.

Transportation research procedia•Jan 1, 2026•0 citations

Quantum Implication

Leopoldo Román, Rita E. Zuazua

International Journal of Theoretical Physics•Mar 1, 1999•9 citations

Beyond QUBO and HOBO formulations, solving the Travelling Salesman Problem on a quantum boson sampler

Goldsmith, Daniel, Joe Day-Evans

The Travelling Salesman Problem (TSP) is an important combinatorial optimisation problem, and is usually solved on a quantum computer using a Quadratic Unconstrained Binary Optimisation (QUBO) formulation or a Higher Order Binary Optimisation(HOBO) formulation. In these formulations, penalty terms are added to the objective function for outputs that don't map to valid routes. We present a novel formulation which needs fewer binary variables, and where, by design, there are no penalty terms because all outputs from the quantum device are mapped to valid routes. Simulations of a quantum boson sampler were carried out which demonstrate that larger networks can be solved with this penalty-free formulation than with formulations with penalties. Simulations were successfully translated to hardware by running a non-QUBO formulation with penalties on an early experimental prototype ORCA PT-1 boson sampler. Although we worked with a boson sampler, we believe that this novel formulation is relevant to other quantum devices. This work shows that a good embedding for combinatorial optimisation problems can solve larger problems with the same quantum computing resource. The flexibility of boson sampling quantum devices is a powerful asset in solving combinatorial optimisation problem, because it enables formulations where the output string is always mapped to a valid solution, avoiding the need for penalties.

arXiv:2406.14252•Jun 20, 2024•9 citations

Quantum calculations

Alexei Kitaev

Physics-Uspekhi•Aug 31, 1996•1 citation

The general boundary formulation of quantum theory and its relevance for the problem of quantum gravity

Daniele Colosi, Luis Arturo Ureña-López, Hugo Aurelio Morales-Técotl +3 more

We present a non‐technical introduction to the general boundary formulation (GBF) of quantum theory. We emphasize the main motivation for the GBF: Formulating the quantum theory in way compatible with the principles of general relativity. We give an overview of the basic structures of the GBF, defining the notions of state space, amplitude, probability interpretation and expectation value of observables in the GBF. Finally, we briefly mention some of the results obtained so far and indicate future lines of research.

AIP conference proceedings•Jan 1, 2011•3 citations
Quantum computing is widely discussed for its potential to solve challenging optimization problems much faster. However, real-world airline problem sizes currently exceed the capabilities of existing quantum hardware. Preparing for larger quantum hardware requires developing and benchmarking problem formulations most suitable for quantum implementation. In this study, we use the crew pairing problem from aviation as an use case to benchmark different problem formulations: a set partitioning model and two compact formulations, a constrained flow assignment problem and a satisfiability problem (SAT). For classical benchmarking we solve these formulations using mixed integer programming and SAT solvers. For quantum benchmarking we translate the formulations into quadratic unconstrained binary optimization and Ising formulations. Our benchmarking shows that the problem formulations lead to different classical and quantum properties. Among the formulations considered, the SAT formulation emerges as the most promising candidate for future implementation on quantum hardware with the lowest share of non-zero elements and highest spectral gap, despite its larger ratio of linear term coefficients.
The Travelling Salesman Problem (TSP) is an important combinatorial optimisation problem, and is usually solved on a quantum computer using a Quadratic Unconstrained Binary Optimisation (QUBO) formulation or a Higher Order Binary Optimisation(HOBO) formulation. In these formulations, penalty terms are added to the objective function for outputs that don't map to valid routes. We present a novel formulation which needs fewer binary variables, and where, by design, there are no penalty terms because all outputs from the quantum device are mapped to valid routes. Simulations of a quantum boson sampler were carried out which demonstrate that larger networks can be solved with this penalty-free formulation than with formulations with penalties. Simulations were successfully translated to hardware by running a non-QUBO formulation with penalties on an early experimental prototype ORCA PT-1 boson sampler. Although we worked with a boson sampler, we believe that this novel formulation is relevant to other quantum devices. This work shows that a good embedding for combinatorial optimisation problems can solve larger problems with the same quantum computing resource. The flexibility of boson sampling quantum devices is a powerful asset in solving combinatorial optimisation problem, because it enables formulations where the output string is always mapped to a valid solution, avoiding the need for penalties.
We present a non‐technical introduction to the general boundary formulation (GBF) of quantum theory. We emphasize the main motivation for the GBF: Formulating the quantum theory in way compatible with the principles of general relativity. We give an overview of the basic structures of the GBF, defining the notions of state space, amplitude, probability interpretation and expectation value of observables in the GBF. Finally, we briefly mention some of the results obtained so far and indicate future lines of research.