Quantum Fourier Transform Partitioning in Data Center
Summary
The USPTO published patent application US20260099748A1 disclosing a method for distributed quantum Fourier transform (QFT) with reduced EPR pairs across multiple quantum processors in a datacenter. The invention by inventors Eneet Kaur and Reza Nejabati enables QFT computation to be partitioned across two or more quantum processors while using fewer entanglement resources and properly positioning qubits at completion without requiring swapping operations.
What changed
The USPTO published patent application US20260099748A1 on April 9, 2026, covering a technique for distributed quantum Fourier transform (QFT) partitioning across quantum processors. The invention reduces the number of EPR pairs required when running QFT(n) across multiple quantum processors by implementing qubit teleportation. The method ensures qubits are correctly positioned in reverse order among processors at circuit completion without additional swapping operations.
This patent publication provides intellectual property landscape information relevant to companies developing quantum computing systems, quantum networking infrastructure, and datacenter architectures. Technology companies and research institutions working on distributed quantum algorithms may want to review this filing to assess potential freedom-to-operate considerations for their own quantum computing implementations.
Archived snapshot
Apr 18, 2026GovPing captured this document from the original source. If the source has since changed or been removed, this is the text as it existed at that time.
QUANTUM FOURIER TRANSFORM (QFT) PARTITIONING AND TIMING IN A DATACENTER
Application US20260099748A1 Kind: A1 Apr 09, 2026
Inventors
Eneet Kaur, Reza Nejabati
Abstract
An example embodiment provides a technique for a distributed quantum Fourier transform (QFT) with reduced EPR pairs. The QFT may be run in a quantum datacenter between multiple data units, where embodiments run the QFT while using multiple resources. The technique implements a QFT(n) (a QFT with n qubits) on two quantum processors, and is extended to implement the QFT(n) on three or more quantum processors. At the culmination of the technique, the qubits are properly positioned (in reverse order) among the quantum processors to obviate swapping of the qubits at completion of the QFT circuit. The technique relies on teleportation of the qubits.
CPC Classifications
G06N 10/40
Filing Date
2024-10-28
Application No.
18928295
Related changes
Get daily alerts for USPTO Patent Applications - AI & Computing (G06N)
Daily digest delivered to your inbox.
Free. Unsubscribe anytime.
Source
About this page
Every important government, regulator, and court update from around the world. One place. Real-time. Free. Our mission
Source document text, dates, docket IDs, and authority are extracted directly from USPTO.
The summary, classification, recommended actions, deadlines, and penalty information are AI-generated from the original text and may contain errors. Always verify against the source document.
Classification
Who this affects
Taxonomy
Browse Categories
Get alerts for this source
We'll email you when USPTO Patent Applications - AI & Computing (G06N) publishes new changes.
Subscribed!
Optional. Filters your digest to exactly the updates that matter to you.