REVIEW 2 cited by
Simulating the flight gate assignment problem on a trapped ion quantum computer
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We study the flight gate assignment problem on IonQ's Aria trapped ion quantum computer using the variational quantum eigensolver. Utilizing the conditional value at risk as an aggregation function, we demonstrate that current trapped ion quantum hardware is able to obtain good solutions for this combinatorial optimization problem with high probability. In particular, we run the full variational quantum eigensolver for small instances and we perform inference runs for larger systems, demonstrating that current and near-future quantum hardware is suitable for addressing combinatorial optimization problems.
Forward citations
Cited by 2 Pith papers
-
Resource-Efficient Quantum Optimization via Higher-Order Encoding
HUBO encodings reduce qubit counts from n*m to n*ceil(log2 m) and cut CNOT counts by 89.6-100% in QAOA benchmarks on gate assignment, max k-colorable subgraph, and integer programming instances.
-
Optimizing QUBO on a quantum computer by mimicking imaginary time evolution
ITEMC iteratively mimics imaginary time evolution to solve QUBO instances, achieving high CVaR-based approximation ratios in simulation and finding the best known solution on IBM hardware for up to 80 qubits.
Discussion (0). Continue with ORCID to comment.