We propose two different implementations of an asymmetric two-output probabilistic quantum processor, which can implement a restricted set of one-qubit operations. One of them is constructed by combining asymmetric telecloning with a quantum gate array. We analyze the efficiency of this processor by evaluating the fidelities between the desired operation and the one generated by the processor and show that the two output states are the same as the ones produced by the optimal universal asymmetric Pauli cloning machine. The schemes require only local operations and classical communication, they have the advantage of transmitting the two output states directly to two spatially separated receivers but they have a success probability of 1/2. We show further that we can perform the same one-qubit operation with unity probability at the cost of using nonlocal operations. We finally generalize the two schemes for D-level systems and find that the local ones are successful with a probability of 1/D and the nonlocal generalized scheme is always successful.
By combining telecloning and programmable quantum gate array presented by Nielsen and Chuang [Phys.Rev.Lett. 79 :321(1997)], we propose a programmable quantum processor which can be programmed to implement restricted set of operations with several identical data outputs. The outputs are approximately-transformed versions of input data. The processor successes with certain probability.
While exact cloning of an unknown quantum state is prohibited by the linearity of quantum mechanics, approximate cloning is possible and has been used, e.g., to derive limits on the security of quantum communication protocols. In the case of asymmetric cloning, the information from the input state is distributed asymmetrically between the different output states. Here, we consider asymmetric phase-covariant cloning, where the goal is to optimally transfer the phase information from a single input qubit to different output qubits. We construct an optimal quantum cloning machine for two qubits t…
Quantum devices, from simple fixed-function tools to the ultimate goal of a universal quantum computer, will require high quality, frequent repetition of a small set of core operations, such as the preparation of entangled states. These tasks are perfectly suited to realisation by a co-processor or supplementary instruction set, as is common practice in modern CPUs. In this paper, we present two quintessentially quantum co-processor functions: production of a GHZ state, and implementation of optimal universal (asymmetric) quantum cloning. Both are based on the evolution of a fixed Hamiltonian.…
The trade-offs among various output fidelities of asymmetric universal cloning machines are investigated. First we find out all the attainable optimal output fidelities for the 1 to 3 asymmetric universal cloning machine and it turns out that there are two kinds of extremal asymmetric cloning machines which have to cooperate in order to achieve some of the optimal output fidelities. Second we construct a family of extremal cloning machines that includes the universal symmetric cloning machine as well as an asymmetric 1 to $1+N$ cloning machine for qudits with two different output fidelities su…
Random quantum sampling, a task to sample bit-strings from a random quantum circuit, is considered one of suitable benchmark tasks to demonstrate the outperformance of quantum computers even with noisy qubits. Recently, random quantum sampling was performed on the Sycamore quantum processor with 53 qubits [Nature 574, 505 (2019)] and on the Zuchongzhi quantum processor with 56 qubits [Phys. Rev. Lett. 127, 180501 (2021)]. Here, we analyze and compare statistical properties of the outputs of random quantum sampling by Sycamore and Zuchongzhi. Using the Marchenko-Pastur law and the Wasssertein d…
Accurate gap control of 3D-integrated superconducting quantum circuits using asymmetric indium architecture and multi-angle flip-chip bonding
Technical University of Munich（慕尼黑工业大学）；Walther-Meißner-Institut, Bayerische Akademie der Wissenschaften（瓦尔特·迈斯纳研究所，巴伐利亚科学院）；Peak Quantum GmbH（Peak量子有限公司）
We consider a scheme of quantum teleportation where a receiver has multiple (N) output ports and obtains the teleported state by merely selecting one of the N ports according to the outcome of the sender's measurement. We demonstrate that such teleportation is possible by showing an explicit protocol where N pairs of maximally entangled qubits are employed. The optimal measurement performed by a sender is the square-root measurement, and a perfect teleportation fidelity is asymptotically achieved for a large N limit. Such asymptotic teleportation can be utilized as a universal programmable pro…
We analyse a nonlinear optical system which uses cascaded nonlinearities to produce both second and fourth harmonic outputs from an input field at the fundamental frequency. Using fully quantum equations of motion, we show that the system produces quadrature squeezed outputs which exhibit bipartite entanglement, EPR-steering, and asymmetric steering across a two octave frequency range.
A universal programmable quantum processor uses program quantum states to apply an arbitrary quantum channel to an input state. We generalize the concept of a finite-dimensional programmable quantum processor to infinite dimension assuming an energy constraint on the input and output of the target quantum channels. By proving reductions to and from finite-dimensional processors, we obtain upper and lower bounds on the program dimension required to approximately implement energy-limited quantum channels. In particular, we consider the implementation of Gaussian channels. Due to their practical …
We consider generalizations of depolarizing channels to maps in which the identity channel is replaced by a convex combinations of unitary conjugations. We show that one can construct unital channels of this type for which the input which achieves maximal output purity is unique. We give conditions under which multiplicativity of the maximal p-norm and additivity of the minimal output entropy. We also show that the Holevo capacity need not equal log d - the minimal entropy as one might expect for a convex combination of unitary conjugations. Conversely, we give examples for which this conditio…
Quantum algorithms for Noisy Intermediate-Scale Quantum (NISQ) machines have recently emerged as new promising routes towards demonstrating near-term quantum advantage (or supremacy) over classical systems. In these systems samples are typically drawn from probability distributions which --- under plausible complexity-theoretic conjectures --- cannot be efficiently generated classically. Rather than first define a physical system and then determine computational features of the output state, we ask the converse question: given direct access to the quantum state, what features of the generating…
We investigate quantitatively the wave-particle duality in a general Mach-Zehnder interferometer setup with an asymmetric beam splitter. The asymmetric beam splitter introduces additional a priori which-path knowledge, which is different for a particle detected at one output port of the interferometer and a particle detected at the other. Accordingly, the fringe visibilities of the interference patterns emerging at the two output ports are also different. Hence, in sharp contrast with the symmetric case, here we should concentrate on one output port and distinguish two possible paths taken by …
Here, asymmetric phase-covariant quantum cloning machines are defined and trade-off between qualities of their outputs and its impact on entanglement properties of the outputs are studies. In addition, optimal families among these cloners are introduced and also their entanglement properties are investigated. An explicit proof of optimality is presented for the case of qubits, which is based on the no-signaling condition. Our optimality proof can also be used to derive an upper bound on trade-off relations for a more general class of optimal cloners which clone states on a specific orbit of th…
We prove a lemma which allows one to extend results about the additivity of the minimal output entropy from highly symmetric channels to a much larger class. A similar result holds for the maximal output $p$-norm. Examples are given showing its use in a variety of situations. In particular, we prove the additivity and the multiplicativity for the shifted depolarising channel.
Simulating the topological phases of matter in synthetic quantum simulators is a topic of considerable interest. Given the universality of digital quantum simulators, the prospect of digitally simulating exotic topological phases is greatly enhanced. However, it is still an open question how to realize digital quantum simulation of topological phases of matter. Here, using common single- and two-qubit elementary quantum gates, we propose and demonstrate an approach to design topologically protected quantum circuits on the current generation of noisy quantum processors where spin-orbital coupli…
A single four-level atom interacting with two-mode cavities is investigated. Under large detuning condition, we obtain the effective Hamiltonian which is unitary squeezing operator of two-mode fields. Employing the input-output theory, we find that the entanglement and squeezing of the output fields can be achieved. By analyzing the squeezing spectrum, we show that asymmetric detuning and asymmetric atomic initial state split the squeezing spectrum from one valley into two minimum values, and appropriate leakage of the cavity is needed for obtaining output entangled fields.
Superconducting quantum circuits are promising candidate for building scalable quantum computers. Here, we use a four-qubit superconducting quantum processor to solve a two-dimensional system of linear equations based on a quantum algorithm proposed by Harrow, Hassidim, and Lloyd [Phys. Rev. Lett. \textbf{103}, 150502 (2009)], which promises an exponential speedup over classical algorithms under certain circumstances. We benchmark the solver with quantum inputs and outputs, and characterize it by non-trace-preserving quantum process tomography, which yields a process fidelity of $0.837\pm0.006…
Agent-assisted experimental strategy transfer across quantum processors
College of Physics and Electronic Engineering, Center for Computational Sciences, Sichuan Normal University（四川师范大学物理与电子工程学院计算科学中心）；Shenzhen SpinQ Technology Co., Ltd.（深圳-spinq科技有限公司）；College of Physics and Optoelectronic Engineering, Shenzhen University（深圳大学物理与光电工程学院）
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms. In this paper, we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits…
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. In some cases, such as the adiabatic versions of Grover's search algorithm and Deutsch-Jozsa algorithm, applying the global adiabatic evolution yields a complexity similar to their classical algorithms. However, using the local adiabatic evolution, the algorithms given by J. Roland and N. J. Cerf for Grover's search [ Phys. Rev. A. {\bf 65} 0423…
We show that the distribution of information at the output of the quantum cloner can be efficiently controlled via preparation of the quantum cloner. We present a universal cloning network with the help of which asymmetric cloning can be performed.
Using Grover algorithm, this work investigates a technique for encoding search phrases used in wildcard searches. The technique involves creating a phase Oracle that loads data into a quantum circuit together with the search terms that have been encoded. The method entails constructing a phase Oracle programmatically using encoded input information and encoded search terms. By combining Grover diffusion operator with the phase Oracle, Hadamard gates, and zero-initialized three-qubit states, a complete quantum circuit is created. Trapped ion and superconducting qubit quantum computers, which we…
An asymmetric multi-quantum state magnetic lattice is proposed to host excitons formed in a quantum degenerate gas of ultracold fermionic atoms to simulate Bose-Einstein condensation (BEC) of excitons. A Quasi-two dimensional degenerate gas of excitons can be collected in the in-plane asymmetric magnetic bands created at the surface of the proposed magnetic lattice, where the ultracold fermions simulate separately direct and indirect confined electronhole pairs (spin up fermions-spin down fermions) rising to the statistically degenerate Bose gas and eventually through controlled tunnelling to …
We describe a digital microwave platform called Presto, designed for measurement and control of multiple quantum bits (qubits) and based on the third-generation radio-frequency system on a chip. Presto uses direct digital synthesis to create signals up to 9 GHz on 16 synchronous output ports, while synchronously analyzing response on 16 input ports. Presto has 16 DC-bias outputs, 4 inputs and 4 outputs for digital triggers or markers, and two continuous-wave outputs for synthesizing frequencies up to 15 GHz. Scaling to a large number of qubits is enabled through deterministic synchronization o…
We consider the optimization of the work output and fluctuations of a finite-time quantum Otto heat engine cycle consisting of compression and expansion work strokes of unequal duration. The asymmetry of the cycle is characterized by a parameter $r_u$ giving the ratio of the times for the compression and expansion work strokes. For such an asymmetric quantum Otto engine cycle, with working substance chosen as a harmonic oscillator or a two-level system, we find that the optimal values of $r_u$ maximising the work output and the reliability (defined as the ratio of average work output to its st…
Quantum computing crucially relies on the ability to efficiently characterize the quantum states output by quantum hardware. Conventional methods which probe these states through direct measurements and classically computed correlations become computationally expensive when increasing the system size. Quantum neural networks tailored to recognize specific features of quantum states by combining unitary operations, measurements and feedforward promise to require fewer measurements and to tolerate errors. Here, we realize a quantum convolutional neural network (QCNN) on a 7-qubit superconducting…
We have integrated single and coupled superconducting transmon qubits into flip-chip modules. Each module consists of two chips -- one quantum chip and one control chip -- that are bump-bonded together. We demonstrate time-averaged coherence times exceeding $90\,μs$, single-qubit gate fidelities exceeding $99.9\%$, and two-qubit gate fidelities above $98.6\%$. We also present device design methods and discuss the sensitivity of device parameters to variation in interchip spacing. Notably, the additional flip-chip fabrication steps do not degrade the qubit performance compared to our baseline s…
Cryogenic Multiplexing Control Chip for Superconducting Quantum Processor
Tsinghua University（清华大学）；Beijing National Research Center for Information Science and Technology（北京信息科学与技术国家研究中心）；Beijing Innovation Center for Future Chips, Tsinghua University（清华大学未来芯片创新中心）
We study machines that take N identical replicas of a pure qudit state as input and output a set of M_A clones of a given fidelity and another set of $M_B$ clones of another fidelity. The trade-off between these two fidelities is investigated, and numerous examples of optimal N -> M_A+M_B cloning machines are exhibited using a generic method. A generalisation to more than two sets of clones is also discussed. Finally, an optical implementation of some such machines is proposed. This paper is an extended version of [xxx.arxiv.org/abs/quant-ph/0411179].
Split-execution computing leverages the capabilities of multiple computational models to solve problems, but splitting program execution across different computational models incurs costs associated with the translation between domains. We analyze the performance of a split-execution computing system developed from conventional and quantum processing units (QPUs) by using behavioral models that track resource usage. We focus on asymmetric processing models built using conventional CPUs and a family of special-purpose QPUs that employ quantum computing principles. Our performance models account…
Quantum computers promise to solve certain problems that are intractable for classical computers, such as factoring large numbers and simulating quantum systems. To date, research in quantum computer engineering has focused primarily at opposite ends of the required system stack: devising high-level programming languages and compilers to describe and optimize quantum algorithms, and building reliable low-level quantum hardware. Relatively little attention has been given to using the compiler output to fully control the operations on experimental quantum processors. Bridging this gap, we propos…
Experiments conducted on open-access cloud-based IBM Quantum devices are presented for characterizing their fault tolerance using $[4,2,2]$-encoded gate sequences. Up to 100 logical gates are activated in the IBMQ Bogota and IBMQ Santiago devices and we found that a $[4,2,2]$ code's logical gate set may be deemed fault-tolerant for gate sequences larger than 10 gates. However, certain circuits did not satisfy the fault tolerance criterion. In some cases, the encoded-gate sequences show a high error rate that is lower bounded at $\approx 0.1$, whereby the error inherent in these circuits cannot…
Quantum supremacy is the ability of quantum processors to outperform classical computers at certain tasks. In digital random quantum circuit approaches for supremacy, the output distribution produced is described by the Porter-Thomas (PT) distribution. In this regime, the system uniformly explores its entire Hilbert space, which makes simulating such quantum dynamics with classical computational resources impossible for large systems. However, the latter has no direct application so far in solving a specific problem. In this work, we show that the same sampling complexity can be achieved from …
