| Project/Area Number |
26610036
|
|---|
| Research Category |
Grant-in-Aid for Challenging Exploratory Research
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Foundations of mathematics/Applied mathematics
|
|---|
| Research Institution | Chubu University (2015-2016)
Nagoya University (2014) |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2014-04-01 – 2017-03-31
|
| Project Status |
Completed (Fiscal Year 2016)
|
| Budget Amount *help |
¥3,640,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥840,000)
Fiscal Year 2016: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Keywords | 組合せデザイン / t-MOD / t-SEED / 量子ジャンプ符号 / 巡回群の直和分解 / 複素数体上のデザイン / ｔ－MOD / 球面デザイン |
|---|
| Outline of Final Research Achievements |
In this project, we introduced a notion of t-MOD, which is a mathematical formulation of a quantum jump code related to the error correction of memories of a quantum computer. A complete t-MOD with maximum dimension among t-MODs with given length and error correcting ability is considered and its combinatorial structure is characterized. We gave some nonexistence results of complete t-MOD and a example of a complete 1-MOD.
On the other hand, we obtain constructions of a binary t-MOD, called a t-SEED, by utilizing affine geometry. Moreover, we find a sufficient condition by introducing the notion of`lcm-closure' to the multifold factorization problem of cyclic groups, which is closely related to the construction of 2-SEEDs.
|
