Related papers: Quantum State Preparation Using an Exact CNOT Synt…

Quantum hashing is a useful technique that allows us to construct memory-efficient algorithms and secure quantum protocols. First, we present a circuit that implements the phase form of quantum hashing using $2^{n-1}$ CNOT gates, where n is…

We construct optimized implementations of the CNOT and other universal two-qubit gates that, unlike many of the previously proposed protocols, are carried out in a single step. The new protocols require tunable inter-qubit couplings but, in…

The leading paradigm for performing computation on quantum memories can be encapsulated as distill-then-synthesize. Initially, one performs several rounds of distillation to create high-fidelity magic states that provide one good T gate, an…

In this paper, we present an algorithm for preparing quantum states of the form $\sum_{i=0}^{n-1} \alpha_i |i\rangle$, where the coefficients $\alpha_i$ are specified by a quantum oracle. Our method achieves this task twice as fast as the…

We will call a pure qubit state real if all its amplitudes are real numbers. We show that any real 3-qubit state can be prepared using $R_y(\theta)$ gates and at most four controlled-$Z$ gates, and we conjecture that four is optimal. We…

A computational problem fed into a gate-model quantum computer identifies an objective function with a particular computational pathway (objective function connectivity). The solution of the computational problem involves identifying a…

We present a novel approach for efficient preparation of electronic ground states, leveraging the optimizer ExcitationSolve [J\"ager et al., Comm. Phys. (2025)] and established variational quantum eigensolver-based operator selection…

Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state,…

We generalize the Approximate Quantum Compiling algorithm into a new method for CNOT-depth reduction, which is apt to process wide target quantum circuits. Combining this method with state-of-the-art techniques for error mitigation and…

We present short-depth circuits to deterministically prepare any Dicke state |Dn,k>, which is the equal-amplitude superposition of all n-qubit computational basis states with Hamming Weight k. Dicke states are an important class of…

We provide a simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm. This algorithm is used in the context of the trapped-ions technology. We derive theoretical lower bounds for the number of…

Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is…

Variational quantum algorithms are believed to be promising for solving computationally hard problems and are often comprised of repeated layers of quantum gates. An example thereof is the quantum approximate optimization algorithm (QAOA),…

Several prominent quantum computing algorithms--including Grover's search algorithm and Shor's algorithm for finding the prime factorization of an integer--employ subcircuits termed 'oracles' that embed a specific instance of a mathematical…

We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give…

This paper introduces an algorithm designed to approximate quantum transformation matrix with a restricted number of gates by using the block decomposition technique. Addressing challenges posed by numerous gates in handling large qubit…

While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum…

In scenarios where full access to all qubits of a multipartite quantum system is available and global operations can be implemented, the preparation of arbitrary entangled states is theoretically straightforward. However, practical…

Compared to general quantum states, the sparse states arise more frequently in the field of quantum computation. In this work, we consider the preparation for $n$-qubit sparse quantum states with $s$ non-zero amplitudes and propose two…

Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…