SearcharxivSearch

arXiv subjects

Anette Messinger

Publications and source records attributed to Anette Messinger.

16 recordsLinked to original sources

Parity-unfolded distillation architecture for noise-biased platforms

We introduce the parity-unfolded architecture, a fault-tolerant quantum computing scheme that relies on direct preparation and teleportation of small-angle rotations $ Z^{1/2^{k}}$ rather than approximating them with the conventional (Clifford + $T$) gate set. The architecture is enabled by efficient distillation of gates from an arbitrary level of the Clifford hierarchy, which we refer to as parity unfolding. With it, a state $|Z_k\rangle = Z^{1/2^{k}}|{+}\rangle$ can be prepared fault-tolerantly using $2^{k+3} + O(2^{k/2})$ biased-noise qubits on a planar chip with nearest-neighbour connectivity. For algorithms requiring native $Z^{1/2^{k}}$ gates, such as the Quantum Fourier Transform and phase estimation, the proposed scheme allows to reduce resource overheads for up to $k=7$, i.e., up to $T^{1/32}$. Furthermore, when used for the synthesis of arbitrary small-angle rotations, parity-unfolded distillation of ($T$ + $\sqrt{T}$) reduces the minimum achievable logical error rate by 43% while cutting the resource requirements by 26%, when compared to unfolded distillation of only the $T$ gate.

quant-ph

YZ-plane measurement-based quantum computation: Universality and Parity Architecture implementation

We define the class of register-logic graphs and prove that any uniformly deterministic measurement-based quantum computation (MBQC) where the inputs coincide with the outputs must be driven on such graphs by measurements in the $YZ$ plane of the Bloch sphere. This observation is revisited in the context that goes beyond uniform determinism, where we present a universal $YZ$-plane-only measurement pattern and establish a connection between $YZ$-plane-only and $XZ$-plane-only patterns. These results conclude the line of research on universal patterns with measurements restricted to one of the principal planes of the Bloch sphere. We further demonstrate, within the framework of the Parity Architecture, that $YZ$-plane patterns with the register-logic graph can be embedded into another graph with purely local interactions, and we extend this case to the scenario of universal quantum computation.

quant-ph

Fault-tolerant multi-qubit gates in Parity Codes

We present a set of efficiently implementable logical multi-qubit gates in concatenated quantum error correction codes using parity qubits. In particular, we show how fault-tolerant high-weight rotation gates of arbitrary angle can be implemented on single physical qubits of a classical stabilizer code, or on localized regions of full quantum error correction codes. Similarly, we show how transversal CNOT gates can implement logical parity-controlled-NOT operations between arbitrarily many logical qubits. Both operation types can be implemented and in many cases parallelized without the use of lattice surgery or the need for complicated routing operations.

quant-ph

The Parity Flow Formalism: Tracking Quantum Information Throughout Computation

We propose the Parity Flow formalism, a method for tracking the information flow in quantum circuits. This method adds labels to quantum circuit diagrams such that the action of Clifford gates can be understood as a recoding of quantum information. The action of non-Clifford gates in the encoded space can be directly deduced from those labels without backtracking. An application of flow tracking is to design resource-efficient quantum circuits by changing any present encoding via a simple set of rules. Finally, the Parity Flow formalism can be used in combination with stabilizer codes to further reduce quantum circuit depth and to reveal additional operations that can be implemented in parallel.

quant-ph

Optimal Decoder for the Error Correcting Parity Code

We present a two-step decoder for the parity code and evaluate its performance in code-capacity and faulty-measurement settings. For noiseless measurements, we find that the decoding problem can be reduced to a series of repetition codes while yielding near-optimal decoding for intermediate code sizes and achieving optimality in the limit of large codes. In the regime of unreliable measurements, the decoder demonstrates fault-tolerant thresholds above 5% at the cost of decoding a series of independent repetition codes in (1 + 1) dimensions. Such high thresholds, in conjunction with a practical decoder, efficient long-range logical gates, and suitability for planar implementation, position the parity architecture as a promising candidate for demonstrating quantum advantage on qubit platforms with strong noise bias.

