Searcharxiv⌕ Search

arXiv subjects

Junichiro Kadomoto

Publications and source records attributed to Junichiro Kadomoto.

4 recordsLinked to original sources

Optimal Measurement Rounds for Perfect Encoded Fusion

Encoded fusion combines probabilistic physical fusions to perform a logical Bell measurement. Adaptive choices depend on earlier measurement outcomes and therefore require multiple measurement rounds. We determine the minimum worst-case number of rounds for perfect fusion of two blocks of an irreducible [[n,1]] stabilizer code. A strategy is perfect if the logical Bell measurement succeeds on every branch containing at least one successful physical fusion. Even after fixing the past history, including measurement values, we consider all success/failure branches, including those with zero probability for a particular input state or measurement device. In a lossless model with fixed coordinate pairing, arbitrary Pauli failure bases, and each pair fused exactly once, the optimum equals the minimum root eccentricity over the local complementation orbit of rooted graphs representing the code. The lower bound applies to arbitrary perfect strategies that choose batches and bases using previous outcomes. We also characterize the batch sequences that can occur on an all-failure branch of a perfect strategy by a necessary and sufficient graph adjacency condition. A matching strategy fuses distance layers from the outside in and, after the first success, completes the remaining fusions in at most one further round by changing the failure bases along an induced path.

quant-ph↗

LLM Agent-Based Design of RISC-V CPUs with FPGA-in-the-Loop Evaluation

Long-run RTL simulation of CPU candidates can take hours, while short diagnostic runs may miss performance degradation that emerges later in execution. This evaluation cost can delay design decisions in LLM-agent-based CPU development. We present a development environment in which LLM agents implement CPU candidates on an FPGA and use on-board performance measurements to guide design decisions. We applied it to the human-supervised development of a single-cycle RV32I core into a three-wide out-of-order RV32IM core. The final design reaches 5.61 CoreMark/MHz at 130 MHz on a Artix-7 FPGA. For the same CPU candidate running 8,000 CoreMark iterations, FPGA evaluation, including implementation, was 9.6x faster than single-threaded RTL simulation. In one case, board measurements revealed long-run performance degradation in a candidate that improved in a short diagnostic run. The result guided candidate selection and led to RTL-based root-cause analysis and a fix.

cs.AR↗

Morph-Aware Computing: Compiler-Ordered Updates of Program State after Topology Changes

In wireless sensor and mesh networks, modular robots, and shape-adaptive computers, computing modules attach, detach, or are replaced while the others keep running with their local state. A value computed under the old arrangement, such as a cached next hop, stays in memory but may no longer describe the current one, so a program can send to a neighbor that has left without any runtime errors. We present morph-aware computing, a programming model in which the application specifies a corrective update of such state, called a repair, and the compiler decides when it runs. In MorphLang, the repair is a Reconfigure branch next to the ordinary branches that handle sends, receives, and sensor samples. MorphC compiles MorphLang to bare-metal RISC-V and inserts a guard before every ordinary branch, so that each module repairs its state before any other branch sees a new topology. Relying on this order, MorphC also rejects sends whose target may be a literal or a value the repair does not always refresh. For a model of the code MorphC generates, we prove in Rocq that the repair precedes every later ordinary branch for any number of roles and topology changes. This shows that send-target checking is sound for a core language. On 19 MorphLang programs derived from seven network stacks, removing the repair worsens destination validity in ten of the 13 programs that declare one and never improves it. In a reduced reproduction of a released Contiki-NG defect, a callback-based version sends to a departed parent after 60 of 384 changes and the MorphLang version after none. The guards cost 12 cycles per loop in a microbenchmark, and on an FPGA the delay from each commit to the first send to the new neighbor matches RTL simulation.

cs.PL↗

Design of a Quantum Error Correction Decoder Exploiting Temporal Parallelism

In the pursuit of fault-tolerant quantum computing, low-latency quantum error correction (QEC) is essential to prevent rapid error accumulation within the syndrome measurement cycle. In this work, we propose a microarchitecture that implements the sandwich decoding method using the Union-Find algorithm by exploiting temporal parallelism, and we present an ASIC implementation. Through logic synthesis and simulation, we show that the proposed decoder achieves an average latency reduction of 35% at code distance d = 21 compared with a conventional batch Union-Find decoder, while maintaining a comparable logical error threshold of approximately 1.5% under phenomenological noise.

quant-ph↗