Related papers: Efficient Quantum Circuits for Non-Unitary and Uni…
The accurate evaluation of diagonal unitary operators is often the most resource-intensive element of quantum algorithms such as real-space quantum simulation and Grover search. Efficient circuits have been demonstrated in some cases but…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
Discrete-time quantum walks with position-dependent coin operators have numerous applications. For a position dependence that is sufficiently smooth, it has been provided in Ref. [1] an approximate quantum-circuit implementation of the coin…
The quantum circuit synthesis problem bridges quantum algorithm design and quantum hardware implementation in the Noisy Intermediate-Scale Quantum (NISQ) era. In quantum circuit synthesis problems, diagonal unitary synthesis plays a crucial…
Realizing non-unitary transformations on unitary-gate based quantum devices is critically important for simulating a variety of physical problems including open quantum systems and subnormalized quantum states. We present a dilation based…
The execution of quantum circuits on real systems has largely been limited to those which are simply time-ordered sequences of unitary operations followed by a projective measurement. As hardware platforms for quantum computing continue to…
Current noisy intermediate-scale quantum (NISQ) devices can only execute small circuits with shallow depth, as they are still constrained by the presence of noise: quantum gates have error rates and quantum states are fragile due to…
Constructing general programmable circuits to be able to run any given unitary operator efficiently on a quantum processor is of fundamental importance. We present a new quantum circuit design technique resulting two general programmable…
The aim of this paper is to build quantum circuits that implement discrete-time quantum walks having an arbitrary position-dependent coin operator. The position of the walker is encoded in base 2: with $n$ wires, each corresponding to one…
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…
We introduce a hybrid quantum-classical framework for efficiently implementing approximate unitary dilations of non-unitary operators with enhanced noise resilience. The method embeds a target non-unitary operator into a subblock of a…
In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimize the execution time (the depth) for a class of circuits…
Solving partial differential equations for extremely large-scale systems within a feasible computation time serves in accelerating engineering developments. Quantum computing algorithms, particularly the Hamiltonian simulations, present a…
Electronic structure simulation is an anticipated application for quantum computers. Due to high-dimensional quantum entanglement in strongly correlated systems, the quantum resources required to perform such simulations are far beyond the…
Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…
Circulant matrices are an important family of operators, which have a wide range of applications in science and engineering related fields. They are in general non-sparse and non-unitary. In this paper, we present efficient quantum circuits…
Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an…
Variational quantum algorithms are a promising class of algorithms that can be performed on currently available quantum computers. In most settings, the free parameters of a variational circuit are optimized using a classical optimizer that…
A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, as well as all one-qubit…