1715 matching published research entries
Quantum Research · 2026-10-26
arXiv:2610.32145v1 Announce Type: new Abstract: In classical cryptography, one-way functions are necessary for most of cryptography. In the quantum world, however, Kretschmer at {TQC'21} and subsequent works have demonstrated that quantum versions of various primitives in minicrypt, such as signatures and private-key encryption, do not require quantum-computable one-way functions (\textsf{qOWF}s).
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.32054v1 Announce Type: new Abstract: We present a comprehensive framework for the real-space construction of center-of-mass (c.m.) momentum eigenstates in two-dimensional (2D) quantum many-body systems. Unlike standard momentum-space approaches, our real-space formalism explicitly captures the non-uniformity of cyclic subspace dimensions, which are fundamentally governed by the spatial symmetries of the…
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.32049v1 Announce Type: new Abstract: In distributed quantum computing, quantum networks provide a potential infrastructure for long-range quantum information processing. Controlled quantum teleportation (CQT) is a key practically relevant protocol that can connect two parties on a network and enables a third party, the controller to allow or abort the secure teleportation of an arbitrary single-qubit…
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.32037v1 Announce Type: new Abstract: Many-body localisation, Hilbert space fragmentation and quantum many-body scars (QMBS) are well-established mechanisms of ergodicity breaking in quantum systems. Recently, asymptotic quantum many-body scars (AQMBS), non-thermal states whose stability grows with system size, have been proposed theoretically and probed experimentally.
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.32014v1 Announce Type: new Abstract: Given Hermitian observable $A$, the variance of $A$ is given by the difference of expectations $\langle A^2\rangle - \langle A\rangle^2$, where the expectation of an observable implicitly assumes a choice of state for the underlying system.
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.32001v1 Announce Type: new Abstract: Mapping the phase diagram of a new quantum Hamiltonian demands expert judgement at every step: which observables to measure, where in parameter space to compute, or how to separate genuine order from finite-size artefacts.
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.31998v1 Announce Type: new Abstract: Semiconductor triple-quantum dots (TQDs) are a promising platform for scalable quantum information processing, but the community has so far lacked access to affordable and flexible high-speed control electronics.
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.31947v1 Announce Type: new Abstract: We investigate qubit entanglement dynamics in a two-qubit cavity system with stochastically fluctuating coupling strength, comparing white noise (Markovian) and Ornstein-Uhlenbeck noise (non-Markovian) processes.
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.31938v1 Announce Type: new Abstract: We analytically investigate the fidelity dynamics of a Jaynes--Cummings qubit coupled to a single-mode cavity in the presence of stochastic fluctuations of the qubit--cavity coupling. Such fluctuations naturally arise in cavity- and circuit-QED platforms due to fabrication imperfections, control-field noise, mechanical vibrations, and environmental disturbances.
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.31933v1 Announce Type: new Abstract: Multimode entangled pure Gaussian states are an essential resource for continuous variable (CV) quantum information processing. Menicucci et al. [2011] have shown how to describe them as graphs with complex adjacency matrices.
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.31885v1 Announce Type: new Abstract: Optimizing the control of large quantum systems is a resource-intensive task, where the convergence rate of the underlying iterative schemes is crucial. The recently developed Quantum Projection Operator-Based Newton Method for Trajectory Optimization (Q-PRONTO) offers a unique quadratic convergence for controlling quantum states, while most model-based solvers…
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.31877v1 Announce Type: new Abstract: Practical quantum computations can require logical error rates of $10^{-12}$ or lower. Quantum low-density parity-check (QLDPC) codes are promising candidates for reaching such rates with low qubit overhead, provided that their syndromes can be decoded efficiently. Repeated noisy syndrome measurements introduce temporal degeneracy into the space-time decoding graph.
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.31792v1 Announce Type: new Abstract: Understanding how collective phenomena such as pairing and deformation emerge in interacting fermionic systems, and how the correlations underlying them shape the resources required for their simulation, is a central challenge in many-body physics.
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.31775v1 Announce Type: new Abstract: We show that a classical client with no quantum hardware can use a single untrusted and potentially malicious quantum server as if it were its own trusted quantum computer. Through the server, the client can privately choose and run quantum computations, prepare quantum states, and process quantum states supplied by other parties.
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.31729v1 Announce Type: new Abstract: In quantum information theory, standard notions typically presuppose a fixed partition of the world into subsystems, encoded in a tensor product structure of the Hilbert space. Yet, in some scenarios, the subsystem structure is not uniquely fixed.
arXiv QuantumRead article →Quantum Research · 2026-10-26
arXiv:2610.31694v1 Announce Type: new Abstract: Fault-tolerant quantum compilers implement gates through Pauli-product measurements and classical feedback. Verifying such a compiler requires reasoning about the quantum state and the recorded outcomes together: a correction reads an outcome, a gate's internal outcomes must be hidden from its caller, and an application's outcomes must survive optimization.
arXiv QuantumRead article →Machine Learning · 2026-10-26
arXiv:2610.31981v1 Announce Type: new Abstract: On the simplest non-Euclidean manifold, the 1D flat torus, we exhibit a distribution where a recently proposed extension of Riemannian flow matching is globally optimized by a velocity field that pushes samples away from the data distribution.
arXiv MLRead article →Machine Learning · 2026-10-26
arXiv:2610.31968v1 Announce Type: new Abstract: Accurate ambulance travel time estimation is critical for emergency medical dispatch, yet existing decision-support practices often rely on static lookup tables or simplified assumptions regarding how ambulance travel time differs from ordinary passenger-car travel.
arXiv MLRead article →Machine Learning · 2026-10-26
arXiv:2610.31955v1 Announce Type: new Abstract: Recent work from Anthropic introduced a new interpretability tool, called the Jacobian lens (J-lens, Gurnee et al., 2026). This method identified linear directions in the hidden states of frontier language models that had properties reminiscent of working memory-like representations.
arXiv MLRead article →Machine Learning · 2026-10-26
arXiv:2610.31948v1 Announce Type: new Abstract: Reporting the best of $M$ noisy, unbiased scores overstates the winner's value by up to $c\sqrt{V}$, where $V$ is the total noise variance and the sharp constant $c$ depends on how the noise is dependent. It was known only at the two extremes, arbitrary dependence ($\sqrt{(M-1)/M}$) and i.i.d. noise.
arXiv MLRead article →Machine Learning · 2026-10-26
arXiv:2610.31944v1 Announce Type: new Abstract: Emergency medical dispatch increasingly relies on AI-enabled decision support systems when making ambulance dispatch decisions. In this process, accurate ambulance travel time estimates are essential for timely resource allocation and prehospital care. However, existing ambulance travel time estimation approaches typically produce only single point predictions.
arXiv MLRead article →Machine Learning · 2026-10-26
arXiv:2610.31943v1 Announce Type: new Abstract: Looped language models apply one block of layers repeatedly, and the design pays off only if depth is reusable: loop steps beyond the trained budget must remain usable at inference. We ask whether that rests on normalising the state between loop steps, as the released Ouro models do, or on agreement between the loop a model is trained with and the loop it is run with.
arXiv MLRead article →Machine Learning · 2026-10-26
arXiv:2610.31935v1 Announce Type: new Abstract: PDE foundation models enable data-efficient adaptation but are deployed autoregressively, so short-horizon accuracy need not imply reliable simulation. We ask whether the short-horizon advantage of a foundation-model recipe persists when its predictions are repeatedly fed back as inputs for a long horizon.
arXiv MLRead article →Machine Learning · 2026-10-26
arXiv:2610.31931v1 Announce Type: new Abstract: We introduce TWIG (Tree-structured Weights with Inherited Gates), a representation in which every weight of a neural network is the end of a path of small discrete decisions: a sign, a shift by a power of two, a zero gate, an index into a shared table.
arXiv MLRead article →