Satoshi Yoshida

Higher-order quantum computing with known input states
Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits
Simulating the quantum switch with quantum circuits is computationally hard
Satoshi Yoshida - Analytical lower bound on query complexity for universal transformation of unitary operations
Can the quantum switch be deterministically simulated?
Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits
Multicopy quantum state teleportation with application to storage and retrieval of quantum programs

Publié avec Hugo Blox Builder — le générateur libre de site web gratuit permettant aux créateurs de s’épanouir.