Zobrazeno 1 - 10
of 1 306
pro vyhledávání: '"Koenig, Robert"'
Autor:
Dias, Beatriz, Koenig, Robert
We propose efficient classical algorithms which (strongly) simulate the action of bosonic linear optics circuits applied to superpositions of Gaussian states. Our approach relies on an augmented covariance matrix formalism to keep track of relative p
Externí odkaz:
http://arxiv.org/abs/2403.19059
Autor:
Choe, Shin Ho, Koenig, Robert
We show how to realize a general quantum circuit involving gates between arbitrary pairs of qubits by means of geometrically local quantum operations and efficient classical computation. We prove that circuit-level local stochastic noise modeling an
Externí odkaz:
http://arxiv.org/abs/2402.13863
We present a computational problem with the following properties: (i) Every instance can be solved with near-certainty by a constant-depth quantum circuit using only nearest-neighbor gates in 3D even when its implementation is corrupted by noise. (ii
Externí odkaz:
http://arxiv.org/abs/2312.09209
Autor:
König, Robert, Rouzé, Cambyse
Local update recovery seeks to maintain quantum information by applying local correction maps alternating with and compensating for the action of noise. Motivated by recent constructions based on quantum LDPC codes in the finite-dimensional setting,
Externí odkaz:
http://arxiv.org/abs/2309.16241
Autor:
Dias, Beatriz, Koenig, Robert
Publikováno v:
Quantum 8, 1350 (2024)
We propose efficient algorithms for classically simulating fermionic linear optics operations applied to non-Gaussian initial states. By gadget constructions, this provides algorithms for fermionic linear optics with non-Gaussian operations. We argue
Externí odkaz:
http://arxiv.org/abs/2307.12912
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-15 (2024)
Abstract The rapid transformation of sensory inputs into meaningful neural representations is critical to adaptive human behaviour. While non-invasive neuroimaging methods are the de-facto method for investigating neural representations, they remain
Externí odkaz:
https://doaj.org/article/83653afc098d4bf78eed248930d374b6
Gate-teleportation circuits are arguably among the most basic examples of computations believed to provide a quantum computational advantage: In seminal work [Quantum Inf. Comput., 4(2):134--145], Terhal and DiVincenzo have shown that these circuits
Externí odkaz:
http://arxiv.org/abs/2209.14158
Autor:
Choe, Shin Ho, Koenig, Robert
We propose a scheme for fault-tolerant long-range entanglement generation at the ends of a rectangular array of qubits of length $R$ and a square cross section of size $d\times d$ with $d=O(\log R)$. Up to an efficiently computable Pauli correction,
Externí odkaz:
http://arxiv.org/abs/2209.09774
We consider Kitaev's quantum double model based on a finite group $G$ and describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated by an arbitrary distance, and (c) non-destructive topological charge me
Externí odkaz:
http://arxiv.org/abs/2205.01933
Publikováno v:
Quantum Science and Technology 7, 045013 (2022)
Proposed hybrid algorithms encode a combinatorial cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. Classical processing is typically only used for the choice of variational
Externí odkaz:
http://arxiv.org/abs/2203.00717