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
Continuous-time quantum walks (CTQWs) on dynamic graphs realize quantum gates as sequences of time-evolving graph Hamiltonians, but naive constructions produce long sequences with redundancy. Simplification rules, which are graph rewrite rules that shorten a dynamic graph sequence while preserving the unitary it implem...
Mostafa Atallah, D. Dilley, Jishnu Mahmud et al.· 0 citations
Simulating a continuous-time quantum walk (CTQW) on a graph in the circuit model of quantum computing requires decomposing its Hamiltonian into terms that can be Trotterized into hardware-native gates. We consider two such decompositions: the standard Pauli decomposition and the recently introduced matching decompositi...
