Optimized Qubit Routing for Commuting Gates via Integer Programming | Paper Citation Record

Observation 14812dc6-f921-4055-b944-fddb8ea99b85 · outbound

This paper cites Quantum algorithms for quantum chemistry and quantum materials science.Chemical Reviews, 120(22):12685–12717, Octo- ber 2020.

Optimized Qubit Routing for Commuting Gates via Integer Programming Quantum algorithms for quantum chemistry and quantum materials science.Chemical Reviews, 120(22):12685–12717, Octo- ber 2020

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:32.055648Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a8537c82-7a01-4712-9b9c-b571c44a694b · outbound

This paper cites Quantum algorithm for alchemical optimization in material design.Chemical science, 12(12):4345–4352, 2021.

Optimized Qubit Routing for Commuting Gates via Integer Programming Quantum algorithm for alchemical optimization in material design.Chemical science, 12(12):4345–4352, 2021

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:44.832019Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 24e1b4e6-86d8-4b6b-b064-716016a36126 · outbound

This paper cites Cerezo, Guillaume Verdon, Hsin-Yuan Huang, Lukasz Cincio, and Patrick J.

Optimized Qubit Routing for Commuting Gates via Integer Programming Cerezo, Guillaume Verdon, Hsin-Yuan Huang, Lukasz Cincio, and Patrick J

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:44.639839Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 20036c14-ce6a-434b-93c9-e2b562d536eb · outbound

This paper cites Egger, Bruce G.

Optimized Qubit Routing for Commuting Gates via Integer Programming Egger, Bruce G

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:32.353696Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7fa1b263-2164-4fde-9a35-af455d40cdd5 · outbound

This paper cites Quantum computing in the nisq era and beyond.Quantum, 2:79, 2018.

Optimized Qubit Routing for Commuting Gates via Integer Programming Quantum computing in the nisq era and beyond.Quantum, 2:79, 2018

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:32.430465Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4b795bd9-a31a-43cb-a2df-55c202acbf14 · outbound

This paper cites Bishop, Oktay Günlük, and Petar Jurcevic.

Optimized Qubit Routing for Commuting Gates via Integer Programming Bishop, Oktay Günlük, and Petar Jurcevic

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:44.418757Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 70624166-117e-4999-af11-6aa12a57d204 · outbound

This paper cites Improving quantum computation by optimized qubit routing.

Optimized Qubit Routing for Commuting Gates via Integer Programming Improving quantum computation by optimized qubit routing

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:32.530177Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 461dee9d-44dd-4364-8ac0-ad815cf3739c · outbound

This paper cites Baker, Ali Javadi-Abhari, Frederic T.

Optimized Qubit Routing for Commuting Gates via Integer Programming Baker, Ali Javadi-Abhari, Frederic T

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:32.645481Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9036c324-9db3-4e0e-928c-5bad45bff988 · outbound

This paper cites Optimized noise suppression for quantum circuits.

Optimized Qubit Routing for Commuting Gates via Integer Programming Optimized noise suppression for quantum circuits

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:44.220769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 73aac7f8-d0b0-48d2-99f4-8229859a4338 · outbound

This paper cites Nielsen and Isaac L.

Optimized Qubit Routing for Commuting Gates via Integer Programming Nielsen and Isaac L

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:32.768244Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a3d2b813-1c8e-4fa7-a50b-ef7657d01a1a · outbound

This paper cites The solovay-kitaev algorithm.arXiv preprint quant- ph/0505030, 2005.

Optimized Qubit Routing for Commuting Gates via Integer Programming The solovay-kitaev algorithm.arXiv preprint quant- ph/0505030, 2005

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:32.852828Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9bb5b2fa-f2b7-48d6-b6d6-c3465646dde6 · outbound

This paper cites A Quantum Approximate Optimization Algorithm.

Optimized Qubit Routing for Commuting Gates via Integer Programming A Quantum Approximate Optimization Algorithm

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:32.918741Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e892f642-9fea-4afd-b6b6-32ef61fcbdfe · outbound

This paper cites Egger, David Ochsner, and Stefan Woerner.

Optimized Qubit Routing for Commuting Gates via Integer Programming Egger, David Ochsner, and Stefan Woerner

Reference 13

Resolution: verified exact; doi, observed 2026-08-06T17:06:37.189469Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation c4d80f8f-1e16-4c4b-b62d-e7073c911afb · outbound

This paper cites Quantum circuit synthesis and compilation optimization: Overview and prospects.

Optimized Qubit Routing for Commuting Gates via Integer Programming Quantum circuit synthesis and compilation optimization: Overview and prospects

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:33.054287Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2cbcbc7-8a38-4072-b4c2-daac13f2073e · outbound

This paper cites an unresolved cited work.

Optimized Qubit Routing for Commuting Gates via Integer Programming Unresolved cited work