quant-ph

SWAP-less Implementation of Quantum Algorithms

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 operations or shuttling. Instead, we leverage the fact that entangling gates not only manipulate quantum states but can also be exploited to transport quantum information. We demonstrate the effectiveness of this method by applying it to the quantum Fourier transform (QFT) and the Quantum Approximate Optimization Algorithm (QAOA) with $n$ qubits. This improves upon all state-of-the-art implementations of the QFT on a linear nearest-neighbor architecture, resulting in a total circuit depth of ${5n-3}$ and requiring ${n^2-1}$ CNOT gates. For the QAOA, our method outperforms SWAP networks, which are currently the most efficient implementation of the QAOA on a linear architecture. We further demonstrate the potential to balance qubit count against circuit depth by implementing the QAOA on twice the number of qubits using bi-linear connectivity, which approximately halves the circuit depth.

quant-ph

Fault-tolerant quantum computing with the parity code and noise-biased qubits

We present a fault-tolerant universal quantum computing architecture based on a code concatenation of biased-noise qubits and the parity architecture. The parity architecture can be understood as an LDPC code tailored specifically to obtain any desired logical connectivity from nearest-neighbor physical interactions. The code layout can be dynamically adjusted to algorithmic requirements on-the-fly. This allows for implementations with any desired code distance with a universal set of fault-tolerant gates. In addition to the previously explored tool-sets for concatenated cat codes, our approach features parallelizable interactions between arbitrary sets of qubits by directly addressing the parity qubits in the code. The proposed scheme enables codes with less physical qubit overhead compared to the repetition code with the same code distances, while requiring only weight-3 and weight-4 stabilizers and nearest-neighbor 2D square-lattice connectivity.

quant-ph

Flexible constraint compilation in the parity architecture

We present tools and methods to generalize parity compilation to digital quantum computing devices with arbitrary connectivity graphs and construct circuit implementations for the constraint Hamiltonian of higher-order constrained binary optimization problems. In particular, we show how even non-local constraints can be efficiently implemented without expensive SWAP gates. We show how the presented tools can be used to optimize the total circuit depth and CNOT count of the quantum approximate optimization algorithm in the parity architecture and highlight the advantages of the flexible compilation using various examples. We derive the relation between the developed gate sequences and the traditional approach that uses SWAP gates. The result can be applied to improve the implementation of many other non-local operators.

quant-ph

Constant Depth Code Deformations in the Parity Architecture

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 single-qubit operations only. While this procedure typically requires a quadratic overhead of simultaneous qubit measurements, it allows for a simple and low-depth implementation of logical multi-qubit gates in the parity encoding via code deformation. We discuss how such encoding and decoding schemes can be used to flexibly change the size and shape of the underlying code to enable a more efficient implementation of quantum gates or algorithms. We apply the new findings to the QAOA which leads to a constant depth implementation using local gates at the same optimization performance as the standard, potentially non-local, QAOA approach without the parity encoding. Furthermore, we show that our method can reduce the depth of implementing the quantum Fourier transform by a factor of two when allowing measurements.

quant-ph

Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization

We present a construction for circuits with low gate count and depth, implementing three- and four-body Pauli-Z product operators as they appear in the form of plaquette-shaped constraints in QAOA when using the parity mapping. The circuits can be implemented on any quantum device with nearest-neighbor connectivity on a square-lattice, using only one gate type and one orientation of two-qubit gates at a time. We find an upper bound for the circuit depth which is independent of the system size. The procedure is readily adjustable to hardware-specific restrictions, such as a minimum required spatial distance between simultaneously executed gates, or gates only being simultaneously executable within a subset of all the qubits, for example a single line.

quant-ph

Applications of Universal Parity Quantum Computation

