Benchmarking verified logic operations for fault tolerance

Kavli Affiliate: Irfan Siddiqi | First 5 Authors: Akel Hashim, Stefan Seritan, Timothy Proctor, Kenneth Rudinger, Noah Goss | Summary: The promise of quantum computing depends upon the eventual achievement of fault-tolerant quantum error correction, which requires that the total rate of errors falls below some threshold. However, most contemporary methods for benchmarking noisy quantum […]


Continue.. Benchmarking verified logic operations for fault tolerance

Benchmarking quantum logic operations for achieving fault tolerance

Kavli Affiliate: Irfan Siddiqi | First 5 Authors: Akel Hashim, Stefan Seritan, Timothy Proctor, Kenneth Rudinger, Noah Goss | Summary: Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates — defined via the diamond […]


Continue.. Benchmarking quantum logic operations for achieving fault tolerance

Benchmarking quantum logic operations relative to thresholds for fault tolerance

Kavli Affiliate: Irfan Siddiqi | First 5 Authors: Akel Hashim, Stefan Seritan, Timothy Proctor, Kenneth Rudinger, Noah Goss | Summary: Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates — defined via the diamond […]


Continue.. Benchmarking quantum logic operations relative to thresholds for fault tolerance

Demonstrating scalable randomized benchmarking of universal gate sets

Kavli Affiliate: Irfan Siddiqi | First 5 Authors: Jordan Hines, Marie Lu, Ravi K. Naik, Akel Hashim, Jean-Loup Ville | Summary: Randomized benchmarking (RB) protocols are the most widely used methods for assessing the performance of quantum gates. However, the existing RB methods either do not scale to many qubits or cannot benchmark a universal […]


Continue.. Demonstrating scalable randomized benchmarking of universal gate sets

Demonstrating scalable randomized benchmarking of universal gate sets

Kavli Affiliate: Irfan Siddiqi | First 5 Authors: Jordan Hines, Marie Lu, Ravi K. Naik, Akel Hashim, Jean-Loup Ville | Summary: Randomized benchmarking (RB) protocols are the most widely used methods for assessing the performance of quantum gates. However, the existing RB methods either do not scale to many qubits or cannot benchmark a universal […]


Continue.. Demonstrating scalable randomized benchmarking of universal gate sets

Imaging Quantum Interference in Stadium-Shaped Monolayer and Bilayer Graphene Quantum Dots

Kavli Affiliate: Michael F. Crommie | First 5 Authors: Zhehao Ge, Dillon Wong, Juwon Lee, Frederic Joucken, Eberth A. Quezada-Lopez | Summary: Experimental realization of graphene-based stadium-shaped quantum dots (QDs) have been few and incompatible with scanned probe microscopy. Yet, direct visualization of electronic states within these QDs is crucial for determining the existence of […]


Continue.. Imaging Quantum Interference in Stadium-Shaped Monolayer and Bilayer Graphene Quantum Dots

SHREC’22 Track: Sketch-Based 3D Shape Retrieval in the Wild

Kavli Affiliate: Feng Wang | First 5 Authors: Jie Qin, Shuaihang Yuan, Jiaxin Chen, Boulbaba Ben Amor, Yi Fang | Summary: Sketch-based 3D shape retrieval (SBSR) is an important yet challenging task, which has drawn more and more attention in recent years. Existing approaches address the problem in a restricted setting, without appropriately simulating real […]


Continue.. SHREC’22 Track: Sketch-Based 3D Shape Retrieval in the Wild

An On-demand Photonic Ising Machine with Simplified Hamiltonian Calculation by Phase-encoding and Intensity Detection

Kavli Affiliate: Xiang Zhang | First 5 Authors: Jiayi Ouyang, Yuxuan Liao, Zhiyao Ma, Deyang Kong, Xue Feng | Summary: Photonic Ising machine is a new paradigm of optical computing, which is based on the characteristics of light wave propagation, parallel processing and low loss transmission. Thus, the process of solving the combinatorial optimization problems […]


Continue.. An On-demand Photonic Ising Machine with Simplified Hamiltonian Calculation by Phase-encoding and Intensity Detection

An On-demand Photonic Ising Machine with Simplified Hamiltonian Calculation by Phase-encoding and Intensity Detection

Kavli Affiliate: Xiang Zhang | First 5 Authors: Jiayi Ouyang, Yuxuan Liao, Zhiyao Ma, Deyang Kong, Xue Feng | Summary: The photonic Ising machine is a new paradigm of optical computing that takes advantage of the unique properties of light wave propagation, parallel processing, and low-loss transmission. Thus, the process of solving combinatorial optimization problems […]


Continue.. An On-demand Photonic Ising Machine with Simplified Hamiltonian Calculation by Phase-encoding and Intensity Detection

An On-demand Photonic Ising Machine with Simplified Hamiltonian Calculation by Phase encoding and Intensity Detection

Kavli Affiliate: Xiang Zhang | First 5 Authors: Jiayi Ouyang, Yuxuan Liao, Zhiyao Ma, Deyang Kong, Xue Feng | Summary: The photonic Ising machine is a new paradigm of optical computing that takes advantage of the unique properties of light wave propagation, parallel processing, and low-loss transmission. Thus, the process of solving combinatorial optimization problems […]


Continue.. An On-demand Photonic Ising Machine with Simplified Hamiltonian Calculation by Phase encoding and Intensity Detection