Reference 15

Resolution: unresolved; raw_fallback, observed 2026-08-06T17:06:44.007536Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 91a8bf32-0881-4731-857d-317b9ff6a0c6 · outbound

This paper cites On the qubit routing problem.

Optimized Qubit Routing for Commuting Gates via Integer Programming On the qubit routing problem

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:33.211890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 74f6226c-ac49-419a-80a4-ac979c5f007e · outbound

This paper cites Tackling the qubit mapping problem for nisq-era quantum devices.

Optimized Qubit Routing for Commuting Gates via Integer Programming Tackling the qubit mapping problem for nisq-era quantum devices

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:43.777275Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation aa90bbf6-1359-4e0c-b41b-eec36a8ab6f2 · outbound

This paper cites t| ket>: a retargetable compiler for nisq devices.Quantum Science and Technology, 6(1):014003, 2020.

Optimized Qubit Routing for Commuting Gates via Integer Programming t| ket>: a retargetable compiler for nisq devices.Quantum Science and Technology, 6(1):014003, 2020

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:43.485204Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation c7b88c9b-349d-4189-923b-4bef3b75dc9e · outbound

This paper cites Compilation for dynamically field- programmable qubit arrays with efficient and provably near-optimal scheduling.

Optimized Qubit Routing for Commuting Gates via Integer Programming Compilation for dynamically field- programmable qubit arrays with efficient and provably near-optimal scheduling

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:43.200734Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 990e50fc-92c8-4ae7-b0af-d45da295a6cf · outbound

This paper cites HAQA: A Hardware-Guided and Fidelity-Aware Strategy for Efficient Qubit Mapping Optimization.

Optimized Qubit Routing for Commuting Gates via Integer Programming HAQA: A Hardware-Guided and Fidelity-Aware Strategy for Efficient Qubit Mapping Optimization

Reference 20

Resolution: verified exact; local_arxiv, observed 2026-08-06T17:06:37.993064Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation e1edbaf3-e291-42bc-ab30-e31fe0d2e9dd · outbound

This paper cites Optimality study of existing quantum computing layout synthesis tools.

Optimized Qubit Routing for Commuting Gates via Integer Programming Optimality study of existing quantum computing layout synthesis tools

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:43.003338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation dfaca747-860e-4169-a365-62ac26b83049 · outbound

This paper cites Mapping quantum circuits to ibm qx archi- tectures using the minimal number of swap and h operations.

Optimized Qubit Routing for Commuting Gates via Integer Programming Mapping quantum circuits to ibm qx archi- tectures using the minimal number of swap and h operations

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:42.861124Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation f0b8b40a-5c3c-4f1a-ae26-4c9c3cb13d14 · outbound

This paper cites Qubit mapping and routing via maxsat.

Optimized Qubit Routing for Commuting Gates via Integer Programming Qubit mapping and routing via maxsat

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:42.725022Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 963218e8-d08a-4bbd-b03a-d77e35d54502 · outbound

This paper cites Quantum circuit mapping based on incremental and parallel sat solving.

Optimized Qubit Routing for Commuting Gates via Integer Programming Quantum circuit mapping based on incremental and parallel sat solving

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:42.584408Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation bba96c2d-ec1a-4744-8e05-c3002696ad49 · outbound

This paper cites Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits.

Optimized Qubit Routing for Commuting Gates via Integer Programming Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits

Reference 25

Resolution: verified exact; local_arxiv, observed 2026-08-06T17:06:37.850884Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 9bba3a93-5ea2-4dfd-a508-fd16dfdf0634 · outbound

This paper cites Optimal layout-aware cnot circuit synthesis with qubit per- mutation.

Optimized Qubit Routing for Commuting Gates via Integer Programming Optimal layout-aware cnot circuit synthesis with qubit per- mutation

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:42.412084Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation f34db376-85aa-4696-aca6-8c38efebb4c1 · outbound

This paper cites Optimal layout synthesis for quantum computing.

Optimized Qubit Routing for Commuting Gates via Integer Programming Optimal layout synthesis for quantum computing

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:34.114756Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49ad81f4-2129-44da-9bdb-a052fb805714 · outbound

This paper cites Scalable optimal lay- out synthesis for nisq quantum processors.

Optimized Qubit Routing for Commuting Gates via Integer Programming Scalable optimal lay- out synthesis for nisq quantum processors

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:42.267368Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 2a13a14d-516a-4a55-86d9-b45e833d4dcf · outbound

This paper cites Valor, Julien Gacon, Caroline Tornow, Luciano Bello, Stefan Wo- erner, and Daniel J.

Optimized Qubit Routing for Commuting Gates via Integer Programming Valor, Julien Gacon, Caroline Tornow, Luciano Bello, Stefan Wo- erner, and Daniel J

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:34.271106Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 608413ed-87c5-4d8c-a0bd-485269e33e7e · outbound

