arXiv subjects

Mustafa Mert Özyılmaz

Publications and source records attributed to Mustafa Mert Özyılmaz.

3 recordsLinked to original sources

arXiv2026

A Comparative Analysis of ARM and x86-64 Laptop-Class Processors: Architecture, Assembly-Level Performance, and Energy Efficiency

ARM-based and x86-64 laptop processors differ not only in instruction-set design, but also in memory hierarchy, core organization, system integration, and power-management mechanisms. This study presents a combined architectural and experimental comparison of an Apple M3 system and an AMD Ryzen 7 3750H system. The architectural analysis contrasts AArch64's fixed-width load-store design with the variable-length, memory-operand-rich x86-64 instruction model, and discusses how register organization, calling conventions, heterogeneous core organization, memory behavior, and low-power mechanisms shape observed performance and energy characteristics. The experimental part uses two native assembly benchmarks: a recursive Fibonacci workload and an integer matrix-multiplication workload. The analysis combines repeated timing measurements, processor-energy measurements, and cross-platform microarchitectural counter measurements from matched portable-C profiling runs. The Ryzen platform is decisively faster on the branch-heavy Fibonacci benchmark, while matrix multiplication shows no meaningful timing advantage for either platform in the present measurements. In contrast, the Apple platform is markedly more energy-efficient, reducing energy-to-solution by approximately 5.82$\times$ on Fibonacci and 6.38$\times$ on matrix multiplication. These results are interpreted as platform-level findings rather than as pure ISA-only effects, reflecting differences in implementation, system integration, and measurement methodology in addition to instruction-set structure.

cs.AR↗

arXiv2026

Graph-Coarsening Approach for the Capacitated Vehicle Routing Problem with Time Windows

The Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is a fundamental NP-hard optimization problem in logistics. Solving large-scale instances remains computationally challenging for exact solvers. This paper introduces a multilevel graph coarsening and refinement strategy that aggregates customers into meta-nodes based on a spatio-temporal distance metric. The reduced problem is solved using both classical heuristics and quantum annealing hardware, then expanded back into the original space with arrival times recomputed and constraint violations recorded. Comprehensive experiments on Solomon benchmarks demonstrate that our method significantly reduces computation time while preserving solution quality for classical heuristics. For quantum solvers, experiments across all 56 Solomon instances at $N=5$ and $N=10$ customers show that coarsening consistently reduces computation time and, on clustered (C-type) instances, simultaneously reduces vehicle count and route duration with no feasibility loss. Coarsening effectiveness is strongly instance-structure dependent: C-type instances achieve %100 post-coarsening feasibility with measurable quality improvements, while narrow-window random (R-type) instances present structural constraints that limit achievable coarsening depth.

cs.AI↗

arXiv2026

Nonlocal Games Revisited: A Representation-Theoretic Path from Bell Locality to Quantum Pseudo-Telepathy

Nonlocal games provide a unified framework for studying the distinction between classical, quantum, and more general no-signaling correlations. In this work, we develop this perspective by connecting the Bell-locality framework to several complementary mathematical representations of nonlocal games and quantum strategies. We begin with local hidden-variable models, the CHSH inequality, and the role of Bell nonlocality as a device-independent witness of entanglement, and then introduce nonlocal games through the standard predicate/verifier formalism. We next examine a set of representative examples, including XOR games, the GHZ game, graph-based coloring games, the Mermin-Peres magic square game, and Hardy's paradox as a related logical manifestation of nonlocality. Building on this foundation, we compare four closely related representation frameworks: conditional-probability and correlation descriptions, Bell-functional formulations, entangled-value optimization, and the quantum-operator approach together with the Navascues-Pironio-Acin (NPA) hierarchy. These viewpoints are then instantiated for the CHSH, magic square, and GHZ games, showing how each representation emphasizes a different aspect of the same underlying task. Taken together, these examples show that nonlocal games can be studied simultaneously as geometric objects in correlation space, optimization problems over entangled resources, and operator-theoretic constructions. This multi-representation viewpoint clarifies the relation between Bell inequality violations, perfect quantum strategies, pseudo-telepathy, and semidefinite relaxations of quantum correlations.

quant-ph↗