Fetching the paper…
Reading the bibliography…
In superconducting architectures, limited connectivity remains a significant challenge for the synthesis and compilation of quantum circuits.
Factorization of symmetric matrices and trace-orthogonal bases in finite fields
Gadiel Seroussi and Abraham Lempel · 1980
Earlier work this paper cites.
An optimal sorting algorithm for mesh connected computers
C P Schnorr and A Shamir · 1986
Earlier work this paper cites.
Triangularizing matrices over gf(2) by congruence
J. D. Botha · 1997
Earlier work this paper cites.
An introduction to measurement based quantum computation, 2005
Richard Jozsa · 2005
Earlier work this paper cites.
Computation at a distance, 2007
Samuel A. Kutin, David Petrie Moulton, and Lawren M. Smithline · 2007
Earlier work this paper cites.
Local unitary versus local clifford equivalence of stabilizer and graph states
Bei Zeng, Hyeyoun Chung, Andrew W. Cross, and Isaac L. Chuang · 2007
Earlier work this paper cites.
On the minimum rank of a graph over finite fields, 2010
Shmuel Friedland and Raphael Loewy · 2010
Earlier work this paper cites.
Interacting quantum observables: categorical algebra and diagrammatics
Bob Coecke and Ross Duncan · 2011
Cited alongside, same era.
Use of global interactions in efficient quantum circuit constructions
Dmitri Maslov and Yunseong Nam · 2018
Cited alongside, same era.
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Daniel Litinski · 2019
Cited alongside, same era.
Constructing quantum circuits with global gates
John van de Wetering · 2021
Cited alongside, same era.
Quantum circuits assisted by local operations and classical communication: Transformations and phases of matter
Lorenzo Piroli, Georgios Styliaris, and J. Ignacio Cirac · 2021
Cited alongside, same era.
Decomposition of clifford gates
Tefjol Pllaha, Kalle Volanto, and Olav Tirkkonen · 2021
Cited alongside, same era.
Surface code compilation via edge-disjoint paths
Michael Beverland, Vadym Kliuchnikov, and Eddie Schoute · 2022
Later among the works it cites.
Quantum routing with teleportation, 2022
Dhruv Devulapalli, Eddie Schoute, Aniruddha Bapat, Andrew M. Childs, and Alexey V. Gorshkov · 2022
Later among the works it cites.
Constant-cost implementations of clifford operations and multiply-controlled gates using global interactions
Sergey Bravyi, Dmitri Maslov, and Yunseong Nam · 2022
Later among the works it cites.
Depth optimization of cz, cnot, and clifford circuits
Dmitri Maslov and Ben Zindorf · 2022
Later among the works it cites.
Advantages and limitations of quantum routing
Aniruddha Bapat, Andrew M. Childs, Alexey V. Gorshkov, and Eddie Schoute · 2023
Closest in time.
Deterministic constant-depth preparation of the aklt state on a quantum processor using fusion measurements, 2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hadamard-free circuits expose the structure of the clifford group
Sergey Bravyi and Dmitri Maslov · 2021
Cited alongside, same era.
Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis
Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, and Jialin Zhang
Cited in the paper.
Kevin C. Smith, Eleanor Crane, Nathan Wiebe, and S. M. Girvin · 2023
Closest in time.
Cnot circuits need little help to implement arbitrary hadamard-free clifford transformations they generate, 2023
Dmitri Maslov and Willers Yang · 2023
Closest in time.