We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model, by exploring several quantum gate algorithms such as the quantum Fourier transform and quantum addition. Embedding these algorithms in the parity encoding reduces the circuit depth compared to conventional gate-based implementations while keeping the multiqubit gate counts comparable. We further propose simple implementations of multiqubit gates in tailored encodings and an efficient strategy to prepare graph states.

quant-ph

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 controlled phase gate and $R_z$ rotations can be implemented in parity encoding with single-qubit operations. Together with logical $R_x$ rotations, implemented via nearest-neighbor controlled-NOT gates and an $R_x$ rotation, these form a universal gate set. As the controlled phase gate requires only single-qubit rotations, the proposed scheme has advantages for several cornerstone quantum algorithms, e.g., the quantum Fourier transform. We present a method to switch between different encoding variants via partial on-the-fly encoding and decoding.

quant-ph

Modular Parity Quantum Approximate Optimization

The parity transformation encodes spin models in the low-energy subspace of a larger Hilbert-space with constraints on a planar lattice. Applying the Quantum Approximate Optimization Algorithm (QAOA), the constraints can either be enforced explicitly, by energy penalties, or implicitly, by restricting the dynamics to the low-energy subspace via the driver Hamiltonian. While the explicit approach allows for parallelization with a system-size-independent circuit depth, the implicit approach shows better QAOA performance. Here we combine the two approaches in order to improve the QAOA performance while keeping the circuit parallelizable. In particular, we introduce a modular parallelization method that partitions the circuit into clusters of subcircuits with fixed maximal circuit depth, relevant for scaling up to large system sizes.

quant-ph

Duality, decay rates and local-field models in macroscopic QED

Any treatment of magnetic interactions between atoms, molecules and optical media must start at the form of the interaction energy. This forms the base on which predictions about any number of magnetic atom-light properties stands -- spontaneous decay rates and forces included. As is well-known, the Heaviside-Larmor duality symmetry of Maxwell's equations, where electric and magnetic quantities are exchanges, is broken by the usual form of the magnetic interaction energy. We argue that this symmetry can be restored by including general local-field effects, and that local fields should be treated as a necessity for correctly translating between the microscopic world of the dipole and the macroscopic world of the measured fields. This may additionally aid in resolving a long standing debate over the form of the force on a dipole in a medium. Finally, we compute the magnetic dipole decay rate in a magneto-dielectric with local-field effects taken into account, and show that macroscopic quantum electrodynamics can be made to be dual symmetric at an operator level, instead of only for expectation values.

quant-ph

Spontaneous emission in anisotropic dielectrics

The emission properties of atoms lie at the foundations of both quantum theory and light-matter interactions. In the context of macroscopic media, exact knowledge thereof is important both in current quantum technologies as well as in fundamental studies. While for isotropic media, this is a very well-studied problem, there are still big gaps in the theory of anisotropic media. In particular, to the best of our knowledge, an explicit expression for the spontaneous emission rate in general anisotropic media has not been presented. In this work, we first derive the quantised electromagnetic field operators to calculate the emission rate in uniaxial media. For the more general case of biaxial media we propose an approximate expression based on interpolation between the limiting cases of uniaxial media. We support our model with numerical simulations which are in strong agreement for typical media configurations, and furthermore show how local field effects can be taken into account in the model.

quant-ph

Left-handed superlattice metamaterials for circuit QED

Quantum simulations is a promising field where a controllable system is used to mimic another system of interest, whose properties one wants to investigate. One of the key issues for such simulations is the ability to control the environment the system couples to, be it to isolate the system or to engineer a tailored environment of interest. One strategy recently put forward for environment engineering is the use of metamaterials with negative index of refraction. Here we build on this concept and propose a circuit-QED simulation of many-body Hamiltonians using superlattice metamaterials. We give a detailed description of a superlattice transmission line coupled to an embedded qubit, and show how this system can be used to simulate the spin-boson model in regimes where analytical and numerical methods usually fail, e.g. the strong coupling regime.

quant-ph