While distributed quantum computation has primarily utilized circuit cutting, it incurs an exponential growth of sub‐circuit sampling and classical post‐processing overhead with an increasing number of cuts. In contrast, entanglement‐based gate teleportation avoids exponential sampling overhead but requires high‐fideli...
Shobhit Gupta, D. Dilley, Nikolay Sheshko et al.· Advanced Quantum Technologie...· 3 citations
We derive a universal upper bound on the speed of multipartite entanglement generation. For arbitrary differentiable pure multipartite states undergoing parameter-dependent evolution, we prove that the rate of change of generalized concurrence is bounded by the square root of the quantum Fisher information (QFI). The p...
Zain Saleem, Da-Wei Luo, Anjala M. Babu et al.· 0 citations
This work introduces distributed heterogeneous-distance lattice surgery using an eight-data-patch ancilla-mediated (8-DAM) architecture, which will be useful for near-term quantum devices with less qubit overhead and supports selective ancilla enlargement as a resource-efficient approach to fault-tolerant distributed q...
D. Dilley, Anastashia Jebraeilli, Rayat Roy et al.· 0 citations
This work gives CTQW realizations of the standard single-qubit gates and introduces new graph rewrite rules, which are graph rewrite rules that shorten a dynamic graph sequence while preserving the unitary it implements.
Mostafa Atallah, D. Dilley, Jishnu Mahmud et al.· 0 citations
This work trains machine learning models to predict, for a given graph, which of the two decompositions produces the smaller CX gate count, and uses the dominant signal from n_Pauli, a property of the Hamiltonian decomposition rather than an intrinsic property of the graph.
