Quantum Computing Algorithms and Architecture
External reference: https://openalex.org/T10682
- Review identifies encoding and selection as key QGA steps
- Hardware-efficient Mølmer–Sørensen gate performs comparably on superconducting hardware
- Multilayer superconducting hardware can place and route qLDPC codes
- Holonomic adiabatic gates for scalable quantum computation
- Quantum embeddings can link small-scale quantum data to biomolecular free energies
-
Noisy quantum circuits can behave like shallow circuits Theoretical analysis of how local noise restricts quantum circuits to shallow depths and prevents barren plateaus, enabling efficient classical simulation of observable expectation value estimation.
-
Communication settings can be translated in delegated quantum computing Unified framework for delegated quantum computing shows that prepare-and-send and receive-and-measure protocols are interchangeable, removing fundamental constraints on distributed quantum computing.
-
Non-Gaussian measurements enable near-optimal coherent state discrimination Study demonstrates that non-Gaussian continuous quantum measurements can achieve near-optimal coherent state discrimination, surpassing traditional Gaussian limits without requiring photon detection.
-
Quantum data centres may support scalable quantum networking Quantum data centres overcome NISQ limitations through distributed quantum computing, leveraging entanglement orchestrators for dynamic network reconfiguration toward large-scale quantum internet.