{'fraction_non_alphanumeric': 0.022156573116691284, 'fraction_numerical': 0.0103397341211226, 'mean_word_length': 4.794871794871795, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Loss tolerance with a concatenated graph state

A new way of addressing loss errors is introduced which combines ideas from measurement-based quantum computation and concatenated quantum codes, allowing for universal quantum computation. It is shown that for the case where qubit loss is detected upon measurement, the scheme performs well under 23% loss rate. For loss rates below 10% this approach performs better than the best scheme known up to date [1]. If lost qubits are tagged prior to measurement, it can tolerate up to 50% loss. The overhead per logical qubit is shown to be significantly lower than other schemes. The obtention of the threshold is entirely analytic.