Image de couverture de livre

Upper bounding the quantum space complexity for computing class group and principal ideal problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Ng, Iu-Iong
Format:	Preprint
Publié:	2024
Sujets:	Quantum Physics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Recovering short generators via negative moments of Dirichlet $L$-functions
par: Ng, Iu-Iong, et autres
Publié: (2024)

Mean square of inverses of Dirichlet $L$-functions involving conductors
par: Ng, Iu-Iong, et autres
Publié: (2025)

Mitigating the sign problem by quantum computing
par: Ng, Kwai-Kong, et autres
Publié: (2025)

A lower bound on the space overhead of fault-tolerant quantum computation
par: Fawzi, Omar, et autres
Publié: (2022)

Sound certification of memory-bounded quantum computers
par: Nöller, Jan, et autres
Publié: (2024)

Solving the time-complexity problem and tuning the performance of quantum reservoir computing by artificial memory restriction
par: Čindrak, Saud, et autres
Publié: (2023)

Upper bounds on charging power and tangible advantage in quantum batteries
par: PG, Sreeram, et autres
Publié: (2025)

Rank lower bounds on non-local quantum computation
par: Asadi, Vahid R., et autres
Publié: (2024)

Classically computing performance bounds on depolarized quantum circuits
par: Mishra, Sattwik Deb, et autres
Publié: (2023)

Upper bound for the quantum coupling between free electrons and photons
par: Zhao, Zhexin
Publié: (2024)

Glassy word problems: ultraslow relaxation, Hilbert space jamming, and computational complexity
par: Balasubramanian, Shankar, et autres
Publié: (2023)

Testing the necessity of complex numbers in traditional quantum theory with quantum computers
par: Lancaster, Jarrett L., et autres
Publié: (2022)

A complexity theory for non-local quantum computation
par: Bluhm, Andreas, et autres
Publié: (2025)

Phase space tableau simulation for quantum computation
par: Ipek, Selman, et autres
Publié: (2025)

Tight bound for the total time in digital-analog quantum computation
par: Garcia-de-Andoin, Mikel, et autres
Publié: (2025)

Polynomial complexity of open quantum system problems
par: Chen, Chong, et autres
Publié: (2025)

Upper bounds for critical coupling constants for binding some quantum many-body systems
par: Tourbez, Clara, et autres
Publié: (2025)

Upper bounds on the purity of Wigner positive quantum states that verify the Wigner entropy conjecture
par: Qian, Qipeng, et autres
Publié: (2026)

Upper limit on the acceleration of a quantum evolution in projective Hilbert space
par: Alsing, Paul M., et autres
Publié: (2023)

Physical complexity and black hole quantum computers
par: Reilly, Michele, et autres
Publié: (2025)

Upper bounds on device-independent quantum key distribution rates and a revised Peres conjecture
par: Arnon, Rotem, et autres
Publié: (2020)

Lie groups for quantum complexity and barren plateau theory
par: de Alcântara, P. A. S., et autres
Publié: (2025)

Two classes of quantum spin systems that are gapped on any bounded-degree graph
par: Hunter-Jones, Nicholas, et autres
Publié: (2025)

The ideal wavelength for daylight free-space quantum key distribution
par: Abasifard, Mostafa, et autres
Publié: (2023)

Molecular resonance identification in complex absorbing potentials via integrated quantum computing and high-throughput computing
par: Dai, Jingcheng, et autres
Publié: (2025)

A simple lower bound for the complexity of estimating partition functions on a quantum computer
par: Chen, Zherui, et autres
Publié: (2024)

The measurement problem in liquid NMR quantum computers
par: Jalili, Omid, et autres
Publié: (2025)

The exact lower bound of CNOT-complexity for fault-tolerant quantum Fourier transform
par: Xia, Qiqing, et autres
Publié: (2024)

Simplification of tensor updates toward performance-complexity balanced quantum computer simulation
par: Yanagisawa, Koichi, et autres
Publié: (2024)

Drone delivery packing problem on a neutral-atom quantum computer
par: Tarquini, Sara, et autres
Publié: (2026)

Statistical phase-space complexity of continuous-variable quantum channels
par: Tang, Siting, et autres
Publié: (2025)

Phase-space complexity of discrete-variable quantum states and operations
par: Tang, Siting, et autres
Publié: (2026)

Phase-space negativity as a computational resource for quantum kernel methods
par: Chabaud, Ulysse, et autres
Publié: (2024)

Universal quantum computation with group surface codes
par: Manjunath, Naren, et autres
Publié: (2026)

On the generalized eigenvalue problem in subspace-based excited state methods for quantum computers
par: Kwao, Prince Frederick, et autres
Publié: (2025)

Experimental demonstration of quantum advantage in communication complexity for Euclidean distance problem
par: Yacoub, Verena, et autres
Publié: (2026)

Real and Fourier space readout methods: Comparison of complexity and applications to CFD problems
par: Huang, Xinchi, et autres
Publié: (2025)

Industry applications of neutral-atom quantum computing solving independent set problems
par: Wurtz, Jonathan, et autres
Publié: (2022)

Hybrid classical-quantum branch-and-bound algorithm for solving integer linear problems
par: Sanavio, Claudio, et autres
Publié: (2023)

Point-group symmetry analysis of many-electron wavefunctions on a quantum computer
par: Sakuma, Rei, et autres
Publié: (2026)