2.241 hasil
Menampilkan 1–20 · 0,51 detik · RSS
Quantum
Scopus
ISSN 2521-327X · Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften · 2.241 artikel di indeks
-
Artikel Jurnal
Scalable quantum simulator with an extended gate set in giant atoms
Quantum computation and quantum simulation require a versatile gate set to optimize circuit compilation for practical applications. However, existing platforms are often limited to specific gate types or rely on parametric couplers to extend their gate set, which compromises scalability. Here, we…
-
Artikel Jurnal
Multi-qubit Rydberg gates between distant atoms
We propose an efficient protocol to realize multi-qubit gates in arrays of neutral atoms. The atoms encode qubits in the long-lived hyperfine sublevels of the ground electronic state. To realize the gate, we apply a global laser pulse to transfer the atoms to a Rydberg state with strong blockade…
-
Artikel Jurnal
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
Mančinska and Roberson [FOCS'20] showed that two graphs are quantum isomorphic if and only if they admit the same number of homomorphisms from any planar graph. Atserias et al. [JCTB'19] proved that quantum isomorphism is undecidable in general, which motivates the study of its relaxations. In the…
-
Artikel Jurnal
Characterising memory in quantum channel discrimination via constrained separability problems
Quantum memories are a crucial precondition in many protocols for processing quantum information. A fundamental problem that illustrates this statement is given by the task of channel discrimination, in which an unknown channel drawn from a known random ensemble should be determined by applying it…
-
Artikel Jurnal
Quantum Architecture Search with Unsupervised Representation Learning
Unsupervised representation learning presents new opportunities for advancing Quantum Architecture Search (QAS) on Noisy Intermediate-Scale Quantum (NISQ) devices. QAS is designed to optimize quantum circuits for Variational Quantum Algorithms (VQAs). Most QAS algorithms tightly couple the search…
-
Artikel Jurnal
Quantum Circuit Optimization by Graph Coloring
This work shows that minimizing the depth of a quantum circuit composed of commuting operations reduces to a vertex coloring problem on an appropriately constructed graph, where gates correspond to vertices and edges encode non-parallelizability. The reduction leads to algorithms for circuit…
-
Artikel Jurnal
QMetro++ – Python optimization package for large scale quantum metrology with customized strategy structures
QMetro++ is a Python package that provides a set of tools for identifying optimal estimation protocols that maximize quantum Fisher information (QFI). Optimization can be performed for arbitrary configurations of input states, parameter-encoding channels, noise correlations, control operations, and…
-
Artikel Jurnal
Quantum particle in the wrong box (or: the perils of finite-dimensional approximations)
When numerically simulating the unitary time evolution of an infinite-dimensional quantum system, one is usually led to treat the Hamiltonian $H$ as an "infinite-dimensional matrix" by expressing it in some orthonormal basis of the Hilbert space, and then truncate it to some finite dimensions…
-
Artikel Jurnal
Hamiltonian Property Testing
Locality is a fundamental feature of many physical time evolutions. Assumptions on locality and related structural properties also underlie recently proposed procedures for learning an unknown Hamiltonian from access to the induced time evolution. However, no protocols to rigorously test whether an…
-
Artikel Jurnal
How to Sign Quantum Messages
Signing quantum messages has long been considered impossible even under computational assumptions. In this work, we challenge this notion and provide three innovative approaches to sign quantum messages that are the first to ensure authenticity with public verifiability. Our contributions can be…
-
Artikel Jurnal
A Computational Tsirelson's Theorem for the Value of Compiled XOR Games
Nonlocal games are a foundational tool for understanding entanglement and constructing quantum protocols in settings with multiple spatially separated quantum devices. In this work, we continue the study initiated by Kalai et al. (STOC '23) of compiled nonlocal games, played between a classical…
-
Artikel Jurnal
Fast-forwarding quantum algorithms for linear dissipative differential equations
We establish improved complexity estimates of quantum algorithms for linear dissipative ordinary differential equations (ODEs) and show that the time dependence can be fast-forwarded to be sub-linear. Specifically, we show that a quantum algorithm based on truncated Dyson series can prepare history…
-
Artikel Jurnal
Chasing shadows with Gottesman-Kitaev-Preskill codes
We consider the task of performing shadow tomography of a logical subsystem defined via the Gottesman--Kitaev--Preskill (GKP) error correcting code. Our protocol does not require the input state to be a code state but is implemented by appropriate twirling of the measurement channel, such that the…
-
Artikel Jurnal
Parameter estimation for quantum jump unraveling
We consider the estimation of parameters encoded in the measurement record of a continuously monitored quantum system in the jump unraveling, corresponding to a single-shot scenario, where information is continuously gathered. Here, it is generally difficult to assess the precision of the…
-
Artikel Jurnal
On computational complexity and average-case hardness of shallow-depth boson sampling
Boson Sampling, a computational task believed to be classically hard to simulate, is expected to hold promise for demonstrating quantum computational advantage using near-term quantum devices. However, noise in experimental implementations poses a significant challenge, potentially rendering Boson…
-
Artikel Jurnal
An adversary bound for quantum signal processing
Quantum signal processing (QSP) and quantum singular value transformation (QSVT), have emerged as unifying frameworks in the context of quantum algorithm design. These techniques allow to carry out efficient polynomial transformations of matrices block-encoded in unitaries, involving a single…
-
Artikel Jurnal
Bridging Classical and Quantum Information Scrambling with the Operator Entanglement Spectrum
Universal features of chaotic quantum dynamics underlie our understanding of thermalization in closed quantum systems and the complexity of quantum computations. Reversible automaton circuits, comprised of classical logic gates, have emerged as a tractable means to study such dynamics. Despite…
-
Artikel Jurnal
Explicit decoders using fixed-point amplitude amplification based on QSVT
Reliably transmitting quantum information via a noisy quantum channel is a central challenge in quantum information science. While constructing a decoder is crucial to this goal, little was known about quantum circuit implementations of decoders that reach high communication rates. In this paper…
-
Artikel Jurnal
Qudit low-density parity-check codes
Qudits offer significant advantages over qubit-based architectures, including more efficient gate compilation, reduced resource requirements, improved error-correction primitives, and enhanced capabilities for quantum communication and cryptography. Yet, one of the most promising families of…
-
Artikel Jurnal
Agnostic Tomography of Stabilizer Product States
We define a quantum learning task called $\textit{agnostic tomography}$, where given copies of an arbitrary state $\rho$ and a class of quantum states $\mathcal{C}$, the goal is to output a succinct description of a state that approximates $\rho$ at least as well as any state in $\mathcal{C}$ (up…
Menampilkan maksimal 50 halaman. Persempit pencarian dengan filter untuk hasil yang lebih spesifik.