Related papers: Direct experimental verification of quantum commut…
In many physically realistic models of quantum computation, Pauli exchange interactions cause a subset of two-qubit errors to occur as a first order effect of couplings within the computer, even in the absence of interactions with the…
Quantum logic gates can perform calculations much more efficiently than their classical counterparts. However, the level of control needed to obtain a reliable quantum operation is correspondingly higher. In order to evaluate the…
We introduce a notion of commutativity between operators on a tensor product space, nominally Pauli strings on qubits, that interpolates between qubit-wise commutativity and (full) commutativity. We apply this notion, which we call…
We present a method to test quantum behavior of quantum information processing devices, such as quantum memories, teleportation devices, channels and quantum key distribution protocols. The test of quantum behavior can be phrased as the…
We present a tomographic protocol for the characterization of multiqubit quantum channels. We discuss a specific class of input states, for which the set of Pauli measurements at the output of the channel directly relates to its Pauli…
We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…
Relational verification of quantum programs has many potential applications in quantum and post-quantum security and other domains. We propose a relational program logic for quantum programs. The interpretation of our logic is based on a…
As the method to completely characterize quantum dynamical processes, quantum process tomography (QPT) is vitally important for quantum information processing and quantum control, where the faithfulness of quantum devices plays an essential…
The quantum weak value draws many attentions recently from theoretical curiosity to experimental applications. Now we design an unusual weak measuring procedure as the pre-selection, mid-selection and post-selection to study the correlation…
We perform comprehensive experimental tests of various composite pulse sequences using one of open-access IBM's quantum processors, based on superconducting transmon qubits. We implement explicit pulse control of the qubit by making use of…
We study measurements of the unitary generalization of Pauli operators. First, an analytical (constructive) solution to the eigenproblem of these operators is presented. Next, in the case of two subsystems, the Schmidt form of the…
While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable…
In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it…
Uncertainty relations for Hermitian operators have been confirmed through many experiments. However, previous experiments have only tested the special case of non-Hermitian operators, i.e., uncertainty relations for unitary operators. In…
Intermediate-scale quantum devices are becoming more reliable, and may soon be harnessed to solve useful computational tasks. At the same time, common classical methods used to verify their computational output become intractable due to a…
The most promising applications of quantum computing are centered around solving search and optimization tasks, particularly in fields such as physics simulations, quantum chemistry, and finance. However, the current quantum software…
We demonstrate that conditional as well as unconditional basic operations which are prerequisite for universal quantum gates can be performed with almost 100% fidelity within a strongly interacting two-electron quantum ring. Both sets of…
The Pauli strings appearing in the decomposition of an operator can be can be grouped into commuting families, reducing the number of quantum circuits needed to measure the expectation value of the operator. We detail an algorithm to…
In this paper, we address the problem of discriminating two given quantum operations. Firstly, based on the Bloch representation of single qubit systems, we give the exact minimum error probability of discriminating two single qubit quantum…
We present two measures of distance between quantum processes based on the superfidelity, introduced recently to provide an upper bound for quantum fidelity. We show that the introduced measures partially fulfill the requirements for…