Universal parity quantum computing
We propose a universal gate set for quantum computing with all-to-all connectivity and
intrinsic robustness to bit-flip errors based on parity encoding. We show that logical …
intrinsic robustness to bit-flip errors based on parity encoding. We show that logical …
Parity Quantum Computing as -Plane Measurement-Based Quantum Computing
We show that universal parity quantum computing employing a recently introduced constant
depth decoding procedure is equivalent to measurement-based quantum computation …
depth decoding procedure is equivalent to measurement-based quantum computation …
Constant depth code deformations in the parity architecture
A Messinger, M Fellner… - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
We present a protocol to encode and decode arbitrary quantum states in the parity
architecture with constant circuit depth using measurements, local nearest-neighbor and …
architecture with constant circuit depth using measurements, local nearest-neighbor and …
Scalable parity architecture with a shuttling-based spin qubit processor
F Ginzel, M Fellner, C Ertler, LR Schreiber, H Bluhm… - Physical Review B, 2024 - APS
Motivated by the prospect of a two-dimensional square-lattice geometry for semiconductor
spin qubits, we explore the realization of the parity architecture with quantum dots. We …
spin qubits, we explore the realization of the parity architecture with quantum dots. We …
Spectral observation of symmetry-protected selection rules for dynamical high-dimensional parity in alignment magnetic resonance
XX Geng, K Jin, L Zhou, WW Tang, G Yang… - Science China Physics …, 2024 - Springer
Multidimensional Floquet-driven alignment systems with dynamical symmetry present
various exotic phenomena and applications. However, there are challenges in directly …
various exotic phenomena and applications. However, there are challenges in directly …
SWAP-less Implementation of Quantum Algorithms
B Klaver, S Rombouts, M Fellner, A Messinger… - arXiv preprint arXiv …, 2024 - arxiv.org
We present a formalism based on tracking the flow of parity quantum information to
implement algorithms on devices with limited connectivity without qubit overhead, SWAP …
implement algorithms on devices with limited connectivity without qubit overhead, SWAP …
Comparing planar quantum computing platforms at the quantum speed limit
D Basilewitsch, C Dlaska, W Lechner - Physical Review Research, 2024 - APS
An important aspect that strongly impacts the experimental feasibility of quantum circuits is
the ratio of gate times and typical error time scales. Algorithms with circuit depths that …
the ratio of gate times and typical error time scales. Algorithms with circuit depths that …
量超协同计算发展概述
付耀斌, 周辉 - 信息通信技术与政策, 2023 - ictp.caict.ac.cn
量子计算与经典计算相互配合, 可以充分发挥现阶段量子设备的潜力, 从而加速计算过程. 另外,
量子计算的特性决定了即使到了实现容错量子计算阶段, 也仍然需要经典计算的配合 …
量子计算的特性决定了即使到了实现容错量子计算阶段, 也仍然需要经典计算的配合 …