The global transverse-field Ising model with non-monotonic time-dependent transverse field is polynomially equivalent to the gate model of quantum computation.
Title resolution pending
12 Pith papers cite this work. Polarity classification is still indexing.
12
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
verdicts
UNVERDICTED 12roles
method 1polarities
use method 1representative citing papers
The Tavis-Cummings interaction plus global J_z restricts unitaries on n>2 qubits due to an accidental symmetry; adding J_z^2 breaks the symmetry and achieves semi-universality for symmetry-respecting operations up to center constraints.
The conjecture that breaking all non-trivial graph automorphisms suffices for universality in globally controlled qubit systems is disproved by connected graphs with trivial automorphism groups whose generated Lie algebras are nonetheless non-universal.
Linear-programming method for conjugating local fermionic unitaries with free evolution realizes arbitrary complex tunneling coefficients in fermionic lattice models constrained only by connectivity.
Develops an invariant-based framework connecting Pauli Lie algebras to transvection-generated Clifford subgroups for quantum reachability and dynamics analysis.
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
Long-range measurement-only Clifford circuits display several entanglement and scrambling phases, including a structured-circuit phase with volume-law entanglement, long-range correlations, rapid ancilla purification, and no scrambling.
Constructive protocols prove that arbitrary fermionic quantum operations are achievable with global controls in optical lattice Fermi-Hubbard systems.
A scheme is developed to engineer strong three-body interactions in Rydberg atom lattices, allowing the effective Hamiltonian and emergent quantum phases to be modified compared to two-body-only systems.
Hybrid variational quantum simulation on fermionic ultracold atoms achieves polynomial scaling for ground states of gapless target Hamiltonians, claiming exponential speedup over classical exact diagonalization for local observables.
Rigorous worst- and average-case error bounds show comparable worst-case scaling for digital and analog quantum simulators under perturbative noise, with distinct average-case error cancellation and concentration bounds for Gaussian and Brownian noise.
Random global pulses in Rydberg chains generate states with Haar-like statistics at long times for weak interactions, while optimal control prepares generic symmetric states with infidelities from 10^{-5} to 3e-2 for 9 spins, worsening with entanglement entropy.
citing papers explorer
-
Polynomial equivalence of the global transverse-field Ising model and the gate model of quantum computation
The global transverse-field Ising model with non-monotonic time-dependent transverse field is polynomially equivalent to the gate model of quantum computation.
-
Global Control with the Tavis-Cummings Interaction
The Tavis-Cummings interaction plus global J_z restricts unitaries on n>2 qubits due to an accidental symmetry; adding J_z^2 breaks the symmetry and achieves semi-universality for symmetry-respecting operations up to center constraints.
-
Obstructions to universality in globally controlled qubit graphs
The conjecture that breaking all non-trivial graph automorphisms suffices for universality in globally controlled qubit systems is disproved by connected graphs with trivial automorphism groups whose generated Lie algebras are nonetheless non-universal.
-
Fermionic Hamiltonian engineering with local control
Linear-programming method for conjugating local fermionic unitaries with free evolution realizes arbitrary complex tunneling coefficients in fermionic lattice models constrained only by connectivity.
-
From Pauli Strings to Quantum Dynamics: A Unified Characterization
Develops an invariant-based framework connecting Pauli Lie algebras to transvection-generated Clifford subgroups for quantum reachability and dynamics analysis.
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
-
Entanglement and information scrambling in long-range measurement-only circuits
Long-range measurement-only Clifford circuits display several entanglement and scrambling phases, including a structured-circuit phase with volume-law entanglement, long-range correlations, rapid ancilla purification, and no scrambling.
-
Programmable Fermionic Quantum Processors with Globally Controlled Lattices
Constructive protocols prove that arbitrary fermionic quantum operations are achievable with global controls in optical lattice Fermi-Hubbard systems.
-
Three-body interactions in Rydberg lattices
A scheme is developed to engineer strong three-body interactions in Rydberg atom lattices, allowing the effective Hamiltonian and emergent quantum phases to be modified compared to two-body-only systems.
-
A universal and efficient hybrid digital-analog fermionic quantum simulator
Hybrid variational quantum simulation on fermionic ultracold atoms achieves polynomial scaling for ground states of gapless target Hamiltonians, claiming exponential speedup over classical exact diagonalization for local observables.
-
Stability of digital and analog quantum simulations under noise
Rigorous worst- and average-case error bounds show comparable worst-case scaling for digital and analog quantum simulators under perturbative noise, with distinct average-case error cancellation and concentration bounds for Gaussian and Brownian noise.
-
Random-State Generation and Preparation Complexity in Rydberg Atom Arrays
Random global pulses in Rydberg chains generate states with Haar-like statistics at long times for weak interactions, while optimal control prepares generic symmetric states with infidelities from 10^{-5} to 3e-2 for 9 spins, worsening with entanglement entropy.