Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Three step implementation of any unitary matrix with complete graph of n qubits

Amara Katabarwa, Michael R. Geller

Published Mar 17, 2016• 0 citations
OpenAlex

Related papers

Three-step implementation of any n×n unitary with a complete graph of n qubits

Amara Katabarwa, Michael R. Geller

Quantum computation with a complete graph of superconducting qubits has been recently proposed, and applications to amplitude amplification, phase estimation, and the simulation of realistic atomic collisions given [Phys. Rev. A 91, 062309 (2015)]. This single-excitation-subspace (SES) approach does not require error correction and is practical now. Previously it was shown how to implement symmetric $n\ifmmode\times\else\texttimes\fi{}n$ unitaries in a single step, but not general unitaries. Here we show that any element in the unitary group $\mathrm{U}(n)$ can be executed in no more than three steps, for any $n$. This enables the implementation of highly complex operations in constant time and, in some cases, even allows for the compilation of an entire algorithm down to only three operations. By using this protocol we show how to prepare any pure state of an SES chip in three steps and also how to compute, for a given SES state $\ensuremath{\rho}$, the expectation value $\mathrm{Tr}(\ensuremath{\rho}O)$ of any $n\ifmmode\times\else\texttimes\fi{}n$ Hermitian observable $O$ in a constant number of steps.

arXiv:1509.04621•Physical Review A•Sep 4, 2015•2 citations

Direct implementation of an N-qubit controlled-unitary gate in a single step

Preethika Kumar

Quantum Information Processing•Aug 13, 2012•15 citations

Benchmarking multi-qubit gates -- II: Computational aspects

Bharath Hebbe Madhusudhana

An important step in developing multi-qubit gates is to construct efficient benchmarking protocols for them. In our previous paper (arXiv: 2210.04330), we developed metrological protocols to measure the reduced Choi matrix i.e., the completely positive (CP) maps induced on a subset S of the qubits, by the multi-qubit gate. Here, we show a set of classically verifiable properties that the Choi matrix satisfies if it is a reduction of a multi-qubit unitary and use them to develop benchmarks. We identify three types of errors that affect the implementation of a multi-qubit unitary, based on their mathematical properties and physical origin. Although a target multi-qubit gate is a unitary operator, errors turn it into a general completely positive (CP) map. Errors due to coupling to a thermal bath result in the multi-qubit gate being CP-divisible (Markovian), deviating from a unitary. The reduced Choi matrix of a multi-qubit gate has a property known as double stochasticity, which is violated in the presence of Markovian errors. We construct a benchmark using double-stochasticity violation and show that it is sensitive to coupling to any thermal bath at a finite temperature. Further, errors due to shot-to-shot fluctuations result in a non-markovian, i.e., CP-indivisible quantum process. We prove a new property, which we call the \rank property of the reduced Choi matrix, the violation of which implies a CP-indivisible error. A third category of errors comes from systematics in the implementation of a multi-qubit gate, resulting in no deviation from unitarity. We refer to this as unitary errors. This corresponds to the most challenging type of error to benchmark. We develop a partial-benchmarking protocol for such errors using symmetries of the multi-qubit gate being applied.

arXiv:2301.07109•Jan 17, 2023•2 citations

One-step Implementation of Two-qubit logic Gates

徐晶

量子光学学报•Jan 1, 2006•0 citations

A qubit realization of O(N) sigma models

Hersh Singh

•Jun 1, 2019•0 citations

Implementing Quantum Gates With Length-3 Dynamic Graphs

Ibukunoluwa Adebimpe Adisa

