Related papers: Quantum querying based on multicontrolled Toffoli …
We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal…
The prime objective of this study is to seek a circuit diagram for a multi-inputs Toffoli gate including only single qubit gates and CNOTs. In this regard, we have developed two variational quantum algorithms that can be used to implement a…
Quantum algorithms provide a promising framework in high-energy physics, in particular, for unraveling the causal configurations of multiloop Feynman diagrams by identifying Feynman propagators with qubits, a challenge analogous to querying…
MQuantum algorithms of matrix operations are of great significance in many fields in science and technology. In this paper, by leveraging multi-qubit Toffoli gates and basic single-qubit operations, the quantum algorithms of matrix…
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications…
The first application of a quantum algorithm to Feynman loop integrals is reviewed. The connection between quantum computing and perturbative quantum field theory is feasible due to fact that the two on-shell states of a Feynman propagator…
The building blocks of quantum algorithms and software are quantum gates, with the appropriate combination of quantum gates leading to a desired quantum circuit. Deep expert knowledge is necessary to discover effective combinations of…
We propose a new quantum circuit for the quantum search problem. The quantum circuit is superior to Grover's algorithm in some realistic cases. The reasons for the superiority are in short as follows: In the quantum circuit proposed in this…
We show a significant reduction of the number of quantum operations and the improvement of the circuit depth for the realization of the Toffoli gate by using qudits. This is done by establishing a general relation between the dimensionality…
Implementing quantum operations in the form of natural Hamiltonian dynamics is desirable, since they almost require no external control or feedback. In this work, we propose a NISQ-friendly quantum-classical hybrid approach to designing a…
An overview of a quantum algorithm application for the identification of causal singular configurations of multiloop Feynman diagrams is presented. The quantum algorithm is implemented in two different quantum simulators, the output…
Algorithms for quantum information processing are usually decomposed into sequences of quantum gate operations, most often realized with single- and two- qubit gates[1]. While such operations constitute a universal set for quantum…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…
Resource consumption is an important issue in quantum information processing, particularly during the present NISQ era. In this paper, we investigate resource optimization of implementing multiple controlled operations, which are…
Quantum computing has the potential to solve many complex algorithms in the domains of optimization, arithmetics, structural search, financial risk analysis, machine learning, image processing, and others. Quantum circuits built to…
We generalize quantum circuits for the Toffoli gate presented by Selinger and Jones for functionally controlled NOT gates, i.e., $X$ gates controlled by arbitrary $n$-variable Boolean functions. Our constructions target the gate set…
We study the achievements of quantum circuits comprised of several one- and two-qubit gates. Quantum process matrices are determined for the basic one- and two-qubit gate operations and concatenated to yield the process matrix of the…
Quantum algorithms are a very promising field. However, creating and manipulating these kind of algorithms is a very complex task, specially for software engineers used to work at higher abstraction levels. The work presented here is part…
To build a general-purpose quantum computer, it is crucial for the quantum devices to implement classical boolean logic. A straightforward realization of quantum boolean logic is to use auxiliary qubits as intermediate storage. This…
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel…