Showing quant-phShow all
3 papers · 1 filter
quant-ph2025
An edge-based and subspace reduction encoding scheme to solve the traveling salesman problem in quantum computers
Anandu Kalleri Madhu, Chi-Kwong Li, Jami Rönkkö +2
This paper introduces a novel edge-based encoding technique for solving the Traveling Salesman Problem (TSP) on a quantum computer, reducing the required number of qubits. For impl…
quant-ph2025
Circuit Knitting for Continuous-Variable Quantum States
Shao-Hua Hu, Ray-Kuang Lee
In finite-dimensional systems, circuit knitting can be used to simulate non-classical quantum operations using a limited set of resources. In this work, we extend circuit knitting…
quant-ph2025
Generalized cross-resonance scheme for maximally-entangling two-qutrit gates
Yash Saxena, Tharrmashastha Sapv, Sagnik Chatterjee +1
To utilize higher-dimensional quantum systems, in this Letter, we derive a generalized cross-resonance (GCR) scheme for realizing maximally entangling two-qutrit gates on fixed-fre…