This paper cites 2qan: Aquantumcompilerfor2-localqubithamiltoniansimulation algorithms.

Optimized Qubit Routing for Commuting Gates via Integer Programming 2qan: Aquantumcompilerfor2-localqubithamiltoniansimulation algorithms

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:42.121646Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation f0623bec-0d3f-4ed1-a426-cce3b9a22e85 · outbound

This paper cites A sat approach to the initial mapping problem in swap gate insertion for commuting gates.

Optimized Qubit Routing for Commuting Gates via Integer Programming A sat approach to the initial mapping problem in swap gate insertion for commuting gates

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:41.974695Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 0a85bc1d-1fe1-4289-9339-d7920c6852d2 · outbound

This paper cites Exploiting the regular structure of modern quantum architectures for compiling and optimizing programs with permutable operators.

Optimized Qubit Routing for Commuting Gates via Integer Programming Exploiting the regular structure of modern quantum architectures for compiling and optimizing programs with permutable operators

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:41.845932Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 58da8713-e038-4b55-a018-7f455a0a463d · outbound

This paper cites Improved Qubit Routing for QAOA Circuits.

Optimized Qubit Routing for Commuting Gates via Integer Programming Improved Qubit Routing for QAOA Circuits

Reference 33

Resolution: verified exact; local_arxiv, observed 2026-08-06T17:06:37.692921Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation aaa14d3d-71ae-4658-a7d8-c21823d5ab30 · outbound

This paper cites Assessing Quantum Layout Synthesis Tools via Known Optimal-SWAP Cost Benchmarks.

Optimized Qubit Routing for Commuting Gates via Integer Programming Assessing Quantum Layout Synthesis Tools via Known Optimal-SWAP Cost Benchmarks

Reference 34

Resolution: verified exact; local_arxiv, observed 2026-08-06T17:06:37.513908Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 5a05cab2-9666-403b-8ed4-9b2e622f45d2 · outbound

This paper cites Springer Publishing Company, Incorporated, 2008.

Optimized Qubit Routing for Commuting Gates via Integer Programming Springer Publishing Company, Incorporated, 2008

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:41.718779Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation d50e6b13-760e-4422-8579-b503abba5818 · outbound

This paper cites Algorithmic theory of qubit routing.

Optimized Qubit Routing for Commuting Gates via Integer Programming Algorithmic theory of qubit routing

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:34.888506Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ca6947ac-00ff-4f00-bb7c-0ce95313b963 · outbound

This paper cites Progress in mathematical programming solvers from 2001 to 2020.EURO Journal on Computational Optimization, 10:100031,.

Optimized Qubit Routing for Commuting Gates via Integer Programming Progress in mathematical programming solvers from 2001 to 2020.EURO Journal on Computational Optimization, 10:100031,

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:34.936562Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68ec9ff2-00f4-416b-9348-3bca2b32cc67 · outbound

This paper cites Dey, Thomas Kalinowski, Marco Molinaro, and Fabian Rigterink.

Optimized Qubit Routing for Commuting Gates via Integer Programming Dey, Thomas Kalinowski, Marco Molinaro, and Fabian Rigterink

Reference 38

Resolution: verified exact; doi, observed 2026-08-06T17:06:36.988526Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 65d2dbaf-feb7-4a28-966a-8f9e5853e204 · outbound

This paper cites an unresolved cited work.

Optimized Qubit Routing for Commuting Gates via Integer Programming Unresolved cited work

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:35.008814Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15dca737-b32c-4be2-ab05-8165c27c5188 · outbound

This paper cites Quantum approximate optimization of non-planar graph problems on a planar superconducting processor.Nature Physics, 17(3):332–336, 2021.

Optimized Qubit Routing for Commuting Gates via Integer Programming Quantum approximate optimization of non-planar graph problems on a planar superconducting processor.Nature Physics, 17(3):332–336, 2021

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:41.356579Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 2dd094fa-3342-4351-a57d-753361941a4b · outbound

This paper cites A new reformulation-linearization technique for bilinear programming problems.

Optimized Qubit Routing for Commuting Gates via Integer Programming A new reformulation-linearization technique for bilinear programming problems

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:41.526493Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation bb6f720c-d58f-4a2d-ada8-a5137b8ee6a9 · outbound

This paper cites Quantum computing with Qiskit.

Optimized Qubit Routing for Commuting Gates via Integer Programming Quantum computing with Qiskit

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:35.514574Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e03ada30-671f-4a6e-889e-5a728544a7e5 · outbound

This paper cites Topological and subsystem codes on low-degree graphs with flag qubits.Physical Review X, 10(1):011022, 2020.

