aiqbench takeQuantum Computing

The paper tightens the CNOT cost of qubit-permutation circuits on constrained hardware from 6d-3 to at most 6d-4, where d is the graph distance. The gain is a single gate, but it is a provable bound that also covers optimal SWAP routing. The AI component is a search tool used alongside formal proofs, so readers should judge the result by its mathematics rather than the AI framing.

Source coveringQuantum Zeitgeist

Researchers Bound Qubit Costs for Permutations with Fewer Gates

Quantum ZeitgeistOctober 30, 20264 min read

Can complex quantum computations be achieved with fewer connections than previously thought? A new method reduces required CNOT gates from $6d-3 to at most 6d-4$, improving upon standard construction methods for constrained qubit connectivity, and even subsumes optimal SWAP routing within its approach. This demonstrates how artificial intelligence isn’t just optimising circuits, it's uncovering fundamental principles of their design.

Quantum computers face challenges compiling complex operations due to limited connections between qubits; this can sharply increase the resources needed for calculations. A method called “Global Transpositions” efficiently rearranges qubit states using fewer control gates. This approach uses artificial intelligence alongside provable constructions to optimise circuits under connectivity constraints, improving upon standard methods based on swapping qubit positions. The team discovered a new way to arrange qubits, the basic building…

Excerpt shown under the publisher's RSS terms · 70 words · full text and figures are on the publisher's site

Read at Quantum Zeitgeist ↗Ask about this article