The continuous-time quantum walk is a quantum version of a random walk that evolves by Schrodinger's equation. With the Hamiltonian equal to the adjacency matrix of a sequence of graphs, called a dynamic graph, continuous-time quantum walks have been shown to implement quantum gates, including the T gate, Hadamard gate, and the Controlled{NOT gate. Since these gates make up a universal set of quantum gates, they can implement any other arbitrary quantum gate up to an arbitrary approximation. This process, however, can be tedious and ine cient. To alleviate this, we have developed a parameterized dynamic graph on which a continuous-time quantum walk can implement any arbitrary single-qubit quantum gate, and we have also extended this result to implement any two-qubit controlled-unitary quantum gate. These dynamic graphs have at most length three. Using these, we implemented Draper's quantum addition circuit, which is based on the quantum Fourier transform, using a continuous-time quantum walk on a dynamic graph.

•May 4, 2021•0 citations
Quantum computation with a complete graph of superconducting qubits has been recently proposed, and applications to amplitude amplification, phase estimation, and the simulation of realistic atomic collisions given [Phys. Rev. A 91, 062309 (2015)]. This single-excitation-subspace (SES) approach does not require error correction and is practical now. Previously it was shown how to implement symmetric $n\ifmmode\times\else\texttimes\fi{}n$ unitaries in a single step, but not general unitaries. Here we show that any element in the unitary group U(n)\mathrm{U}(n)U(n) can be executed in no more than three steps, for any nnn. This enables the implementation of highly complex operations in constant time and, in some cases, even allows for the compilation of an entire algorithm down to only three operations. By using this protocol we show how to prepare any pure state of an SES chip in three steps and also how to compute, for a given SES state $\ensuremath{\rho}$, the expectation value $\mathrm{Tr}(\ensuremath{\rho}O)$ of any $n\ifmmode\times\else\texttimes\fi{}n$ Hermitian observable OOO in a constant number of steps.
An important step in developing multi-qubit gates is to construct efficient benchmarking protocols for them. In our previous paper (arXiv: 2210.04330), we developed metrological protocols to measure the reduced Choi matrix i.e., the completely positive (CP) maps induced on a subset S of the qubits, by the multi-qubit gate. Here, we show a set of classically verifiable properties that the Choi matrix satisfies if it is a reduction of a multi-qubit unitary and use them to develop benchmarks. We identify three types of errors that affect the implementation of a multi-qubit unitary, based on their mathematical properties and physical origin. Although a target multi-qubit gate is a unitary operator, errors turn it into a general completely positive (CP) map. Errors due to coupling to a thermal bath result in the multi-qubit gate being CP-divisible (Markovian), deviating from a unitary. The reduced Choi matrix of a multi-qubit gate has a property known as double stochasticity, which is violated in the presence of Markovian errors. We construct a benchmark using double-stochasticity violation and show that it is sensitive to coupling to any thermal bath at a finite temperature. Further, errors due to shot-to-shot fluctuations result in a non-markovian, i.e., CP-indivisible quantum process. We prove a new property, which we call the \rank property of the reduced Choi matrix, the violation of which implies a CP-indivisible error. A third category of errors comes from systematics in the implementation of a multi-qubit gate, resulting in no deviation from unitarity. We refer to this as unitary errors. This corresponds to the most challenging type of error to benchmark. We develop a partial-benchmarking protocol for such errors using symmetries of the multi-qubit gate being applied.
The continuous-time quantum walk is a quantum version of a random walk that evolves by Schrodinger's equation. With the Hamiltonian equal to the adjacency matrix of a sequence of graphs, called a dynamic graph, continuous-time quantum walks have been shown to implement quantum gates, including the T gate, Hadamard gate, and the Controlled{NOT gate. Since these gates make up a universal set of quantum gates, they can implement any other arbitrary quantum gate up to an arbitrary approximation. This process, however, can be tedious and ine cient. To alleviate this, we have developed a parameterized dynamic graph on which a continuous-time quantum walk can implement any arbitrary single-qubit quantum gate, and we have also extended this result to implement any two-qubit controlled-unitary quantum gate. These dynamic graphs have at most length three. Using these, we implemented Draper's quantum addition circuit, which is based on the quantum Fourier transform, using a continuous-time quantum walk on a dynamic graph.