Related papers: Block Encodings of Discrete Subgroups on Quantum C…

In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when…

Mutually unbiased bases (MUBs) play a crucial role in numerous applications within quantum information science, such as quantum state tomography, error correction, entanglement detection, and quantum cryptography. Utilizing \(2^n + 1\) MUB…

Quantum error correction is an essential ingredient for universal quantum computing. Despite tremendous experimental efforts in the study of quantum error correction, to date, there has been no demonstration in the realisation of universal…

Modular quantum computing architectures require error correction schemes that remain effective in the presence of noisy inter-processor operations. As such, minimizing the number of such operations on logical circuits partitioned across…

In this study, we explore the use of molecules and molecular electronics for quantum computing. We construct one-qubit gates using one-electron scattering in molecules, and two-qubit controlled-phase gates using electron-electron scattering…

Fault-tolerant quantum computers which can solve hard problems rely on quantum error correction. One of the most promising error correction codes is the surface code, which requires universal gate fidelities exceeding the error correction…

Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault-tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be…

Quantum state preparation, also known as encoding or embedding, is a crucial initial step in many quantum algorithms and often constrains theoretical quantum speedup in fields such as quantum machine learning and linear equation solvers.…

This paper proposes a new optimized quantum block-ZXZ decomposition method [7,8,10] that results in more optimal quantum circuits than the quantum Shannon decomposition (QSD)[27], which was introduced in 2006 by Shende et al. The…

We propose a scheme for scalable and robust quantum computing on two-dimensional arrays of qubits with fixed longitudinal coupling. This opens the possibility for bypassing the device complexity associated with tunable couplers required in…

We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework that encapsulates most known quantum algorithms and serves as the foundation for new ones. Existing implementations of QSVT rely on block…

With respect to the transversal gate group (an invariant of quantum codes), we demonstrate that non-additive codes can outperform stabilizer codes. We do this by constructing spin codes that correspond to permutation-invariant multiqubit…

The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient…

Fault-tolerant quantum computing demands decoders that are fast, accurate, and adaptable to circuit structure and realistic noise. While machine learning (ML) decoders have demonstrated impressive performance for quantum memory, their use…

After introducing a bit-plane quantum representation for a multi-image, we present a novel way to encrypt/decrypt multiple images using a quantum computer. Our encryption scheme is based on a two-stage scrambling of the images and of the…

The use of a few intermediate qutrits for efficient decomposition of 3-qubit unitary gates has been proposed, to obtain an exponential reduction in the depth of the decomposed circuit. An intermediate qutrit implies that a qubit is operated…

We develop the first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal $V$ basis. The $V$ basis is an alternative universal basis to the more commonly studied $\{H,T\}$ basis. We propose two…

Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this…

Preparing arbitrary logical states is a central primitive for universal fault-tolerant quantum computation and the cost of encoded-state preparation contributes directly to the overall resource overhead. This makes the synthesis of…

The application of high-dimensional quantum systems (qudits) in quantum computing and communications seems to be a promising avenue due to the possibility of increasing the amount of information encoded in one physical carrier. In this…