YFYuichiro Fujiwara

Yuichiro Fujiwara

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yuichiro Fujiwara has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes

    by Yu Tsunoda, Yuichiro Fujiwara, Hana Ando, Peter Vandendriessche

    An error-erasure channel is a simple noise model that introduces both errors and erasures. While the two types of errors can be corrected simultaneously with error-correcting codes, it is also known that any linear code allows for first correcting errors and then erasures in two-step decoding. In particular, a carefully designed parity-check matrix not only allows for separating erasures from errors but also makes it possible to efficiently correct erasures. The separating redundancy of a linear code is the number of parity-check equations in a smallest parity-check matrix that has the required property for this error-erasure separation. In a sense, it is a parameter of a linear code that represents the minimum overhead for efficiently separating erasures from errors. While several bounds on separating redundancy are known, there still remains a wide gap between upper and lower bounds except for a few limited cases. In this paper, using probabilistic combinatorics and design theory, we improve both upper and lower bounds on separating redundancy. We also show a relation between parity-check matrices for error-erasure separation and special matrices, called X-codes, for data compaction circuits in VLSI testing. This leads to an exponentially improved bound on the size of an optimal X-code.


  • Explicit bounds on the length of optimal X-codes

    by Yu Tsunoda, Yuichiro Fujiwara

    X-codes are linear maps with a special combinatorial property that generalizes superimposed codes, disjunct matrices, and cover-free families. In the context of circuit testing, a (t, n, d, x) X-code compresses n-bit output from the circuit under test into t bits while allowing for detecting the existence of up to d erroneous output bits even if up to x bits of the correct behavior are unknowable. A simple counting argument shows that a (t, n, d, x) X-code with t = O (log n) exists, where the coefficient of the logarithmic term when the base is 2 is at most 2x+1(d + x)ln 2 with In being the natural logarithm to base e. While there are also known constructions that provide X-codes with smaller t for given n and some specific d and x, no stronger general upper bounds on the smallest possible t that work for any d and x are available in the literature. Here, we derive general upper bounds in closed form that reduce the coefficient of the basic general bound to (x + 1)(d + x - 1)e ln 2. In terms of the highest achievable rate, our results exponentially improve the known asymptotic lower bound 1/(2x+1(d + x) ln2) to 1/((x + 1)(d + x - 1)e ln 2).


  • Open Access

    High-rate quantum low-density parity-check codes assisted by reliable qubits

    by Yuichiro Fujiwara, Alexander Gruner, Peter Vandendriessche

    Quantum error correction is an important building block for reliable quantum information processing. A challenging hurdle in the theory of quantum error correction is that it is significantly more difficult to design error-correcting codes with desirable properties for quantum information processing than for traditional digital communications and computation. A typical obstacle to constructing a variety of strong quantum error-correcting codes is the complicated restrictions imposed on the structure of a code. Recently, promising solutions to this problem have been proposed in quantum information science, where in principle any binary linear code can be turned into a quantum error-correcting code by assuming a small number of reliable quantum bits. This paper studies how best to take advantage of these latest ideas to construct desirable quantum error-correcting codes of very high information rate. Our methods exploit structured high-rate low-density parity-check codes available in the classical domain and provide quantum analogues that inherit their characteristic low decoding complexity and high error correction performance even at moderate code lengths. Our approach to designing high-rate quantum error-correcting codes also allows for making direct use of other major syndrome decoding methods for linear codes, making it possible to deal with a situation where promising quantum analogues of low-density parity-check codes are difficult to find.

  • High-Rate Quantum Low-Density Parity-Check Codes Assisted by Reliable Qubits

    by Yuichiro Fujiwara, Alexander Gruner, Peter Vandendriessche

    Quantum error correction is an important building block for reliable quantum information processing. A challenging hurdle in the theory of quantum error correction is that it is significantly more difficult to design error-correcting codes with desirable properties for quantum information processing than for traditional digital communications and computation. A typical obstacle to constructing a variety of strong quantum error-correcting codes is the complicated restrictions imposed on the structure of a code. Recently, promising solutions to this problem have been proposed in quantum information science, where in principle any binary linear code can be turned into a quantum error-correcting code by assuming a small number of reliable quantum bits. This paper studies how best to take advantage of these latest ideas to construct desirable quantum error-correcting codes of very high information rate. Our methods exploit structured high-rate low-density parity-check codes available in the classical domain and provide quantum analogues that inherit their characteristic low decoding complexity and high error correction performance even at moderate code lengths. Our approach to designing high-rate quantum error-correcting codes also allows for making direct use of other major syndrome decoding methods for linear codes, making it possible to deal with a situation where promising quantum analogues of low-density parity-check codes are difficult to find.


  • Open Access

    Ability of stabilizer quantum error correction to protect itself from its own imperfection

    by Yuichiro Fujiwara

    The theory of stabilizer quantum error correction allows us to actively stabilize quantum states and simulate ideal quantum operations in a noisy environment. It is critical is to correctly diagnose noise from its syndrome and nullify it accordingly. However, hardware that performs quantum error correction itself is inevitably imperfect in practice. Here, we show that stabilizer codes possess a built-in capability of correcting errors not only on quantum information but also on faulty syndromes extracted by themselves. Shor's syndrome extraction for fault-tolerant quantum computation is naturally improved. This opens a path to realizing the potential of stabilizer quantum error correction hidden within an innocent looking choice of generators and stabilizer operators that have been deemed redundant.

  • Open Access

    Ability of stabilizer quantum error correction to protect itself from its own imperfection

    by Yuichiro Fujiwara

    The theory of stabilizer quantum error correction allows us to actively stabilize quantum states and simulate ideal quantum operations in a noisy environment. It is critical to correctly diagnose noise from its syndrome and nullify it accordingly. However, hardware that performs quantum error correction itself is inevitably imperfect in practice. Here, we show that stabilizer codes possess a built-in capability to correct errors not only on quantum information but also on faulty syndromes extracted by themselves. Shor's syndrome extraction for fault-tolerant quantum computation is naturally improved. This opens a path to realizing the potential of stabilizer quantum error correction hidden within an innocent-looking choice of generators and stabilizer operators that have been deemed redundant.


  • Quantum Synchronizable Codes From Finite Geometries

    by Yuichiro Fujiwara, Peter Vandendriessche

    Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that, in principle, such a code can be constructed through a combination of a classical linear code and its subcode if the two are both cyclic and dual-containing. However, finding such classical codes that lead to promising quantum synchronizable error-correcting codes is not a trivial task. In fact, although there are two families of classical codes that are proved to produce quantum synchronizable codes with good minimum distances and highest possible tolerance against misalignment, their code lengths have been restricted to primes and Mersenne numbers. In this paper, examining the incidence vectors of projective spaces over the finite fields of characteristic 2, we give quantum synchronizable codes from cyclic codes whose lengths are not primes or Mersenne numbers. These projective geometric codes achieve good performance in quantum error correction and possess the best possible ability to recover synchronization, thereby enriching the variety of good quantum synchronizable codes. We also extend the current knowledge of cyclic codes in classical coding theory by explicitly giving generator polynomials of the finite geometric codes and completely characterizing the minimum weight nonzero codewords. In addition to the codes based on projective spaces, we carry out a similar analysis on the well-known cyclic codes from Euclidean spaces that are known to be majority logic decodable and determine their exact minimum distances.


  • Open Access

    Quantum synchronizable codes from finite geometries

    by Yuichiro Fujiwara, Peter Vandendriessche

    Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that in principle such a code can be constructed through a combination of a classical linear code and its subcode if the two are both cyclic and dual-containing. However, finding such classical codes that lead to promising quantum synchronizable error-correcting codes is not a trivial task. In fact, although there are two families of classical codes that are proved to produce quantum synchronizable codes with good minimum distances and highest possible tolerance against misalignment, their code lengths have been restricted to primes and Mersenne numbers. In this paper, examining the incidence vectors of projective spaces over the finite fields of characteristic $2$, we give quantum synchronizable codes from cyclic codes whose lengths are not primes or Mersenne numbers. These projective geometric codes achieve good performance in quantum error correction and possess the best possible ability to recover synchronization, thereby enriching the variety of good quantum synchronizable codes. We also extend the current knowledge of cyclic codes in classical coding theory by explicitly giving generator polynomials of the finite geometric codes and completely characterizing the minimum weight nonzero codewords. In addition to the codes based on projective spaces, we carry out a similar analysis on the well-known cyclic codes from Euclidean spaces that are known to be majority logic decodable and determine their exact minimum distances.

  • Open Access

    Quantum Synchronizable Codes From Quadratic Residue Codes and Their Supercodes

    by Yixuan Xie, Jinhong Yuan, Yuichiro Fujiwara

    Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes that satisfy special properties, only a few classes of cyclic codes have been proved to give promising quantum synchronizable codes. In this paper, using quadratic residue codes and their supercodes, we give a simple construction for quantum synchronizable codes whose synchronization capabilities attain the upper bound. The method is applicable to cyclic codes of prime length.

  • Open Access

    Using arbitrary parity-check matrices for quantum error correction assisted by less noisy qubits

    by Yuichiro Fujiwara

    Recently a framework for assisted quantum error correction was proposed in which a specific type of error is allowed to occur on auxiliary qubits, which is in contrast to standard entanglement assistance that requires noiseless auxiliary qubits. However, while the framework maintains the ability to import any binary or quaternary linear code without sacrificing active error correction power, it requires the code designer to turn a parity-check matrix of the underlying classical code into an equivalent one in standard form. This means that classical coding theoretic techniques that require parity-check matrices to be in specific form may not fully be exploitable. Another issue of the recently proposed scheme is that the error correction capabilities for bit errors and phase errors are generally equal, which is not ideal for asymmetric error models. This paper addresses these two problems. We generalize the framework in such a way that any parity-check matrix of any binary or quaternary linear code can be exploited. Our generalization also allows for importing a pair of distinct linear codes so that error correction capabilities become suitably asymmetric.