Imagen de Portada

T Count as a Numerically Solvable Minimization Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Davis, Marc Grau, Younis, Ed, Weiden, Mathias, Choi, Hyeongrak, Englund, Dirk
Formato:	Preprint
Publicado:	2026
Materias:	Quantum Physics Emerging Technologies
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction
por: Bach, Bao, et al.
Publicado: (2025)

AlphaSyndrome: Tackling the Syndrome Measurement Circuit Scheduling Problem for QEC Codes
por: Liu, Yuhao, et al.
Publicado: (2026)

Programmable Quantum Matter: Heralding Large Cluster States in Driven Inhomogeneous Spin Ensembles
por: Anand, Pratyush, et al.
Publicado: (2025)

Fast Numerical Solver of Ising Optimization Problems via Pruning and Domain Selection
por: Li, Langyu, et al.
Publicado: (2023)

Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization
por: Russon, Brent, et al.
Publicado: (2026)

Quantum Optimization Methods for the Generalized Traveling Salesman Problem
por: Zorn, Maximilian, et al.
Publicado: (2026)

Solving the Turbine Balancing Problem using Quantum Annealing
por: Unterauer, Arnold, et al.
Publicado: (2024)

Approaches to Simultaneously Solving Variational Quantum Eigensolver Problems
por: Hutchings, Adam, et al.
Publicado: (2024)

Hybrid Quantum-Classical Optimisation of Traveling Salesperson Problem
por: Lytrosyngounis, Christos, et al.
Publicado: (2025)

Efficient Variational Quantum Algorithms for the Generalized Assignment Problem
por: Mastroianni, Carlo, et al.
Publicado: (2025)

Quantum Computing for Partition Function Estimation of a Markov Random Field in a Radar Anomaly Detection Problem
por: Presles, Timothe, et al.
Publicado: (2025)

An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem
por: Gherardi, Alessandro, et al.
Publicado: (2024)

Towards an Automatic Framework for Solving Optimization Problems with Quantum Computers
por: Volpe, Deborah, et al.
Publicado: (2024)

A Non-Variational Quantum Approach to the Job Shop Scheduling Problem
por: Lopez-Ruiz, Miguel Angel, et al.
Publicado: (2025)

Advanced Quantum Annealing Approach to Vehicle Routing Problems with Time Windows
por: Holliday, James B., et al.
Publicado: (2025)

Characterizing QUBO Reformulations of the Max-k-Cut Problem for Quantum Computing
por: Harkness, Adrian, et al.
Publicado: (2025)

A Predictive Approach for Selecting the Best Quantum Solver for an Optimization Problem
por: Volpe, Deborah, et al.
Publicado: (2024)

An Advanced Hybrid Quantum Tabu Search Approach to Vehicle Routing Problems
por: Holliday, James B., et al.
Publicado: (2025)

Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems
por: Onizawa, Naoya, et al.
Publicado: (2023)

Divide-et-impera Heuristic-based Randomized Search for the Qubit Routing Problem
por: Baioletti, Marco, et al.
Publicado: (2025)

Second-Order FALQON Parameter Transfer for the Max-Cut Problem on 3-Regular Graphs
por: Thomaz, Gabriel Fernandes, et al.
Publicado: (2026)

Benchmarking the ORCA PT-2 Boson Sampler using Minimum Dominating Set Problems
por: Park, Jessica, et al.
Publicado: (2026)

Solving Currency Arbitrage Problems using D-Wave Advantage2 Quantum Annealer
por: Mazzei, Lorenzo, et al.
Publicado: (2025)

Solving Distributed Flexible Job Shop Scheduling Problems in the Wool Textile Industry with Quantum Annealing
por: Toma, Lilia, et al.
Publicado: (2024)

Quantum Circuit Mapping for Universal and Scalable Computing in MZI-based Integrated Photonics
por: Kwon, Yong, et al.
Publicado: (2024)

Standalone FPGA-Based QAOA Emulator for Weighted-MaxCut on Embedded Devices
por: Choi, Seonghyun, et al.
Publicado: (2025)

Identifying Bottlenecks of NISQ-friendly HHL algorithms
por: Marfany, Marc Andreu, et al.
Publicado: (2024)

QAMNet: Fast and Efficient Optical QAM Neural Networks
por: Bacvanski, Marc Gong, et al.
Publicado: (2024)

A Quantum Genetic Algorithm Framework for the MaxCut Problem
por: Viana, Paulo A., et al.
Publicado: (2025)

Solving Larger Maximum Clique Problems Using Parallel Quantum Annealing
por: Pelofske, Elijah, et al.
Publicado: (2022)

Comparing Three Generations of D-Wave Quantum Annealers for Minor Embedded Combinatorial Optimization Problems
por: Pelofske, Elijah
Publicado: (2023)

Moveless: Minimizing Overhead on QCCDs via Versatile Execution and Low Excess Shuttling
por: Khan, Sahil, et al.
Publicado: (2025)

QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems
por: Osaba, Eneko, et al.
Publicado: (2024)

RF-Photonic Deep Learning Processor with Shannon-Limited Data Movement
por: Davis III, Ronald, et al.
Publicado: (2022)

Association between Prefrontal fNIRS signals during Cognitive tasks and College scholastic ability test (CSAT) scores: Analysis using a quantum annealing approach
por: Kim, Yeaju, et al.
Publicado: (2024)

Operational Framework for a Quantum Database
por: Rieger, Carla, et al.
Publicado: (2024)

Simon's Period Finding on a Quantum Annealer
por: Robertson, Reece, et al.
Publicado: (2025)

Towards a Dutch hybrid quantum/HPC infrastructure
por: Schüsler, Olaf, et al.
Publicado: (2024)

Tridiagonal matrix decomposition for Hamiltonian simulation on a quantum computer
por: Arseniev, Boris, et al.
Publicado: (2023)

Steiner Traveling Salesman Problem with Quantum Annealing
por: Ciacco, Alessia, et al.
Publicado: (2025)