Optimized Qubit Routing for Commuting Gates via Integer Programming Topological and subsystem codes on low-degree graphs with flag qubits.Physical Review X, 10(1):011022, 2020

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:41.189788Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 303ab02a-60bd-4825-96f6-02056f7f59a6 · outbound

This paper cites Springer Berlin Heidelberg, 2005.

Optimized Qubit Routing for Commuting Gates via Integer Programming Springer Berlin Heidelberg, 2005

Reference 44

Resolution: verified exact; doi, observed 2026-08-06T17:06:36.810724Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 8fc3f44c-4178-4be8-9774-2e2539a752fa · outbound

This paper cites Z3: An efficient smt solver.

Optimized Qubit Routing for Commuting Gates via Integer Programming Z3: An efficient smt solver

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:35.604308Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c082aa6b-57a3-42f4-9b7f-00f7f8e16249 · outbound

This paper cites Integer programming models.

Optimized Qubit Routing for Commuting Gates via Integer Programming Integer programming models

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:40.792722Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation b8927c3b-da66-4da1-abe6-4f31f7aab8dc · outbound

This paper cites John Wiley & Sons, 1998.

Optimized Qubit Routing for Commuting Gates via Integer Programming John Wiley & Sons, 1998

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:41.034314Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 4b449ddf-0991-4529-b507-968b6439ca5a · outbound

This paper cites The bipartite implication polytope: Con- ditional relations over multiple sets of binary variables.

Optimized Qubit Routing for Commuting Gates via Integer Programming The bipartite implication polytope: Con- ditional relations over multiple sets of binary variables

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:40.557946Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 3d90b0a6-5a28-42d2-9e0b-71fbe46c0702 · outbound

This paper cites if” direction holds by definition. For the “only if.

Optimized Qubit Routing for Commuting Gates via Integer Programming if” direction holds by definition. For the “only if

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:40.351944Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 66737553-19b0-403d-9ee0-9bca4cf1caa7 · outbound

This paper cites an unresolved cited work.

Optimized Qubit Routing for Commuting Gates via Integer Programming Unresolved cited work

Reference 51

Resolution: parse uncertain; raw_fallback, observed 2026-08-06T17:06:40.021340Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation a526a37d-6fa7-48ff-b7ae-649be38f49c2 · outbound

This paper cites an unresolved cited work.

Optimized Qubit Routing for Commuting Gates via Integer Programming Unresolved cited work

Reference 52

Resolution: unresolved; raw_fallback, observed 2026-08-06T17:06:39.728113Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 4c648394-1f0c-4fe0-8c6c-d59999e4bb88 · outbound

This paper cites We know thatσ maps v∗ 2 to a node in V (G′.

Optimized Qubit Routing for Commuting Gates via Integer Programming We know thatσ maps v∗ 2 to a node in V (G′

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:39.325835Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 6758add2-f699-4317-86e6-2fee72ef3841 · outbound

This paper cites exchange.

Optimized Qubit Routing for Commuting Gates via Integer Programming exchange

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:39.125882Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 22905979-52d3-401e-afdc-5f6d575efea7 · outbound

This paper cites an unresolved cited work.

Optimized Qubit Routing for Commuting Gates via Integer Programming Unresolved cited work

Reference 55

Resolution: unresolved; raw_fallback, observed 2026-08-06T17:06:38.943708Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 065b2b08-e59e-4257-90fc-26871763561f · outbound

This paper cites Thus, (i,j )∈E(G′.

Optimized Qubit Routing for Commuting Gates via Integer Programming Thus, (i,j )∈E(G′

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:38.787425Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 2dce029f-468c-490a-b661-21ef7d2525b5 · outbound

This paper cites Restrictingσ′ to the nodes ofˆG1, we obtain thatˆG2 is isomorphic to a subgraph ofˆG1 and thus alsoG2 is isomorphic to a subgraph ofG1.

Optimized Qubit Routing for Commuting Gates via Integer Programming Restrictingσ′ to the nodes ofˆG1, we obtain thatˆG2 is isomorphic to a subgraph ofˆG1 and thus alsoG2 is isomorphic to a subgraph ofG1

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:38.640092Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 05d55ce3-58d7-4ef0-a1f7-431aca42c7ab · outbound

This paper cites B.1 Linearization 1 The goal of this subsection is to derive a linear description ofP≤ pq.

Optimized Qubit Routing for Commuting Gates via Integer Programming B.1 Linearization 1 The goal of this subsection is to derive a linear description ofP≤ pq

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T17:06:38.491479Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

Observation 269e1d3a-b822-4bc5-9299-52fc563eaf36 · outbound

This paper cites an unresolved cited work.

Optimized Qubit Routing for Commuting Gates via Integer Programming Unresolved cited work

Reference 2022

Resolution: unresolved; no resolver link, observed 2026-08-06T17:06:32.300319Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers