Far-detuned cross-resonance designs cut frequency collisions in transmon processors, achieving 10% collision-free yield for 1024 qubits with qubit-frequency spread reduced to 6.8 MHz.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
verdicts
UNVERDICTED 5representative citing papers
Presents theory for Pareto-optimal multi-objective wave tweezers that deliver maximal force/torque to single objects and exact bounds on incompatible objectives for multiple objects in scattering media.
VeloxQ is a classical QUBO solver that reports competitive or superior performance and unique scalability to 10^8-variable sparse instances across benchmarks against quantum annealers, physics-inspired methods, and conventional solvers.
Light cone cancellation decomposes VQE circuits for Max-Cut into smaller subcircuits, yielding higher approximation ratios on simulated noisy backends up to 100 qubits compared to standard VQE.
Classical solvers solve random Ising models on heavy-hex graphs efficiently, with Gurobi showing linear or weakly quadratic scaling up to 100k variables and simulated annealing showing exponential time-to-solution without cubic terms.
citing papers explorer
-
Systematic frequency-collision analysis of the cross-resonance gate outside the straddling regime
Far-detuned cross-resonance designs cut frequency collisions in transmon processors, achieving 10% collision-free yield for 1024 qubits with qubit-frequency spread reduced to 6.8 MHz.
-
Multi-Objective Tweezers in Scattering Media
Presents theory for Pareto-optimal multi-objective wave tweezers that deliver maximal force/torque to single objects and exact bounds on incompatible objectives for multiple objects in scattering media.
-
VeloxQ: A Fast and Efficient QUBO Solver
VeloxQ is a classical QUBO solver that reports competitive or superior performance and unique scalability to 10^8-variable sparse instances across benchmarks against quantum annealers, physics-inspired methods, and conventional solvers.
-
Light Cone Cancellation for Variational Quantum Eigensolver in Solving Noisy Max-Cut
Light cone cancellation decomposes VQE circuits for Max-Cut into smaller subcircuits, yielding higher approximation ratios on simulated noisy backends up to 100 qubits compared to standard VQE.
-
Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs
Classical solvers solve random Ising models on heavy-hex graphs efficiently, with Gurobi showing linear or weakly quadratic scaling up to 100k variables and simulated annealing showing exponential time-to-solution without cubic terms.